./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P --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 d721a74d879c75d156b7dfbd9383140c70ef6831602ea84a0f8988cd7fdc0c32 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 23:15:06,814 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 23:15:06,817 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 23:15:06,885 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 23:15:06,886 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 23:15:06,887 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 23:15:06,890 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 23:15:06,893 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 23:15:06,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 23:15:06,898 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 23:15:06,899 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 23:15:06,901 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 23:15:06,902 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 23:15:06,904 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 23:15:06,906 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 23:15:06,908 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 23:15:06,910 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 23:15:06,912 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 23:15:06,915 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 23:15:06,918 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 23:15:06,921 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 23:15:06,923 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 23:15:06,925 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 23:15:06,927 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 23:15:06,932 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 23:15:06,933 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 23:15:06,933 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 23:15:06,935 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 23:15:06,936 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 23:15:06,937 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 23:15:06,938 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 23:15:06,939 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 23:15:06,940 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 23:15:06,942 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 23:15:06,943 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 23:15:06,944 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 23:15:06,946 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 23:15:06,947 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 23:15:06,947 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 23:15:06,948 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 23:15:06,949 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 23:15:06,951 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-20 23:15:06,983 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 23:15:06,983 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 23:15:06,984 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 23:15:06,984 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 23:15:06,985 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 23:15:06,985 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 23:15:06,986 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-20 23:15:06,986 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-20 23:15:06,986 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-20 23:15:06,987 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-20 23:15:06,987 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-20 23:15:06,987 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-20 23:15:06,987 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-20 23:15:06,988 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-20 23:15:06,988 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-20 23:15:06,988 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-20 23:15:06,989 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-20 23:15:06,989 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-20 23:15:06,990 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 23:15:06,990 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 23:15:06,991 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 23:15:06,991 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 23:15:06,991 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 23:15:06,992 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-20 23:15:06,992 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 23:15:06,992 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-20 23:15:06,992 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 23:15:06,993 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 23:15:06,993 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 23:15:06,993 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-20 23:15:06,994 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 23:15:06,994 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 23:15:06,994 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 23:15:06,995 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 23:15:06,995 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 23:15:06,995 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-20 23:15:06,996 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-20 23:15:06,996 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 23:15:06,996 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-20 23:15:06,997 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 23:15:06,997 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-20 23:15:06,997 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/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_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P 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 -> d721a74d879c75d156b7dfbd9383140c70ef6831602ea84a0f8988cd7fdc0c32 [2021-11-20 23:15:07,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 23:15:07,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 23:15:07,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 23:15:07,362 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 23:15:07,363 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 23:15:07,365 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c [2021-11-20 23:15:07,470 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/data/29edfb651/b19685e75bc94145af28c87974946960/FLAGbe3e057cf [2021-11-20 23:15:07,999 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 23:15:08,000 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c [2021-11-20 23:15:08,010 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/data/29edfb651/b19685e75bc94145af28c87974946960/FLAGbe3e057cf [2021-11-20 23:15:08,358 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/data/29edfb651/b19685e75bc94145af28c87974946960 [2021-11-20 23:15:08,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 23:15:08,363 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 23:15:08,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 23:15:08,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 23:15:08,369 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 23:15:08,370 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:15:08" (1/1) ... [2021-11-20 23:15:08,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e37cfd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:08, skipping insertion in model container [2021-11-20 23:15:08,372 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:15:08" (1/1) ... [2021-11-20 23:15:08,383 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 23:15:08,435 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 23:15:08,773 WARN L230 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_f10f9256-459e-496a-a837-7297114cb454/sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c[3770,3783] [2021-11-20 23:15:08,797 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 23:15:08,806 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 23:15:08,838 WARN L230 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_f10f9256-459e-496a-a837-7297114cb454/sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c[3770,3783] [2021-11-20 23:15:08,844 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 23:15:08,862 INFO L208 MainTranslator]: Completed translation [2021-11-20 23:15:08,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:08 WrapperNode [2021-11-20 23:15:08,863 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 23:15:08,864 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 23:15:08,864 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 23:15:08,864 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 23:15:08,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:08" (1/1) ... [2021-11-20 23:15:08,885 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:08" (1/1) ... [2021-11-20 23:15:08,919 INFO L137 Inliner]: procedures = 27, calls = 73, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 245 [2021-11-20 23:15:08,920 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 23:15:08,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 23:15:08,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 23:15:08,921 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 23:15:08,935 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:08" (1/1) ... [2021-11-20 23:15:08,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:08" (1/1) ... [2021-11-20 23:15:08,953 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:08" (1/1) ... [2021-11-20 23:15:08,953 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:08" (1/1) ... [2021-11-20 23:15:08,979 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:08" (1/1) ... [2021-11-20 23:15:08,985 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:08" (1/1) ... [2021-11-20 23:15:08,988 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:08" (1/1) ... [2021-11-20 23:15:08,993 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 23:15:08,994 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 23:15:08,994 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 23:15:08,994 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 23:15:08,996 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:08" (1/1) ... [2021-11-20 23:15:09,017 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 23:15:09,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:15:09,044 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 23:15:09,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 23:15:09,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 23:15:09,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-20 23:15:09,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-20 23:15:09,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-20 23:15:09,095 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-11-20 23:15:09,095 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-11-20 23:15:09,095 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-11-20 23:15:09,096 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-11-20 23:15:09,096 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-11-20 23:15:09,096 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-11-20 23:15:09,096 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-11-20 23:15:09,096 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-11-20 23:15:09,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-20 23:15:09,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-11-20 23:15:09,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-11-20 23:15:09,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-20 23:15:09,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 23:15:09,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 23:15:09,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-20 23:15:09,099 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-20 23:15:09,216 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 23:15:09,218 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 23:15:09,816 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 23:15:10,120 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 23:15:10,121 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-20 23:15:10,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:15:10 BoogieIcfgContainer [2021-11-20 23:15:10,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 23:15:10,126 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 23:15:10,126 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 23:15:10,131 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 23:15:10,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:15:08" (1/3) ... [2021-11-20 23:15:10,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b58db23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:15:10, skipping insertion in model container [2021-11-20 23:15:10,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:08" (2/3) ... [2021-11-20 23:15:10,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b58db23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:15:10, skipping insertion in model container [2021-11-20 23:15:10,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:15:10" (3/3) ... [2021-11-20 23:15:10,135 INFO L111 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-equiv.wvr.c [2021-11-20 23:15:10,141 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-20 23:15:10,142 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 23:15:10,142 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-20 23:15:10,142 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-20 23:15:10,196 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,197 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,197 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,198 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,198 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,198 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,199 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,199 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,199 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,200 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,200 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,200 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,200 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,201 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,201 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,201 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,202 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,202 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,202 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,202 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,203 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,203 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,203 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,203 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,204 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,204 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,204 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,204 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,205 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,205 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,205 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,205 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,206 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,206 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,206 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,206 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,207 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,207 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,208 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,208 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,208 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,208 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,209 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,209 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,209 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,209 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,210 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,210 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,210 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,210 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,211 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,211 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,211 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,212 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,212 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,212 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,212 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,212 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,213 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,213 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,213 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,213 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,214 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,214 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,215 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,215 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,215 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,215 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,216 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,216 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,216 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,216 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,217 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,217 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,217 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,217 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,218 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,218 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,218 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,218 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,219 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,220 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,220 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,221 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,221 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,222 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,222 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,223 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,223 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,223 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,224 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,224 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,224 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,224 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,224 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,225 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,225 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,225 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,226 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,226 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,226 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,226 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,226 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,227 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,227 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,228 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,229 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,229 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,229 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,229 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,230 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,230 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,230 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,230 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,231 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,231 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,231 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,231 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,232 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,232 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,232 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,232 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,232 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,233 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,233 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,233 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,233 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,234 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,234 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,234 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,234 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,235 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,235 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,235 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,235 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,235 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,236 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,236 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,236 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,236 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,237 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,237 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,237 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,238 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,240 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,240 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,240 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,241 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,241 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,241 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,241 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,242 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,242 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,242 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,242 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,243 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,243 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,243 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,243 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,244 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,244 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,244 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,244 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,244 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,245 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,245 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,245 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,245 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,246 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,246 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,246 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,246 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,246 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,247 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,247 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,247 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,247 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,248 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,248 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,248 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,248 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,248 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,249 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,249 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,255 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,256 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,256 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,256 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,256 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,257 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,257 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,257 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,257 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,258 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,258 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,259 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,260 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,265 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,265 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,265 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,265 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,266 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,267 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,267 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,268 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,268 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,275 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,275 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,275 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,276 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,278 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,278 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,278 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,279 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,279 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,279 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,279 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,280 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,280 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,280 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,280 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,281 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,281 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,283 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,283 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,283 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,284 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,284 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,284 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,284 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,284 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,286 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,286 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,287 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,287 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,300 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,300 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,300 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,300 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,301 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,301 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,301 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,301 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,302 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,302 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,302 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,302 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,302 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,305 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,305 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,306 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,306 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,306 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,307 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,307 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,309 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,309 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,309 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,309 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,310 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,310 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:15:10,320 INFO L148 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2021-11-20 23:15:10,390 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 23:15:10,399 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-20 23:15:10,400 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-11-20 23:15:10,422 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-20 23:15:10,439 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 204 places, 205 transitions, 454 flow [2021-11-20 23:15:10,443 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 204 places, 205 transitions, 454 flow [2021-11-20 23:15:10,445 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 204 places, 205 transitions, 454 flow [2021-11-20 23:15:10,540 INFO L129 PetriNetUnfolder]: 14/190 cut-off events. [2021-11-20 23:15:10,541 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-11-20 23:15:10,552 INFO L84 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 190 events. 14/190 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 162 event pairs, 0 based on Foata normal form. 0/175 useless extension candidates. Maximal degree in co-relation 162. Up to 3 conditions per place. [2021-11-20 23:15:10,558 INFO L116 LiptonReduction]: Number of co-enabled transitions 2612 [2021-11-20 23:15:19,614 INFO L131 LiptonReduction]: Checked pairs total: 7840 [2021-11-20 23:15:19,615 INFO L133 LiptonReduction]: Total number of compositions: 182 [2021-11-20 23:15:19,626 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 56 places, 49 transitions, 142 flow [2021-11-20 23:15:19,704 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 471 states, 470 states have (on average 3.3957446808510636) internal successors, (1596), 470 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:19,708 INFO L276 IsEmpty]: Start isEmpty. Operand has 471 states, 470 states have (on average 3.3957446808510636) internal successors, (1596), 470 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:19,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 23:15:19,734 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:19,735 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:19,736 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:15:19,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:19,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1226819905, now seen corresponding path program 1 times [2021-11-20 23:15:19,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:19,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175687141] [2021-11-20 23:15:19,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:19,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:20,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:15:20,154 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:20,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175687141] [2021-11-20 23:15:20,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175687141] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:15:20,156 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:15:20,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-20 23:15:20,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270337804] [2021-11-20 23:15:20,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:15:20,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 23:15:20,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:20,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 23:15:20,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 23:15:20,200 INFO L87 Difference]: Start difference. First operand has 471 states, 470 states have (on average 3.3957446808510636) internal successors, (1596), 470 states have internal predecessors, (1596), 0 states have call successors, (0), 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 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:20,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:20,416 INFO L93 Difference]: Finished difference Result 1084 states and 3763 transitions. [2021-11-20 23:15:20,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 23:15:20,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-20 23:15:20,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:20,456 INFO L225 Difference]: With dead ends: 1084 [2021-11-20 23:15:20,457 INFO L226 Difference]: Without dead ends: 1065 [2021-11-20 23:15:20,458 INFO L932 BasicCegarLoop]: 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 [2021-11-20 23:15:20,464 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 34 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:20,466 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 36 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 23:15:20,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2021-11-20 23:15:20,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 721. [2021-11-20 23:15:20,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 720 states have (on average 3.3930555555555557) internal successors, (2443), 720 states have internal predecessors, (2443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:20,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 2443 transitions. [2021-11-20 23:15:20,651 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 2443 transitions. Word has length 31 [2021-11-20 23:15:20,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:20,653 INFO L470 AbstractCegarLoop]: Abstraction has 721 states and 2443 transitions. [2021-11-20 23:15:20,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:20,653 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 2443 transitions. [2021-11-20 23:15:20,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 23:15:20,658 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:20,658 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:20,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-20 23:15:20,659 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:15:20,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:20,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1480133907, now seen corresponding path program 2 times [2021-11-20 23:15:20,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:20,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315788766] [2021-11-20 23:15:20,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:20,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:20,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:15:20,822 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:20,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315788766] [2021-11-20 23:15:20,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315788766] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:15:20,823 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:15:20,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-20 23:15:20,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997809300] [2021-11-20 23:15:20,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:15:20,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 23:15:20,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:20,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 23:15:20,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 23:15:20,827 INFO L87 Difference]: Start difference. First operand 721 states and 2443 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:21,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:21,056 INFO L93 Difference]: Finished difference Result 1084 states and 3758 transitions. [2021-11-20 23:15:21,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 23:15:21,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-20 23:15:21,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:21,070 INFO L225 Difference]: With dead ends: 1084 [2021-11-20 23:15:21,070 INFO L226 Difference]: Without dead ends: 1065 [2021-11-20 23:15:21,071 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-20 23:15:21,075 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 35 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:21,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 48 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 23:15:21,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2021-11-20 23:15:21,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 725. [2021-11-20 23:15:21,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 724 states have (on average 3.388121546961326) internal successors, (2453), 724 states have internal predecessors, (2453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:21,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 2453 transitions. [2021-11-20 23:15:21,130 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 2453 transitions. Word has length 31 [2021-11-20 23:15:21,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:21,130 INFO L470 AbstractCegarLoop]: Abstraction has 725 states and 2453 transitions. [2021-11-20 23:15:21,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:21,131 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 2453 transitions. [2021-11-20 23:15:21,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-20 23:15:21,136 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:21,136 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:21,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-20 23:15:21,137 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:15:21,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:21,138 INFO L85 PathProgramCache]: Analyzing trace with hash -624962275, now seen corresponding path program 1 times [2021-11-20 23:15:21,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:21,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200604084] [2021-11-20 23:15:21,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:21,145 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:21,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:15:21,330 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:21,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200604084] [2021-11-20 23:15:21,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200604084] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:15:21,331 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:15:21,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 23:15:21,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791433053] [2021-11-20 23:15:21,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:15:21,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 23:15:21,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:21,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 23:15:21,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-20 23:15:21,334 INFO L87 Difference]: Start difference. First operand 725 states and 2453 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:21,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:21,537 INFO L93 Difference]: Finished difference Result 1433 states and 4719 transitions. [2021-11-20 23:15:21,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 23:15:21,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-20 23:15:21,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:21,555 INFO L225 Difference]: With dead ends: 1433 [2021-11-20 23:15:21,555 INFO L226 Difference]: Without dead ends: 1365 [2021-11-20 23:15:21,556 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-20 23:15:21,557 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 75 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:21,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 43 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 23:15:21,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2021-11-20 23:15:21,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1235. [2021-11-20 23:15:21,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 1234 states have (on average 3.3889789303079416) internal successors, (4182), 1234 states have internal predecessors, (4182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:21,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 4182 transitions. [2021-11-20 23:15:21,626 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 4182 transitions. Word has length 32 [2021-11-20 23:15:21,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:21,627 INFO L470 AbstractCegarLoop]: Abstraction has 1235 states and 4182 transitions. [2021-11-20 23:15:21,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:21,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 4182 transitions. [2021-11-20 23:15:21,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-20 23:15:21,679 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:21,679 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:21,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-20 23:15:21,680 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:15:21,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:21,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1314025826, now seen corresponding path program 1 times [2021-11-20 23:15:21,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:21,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486277660] [2021-11-20 23:15:21,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:21,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:21,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:15:21,864 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:21,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486277660] [2021-11-20 23:15:21,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486277660] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:15:21,871 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:15:21,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 23:15:21,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736142274] [2021-11-20 23:15:21,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:15:21,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 23:15:21,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:21,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 23:15:21,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 23:15:21,879 INFO L87 Difference]: Start difference. First operand 1235 states and 4182 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:22,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:22,087 INFO L93 Difference]: Finished difference Result 937 states and 2817 transitions. [2021-11-20 23:15:22,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 23:15:22,088 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-11-20 23:15:22,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:22,097 INFO L225 Difference]: With dead ends: 937 [2021-11-20 23:15:22,098 INFO L226 Difference]: Without dead ends: 704 [2021-11-20 23:15:22,098 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-20 23:15:22,102 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 82 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:22,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 43 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 23:15:22,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2021-11-20 23:15:22,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 704. [2021-11-20 23:15:22,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 703 states have (on average 3.193456614509246) internal successors, (2245), 703 states have internal predecessors, (2245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:22,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 2245 transitions. [2021-11-20 23:15:22,149 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 2245 transitions. Word has length 33 [2021-11-20 23:15:22,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:22,150 INFO L470 AbstractCegarLoop]: Abstraction has 704 states and 2245 transitions. [2021-11-20 23:15:22,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:22,150 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 2245 transitions. [2021-11-20 23:15:22,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-20 23:15:22,156 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:22,156 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:22,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-20 23:15:22,157 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:15:22,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:22,161 INFO L85 PathProgramCache]: Analyzing trace with hash -551905392, now seen corresponding path program 1 times [2021-11-20 23:15:22,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:22,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772608692] [2021-11-20 23:15:22,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:22,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:22,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:15:22,308 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:22,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772608692] [2021-11-20 23:15:22,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772608692] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:15:22,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840599340] [2021-11-20 23:15:22,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:22,310 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:15:22,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:15:22,315 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:15:22,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-20 23:15:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:22,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-20 23:15:22,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:15:22,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:15:22,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:15:22,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:15:22,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840599340] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:15:22,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [724528390] [2021-11-20 23:15:22,967 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:15:22,971 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:15:22,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2021-11-20 23:15:22,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998107399] [2021-11-20 23:15:22,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:15:22,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-20 23:15:22,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:22,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-20 23:15:22,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-11-20 23:15:22,974 INFO L87 Difference]: Start difference. First operand 704 states and 2245 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 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) [2021-11-20 23:15:23,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:23,367 INFO L93 Difference]: Finished difference Result 1390 states and 4302 transitions. [2021-11-20 23:15:23,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 23:15:23,368 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 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 33 [2021-11-20 23:15:23,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:23,382 INFO L225 Difference]: With dead ends: 1390 [2021-11-20 23:15:23,382 INFO L226 Difference]: Without dead ends: 1234 [2021-11-20 23:15:23,382 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-11-20 23:15:23,383 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 193 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:23,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 130 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-20 23:15:23,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2021-11-20 23:15:23,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1126. [2021-11-20 23:15:23,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 1125 states have (on average 3.2071111111111112) internal successors, (3608), 1125 states have internal predecessors, (3608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:23,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 3608 transitions. [2021-11-20 23:15:23,468 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 3608 transitions. Word has length 33 [2021-11-20 23:15:23,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:23,469 INFO L470 AbstractCegarLoop]: Abstraction has 1126 states and 3608 transitions. [2021-11-20 23:15:23,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 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) [2021-11-20 23:15:23,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 3608 transitions. [2021-11-20 23:15:23,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-20 23:15:23,476 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:23,476 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:23,519 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-20 23:15:23,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:15:23,692 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:15:23,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:23,692 INFO L85 PathProgramCache]: Analyzing trace with hash 875842555, now seen corresponding path program 1 times [2021-11-20 23:15:23,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:23,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163565225] [2021-11-20 23:15:23,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:23,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:23,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:15:23,799 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:23,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163565225] [2021-11-20 23:15:23,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163565225] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:15:23,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233409161] [2021-11-20 23:15:23,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:23,803 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:15:23,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:15:23,807 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:15:23,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-20 23:15:23,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:23,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-20 23:15:23,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:15:24,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:15:24,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:15:24,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:15:24,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233409161] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:15:24,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [176137715] [2021-11-20 23:15:24,289 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:15:24,293 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:15:24,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2021-11-20 23:15:24,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263948620] [2021-11-20 23:15:24,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:15:24,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-20 23:15:24,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:24,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-20 23:15:24,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-11-20 23:15:24,298 INFO L87 Difference]: Start difference. First operand 1126 states and 3608 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 10 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) [2021-11-20 23:15:24,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:24,527 INFO L93 Difference]: Finished difference Result 806 states and 2448 transitions. [2021-11-20 23:15:24,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 23:15:24,528 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 10 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 34 [2021-11-20 23:15:24,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:24,536 INFO L225 Difference]: With dead ends: 806 [2021-11-20 23:15:24,536 INFO L226 Difference]: Without dead ends: 705 [2021-11-20 23:15:24,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-11-20 23:15:24,537 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 69 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:24,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 74 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 23:15:24,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2021-11-20 23:15:24,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2021-11-20 23:15:24,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 704 states have (on average 3.190340909090909) internal successors, (2246), 704 states have internal predecessors, (2246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:24,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 2246 transitions. [2021-11-20 23:15:24,573 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 2246 transitions. Word has length 34 [2021-11-20 23:15:24,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:24,573 INFO L470 AbstractCegarLoop]: Abstraction has 705 states and 2246 transitions. [2021-11-20 23:15:24,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 10 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) [2021-11-20 23:15:24,574 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 2246 transitions. [2021-11-20 23:15:24,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-20 23:15:24,577 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:24,578 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:24,627 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-20 23:15:24,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:15:24,795 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:15:24,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:24,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1712857981, now seen corresponding path program 2 times [2021-11-20 23:15:24,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:24,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092139320] [2021-11-20 23:15:24,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:24,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:24,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:15:24,905 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:24,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092139320] [2021-11-20 23:15:24,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092139320] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:15:24,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571879477] [2021-11-20 23:15:24,906 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:15:24,907 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:15:24,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:15:24,911 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:15:24,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-20 23:15:25,047 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-20 23:15:25,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:15:25,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-20 23:15:25,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:15:25,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:15:25,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:15:25,365 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:15:25,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571879477] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-20 23:15:25,365 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-20 23:15:25,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2021-11-20 23:15:25,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466926825] [2021-11-20 23:15:25,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:15:25,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 23:15:25,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:25,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 23:15:25,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-11-20 23:15:25,368 INFO L87 Difference]: Start difference. First operand 705 states and 2246 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 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) [2021-11-20 23:15:25,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:25,496 INFO L93 Difference]: Finished difference Result 573 states and 1864 transitions. [2021-11-20 23:15:25,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 23:15:25,497 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 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 34 [2021-11-20 23:15:25,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:25,517 INFO L225 Difference]: With dead ends: 573 [2021-11-20 23:15:25,517 INFO L226 Difference]: Without dead ends: 573 [2021-11-20 23:15:25,518 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-11-20 23:15:25,519 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 137 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:25,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 18 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 23:15:25,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2021-11-20 23:15:25,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 533. [2021-11-20 23:15:25,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 532 states have (on average 3.263157894736842) internal successors, (1736), 532 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:25,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 1736 transitions. [2021-11-20 23:15:25,570 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 1736 transitions. Word has length 34 [2021-11-20 23:15:25,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:25,571 INFO L470 AbstractCegarLoop]: Abstraction has 533 states and 1736 transitions. [2021-11-20 23:15:25,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 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) [2021-11-20 23:15:25,571 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 1736 transitions. [2021-11-20 23:15:25,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-20 23:15:25,574 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:25,575 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:25,621 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-20 23:15:25,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:15:25,799 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:15:25,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:25,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1930936914, now seen corresponding path program 2 times [2021-11-20 23:15:25,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:25,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028116220] [2021-11-20 23:15:25,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:25,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:25,908 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:15:25,908 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:25,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028116220] [2021-11-20 23:15:25,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028116220] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:15:25,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407895856] [2021-11-20 23:15:25,909 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:15:25,909 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:15:25,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:15:25,910 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:15:25,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-20 23:15:26,050 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-20 23:15:26,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:15:26,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-20 23:15:26,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:15:26,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:15:26,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:15:26,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:15:26,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407895856] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-20 23:15:26,369 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-20 23:15:26,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2021-11-20 23:15:26,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857247732] [2021-11-20 23:15:26,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:15:26,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 23:15:26,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:26,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 23:15:26,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-11-20 23:15:26,372 INFO L87 Difference]: Start difference. First operand 533 states and 1736 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:26,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:26,487 INFO L93 Difference]: Finished difference Result 639 states and 2104 transitions. [2021-11-20 23:15:26,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 23:15:26,488 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-11-20 23:15:26,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:26,496 INFO L225 Difference]: With dead ends: 639 [2021-11-20 23:15:26,496 INFO L226 Difference]: Without dead ends: 639 [2021-11-20 23:15:26,497 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-11-20 23:15:26,498 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 109 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:26,498 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 25 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 23:15:26,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2021-11-20 23:15:26,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2021-11-20 23:15:26,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 638 states have (on average 3.2978056426332287) internal successors, (2104), 638 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:26,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 2104 transitions. [2021-11-20 23:15:26,532 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 2104 transitions. Word has length 35 [2021-11-20 23:15:26,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:26,533 INFO L470 AbstractCegarLoop]: Abstraction has 639 states and 2104 transitions. [2021-11-20 23:15:26,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:26,534 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 2104 transitions. [2021-11-20 23:15:26,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 23:15:26,537 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:26,537 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:26,585 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-20 23:15:26,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:15:26,751 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:15:26,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:26,752 INFO L85 PathProgramCache]: Analyzing trace with hash 268824144, now seen corresponding path program 1 times [2021-11-20 23:15:26,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:26,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674943740] [2021-11-20 23:15:26,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:26,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:26,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:27,393 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:15:27,393 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:27,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674943740] [2021-11-20 23:15:27,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674943740] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:15:27,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280192433] [2021-11-20 23:15:27,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:27,394 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:15:27,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:15:27,399 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:15:27,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-20 23:15:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:27,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 58 conjunts are in the unsatisfiable core [2021-11-20 23:15:27,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:15:27,948 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-20 23:15:27,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2021-11-20 23:15:28,142 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-20 23:15:28,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2021-11-20 23:15:28,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 10 [2021-11-20 23:15:28,275 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:15:28,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:15:39,709 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~#t4~0#1.offset| Int) (|ULTIMATE.start_main_#t~pre30#1| Int) (|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (< (select (select (let ((.cse0 (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| (store (select |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|)))) (store .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base|) |ULTIMATE.start_main_~#t4~0#1.offset| |ULTIMATE.start_main_#t~pre30#1|))) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_2~0 c_~t_4~0 1))) (forall ((|ULTIMATE.start_main_~#t4~0#1.offset| Int) (|ULTIMATE.start_main_#t~pre30#1| Int) (|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (<= (+ c_~s_2~0 c_~t_4~0) (select (select (let ((.cse1 (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| (store (select |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|)))) (store .cse1 |c_ULTIMATE.start_main_~#t4~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#t4~0#1.base|) |ULTIMATE.start_main_~#t4~0#1.offset| |ULTIMATE.start_main_#t~pre30#1|))) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) is different from false [2021-11-20 23:15:39,729 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:15:39,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 128 treesize of output 101 [2021-11-20 23:15:39,846 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:15:39,847 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:15:39,855 INFO L354 Elim1Store]: treesize reduction 11, result has 26.7 percent of original size [2021-11-20 23:15:39,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 11 [2021-11-20 23:15:40,071 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:15:40,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280192433] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:15:40,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1218418543] [2021-11-20 23:15:40,072 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:15:40,073 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:15:40,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24 [2021-11-20 23:15:40,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446395396] [2021-11-20 23:15:40,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:15:40,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-20 23:15:40,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:40,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-20 23:15:40,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=512, Unknown=3, NotChecked=46, Total=650 [2021-11-20 23:15:40,077 INFO L87 Difference]: Start difference. First operand 639 states and 2104 transitions. Second operand has 26 states, 25 states have (on average 3.72) internal successors, (93), 25 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:42,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:42,218 INFO L93 Difference]: Finished difference Result 1588 states and 5393 transitions. [2021-11-20 23:15:42,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-20 23:15:42,219 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.72) internal successors, (93), 25 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-20 23:15:42,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:42,241 INFO L225 Difference]: With dead ends: 1588 [2021-11-20 23:15:42,241 INFO L226 Difference]: Without dead ends: 1547 [2021-11-20 23:15:42,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 54 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=365, Invalid=1358, Unknown=3, NotChecked=80, Total=1806 [2021-11-20 23:15:42,245 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 628 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 1461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 277 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:42,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [628 Valid, 188 Invalid, 1461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1054 Invalid, 0 Unknown, 277 Unchecked, 1.1s Time] [2021-11-20 23:15:42,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2021-11-20 23:15:42,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 903. [2021-11-20 23:15:42,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 902 states have (on average 3.2971175166297115) internal successors, (2974), 902 states have internal predecessors, (2974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:42,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 2974 transitions. [2021-11-20 23:15:42,307 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 2974 transitions. Word has length 36 [2021-11-20 23:15:42,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:42,308 INFO L470 AbstractCegarLoop]: Abstraction has 903 states and 2974 transitions. [2021-11-20 23:15:42,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.72) internal successors, (93), 25 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:42,308 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 2974 transitions. [2021-11-20 23:15:42,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 23:15:42,314 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:42,314 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:42,364 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-20 23:15:42,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-11-20 23:15:42,530 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:15:42,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:42,531 INFO L85 PathProgramCache]: Analyzing trace with hash 341339262, now seen corresponding path program 2 times [2021-11-20 23:15:42,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:42,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603567808] [2021-11-20 23:15:42,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:42,531 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:42,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:43,215 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:15:43,216 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:43,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603567808] [2021-11-20 23:15:43,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603567808] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:15:43,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816622315] [2021-11-20 23:15:43,216 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:15:43,216 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:15:43,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:15:43,219 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:15:43,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-20 23:15:43,372 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-20 23:15:43,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:15:43,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 64 conjunts are in the unsatisfiable core [2021-11-20 23:15:43,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:15:43,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:43,416 INFO L354 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2021-11-20 23:15:43,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 16 [2021-11-20 23:15:43,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:43,603 INFO L354 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2021-11-20 23:15:43,604 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 25 treesize of output 33 [2021-11-20 23:15:43,863 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-20 23:15:43,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2021-11-20 23:15:44,034 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-20 23:15:44,034 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2021-11-20 23:15:44,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 10 [2021-11-20 23:15:44,280 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:15:44,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:16:04,345 WARN L227 SmtUtils]: Spent 7.02s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 23:16:04,433 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:16:04,434 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 128 treesize of output 101 [2021-11-20 23:16:04,541 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:16:04,542 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:16:04,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:16:04,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 5 [2021-11-20 23:16:05,017 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:16:05,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816622315] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:16:05,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [854667477] [2021-11-20 23:16:05,018 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:16:05,018 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:16:05,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 26 [2021-11-20 23:16:05,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529825945] [2021-11-20 23:16:05,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:16:05,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-11-20 23:16:05,020 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:16:05,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-11-20 23:16:05,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=659, Unknown=6, NotChecked=0, Total=756 [2021-11-20 23:16:05,021 INFO L87 Difference]: Start difference. First operand 903 states and 2974 transitions. Second operand has 28 states, 27 states have (on average 3.074074074074074) internal successors, (83), 27 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:07,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:16:07,687 INFO L93 Difference]: Finished difference Result 1322 states and 4473 transitions. [2021-11-20 23:16:07,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-20 23:16:07,688 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.074074074074074) internal successors, (83), 27 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-20 23:16:07,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:16:07,703 INFO L225 Difference]: With dead ends: 1322 [2021-11-20 23:16:07,704 INFO L226 Difference]: Without dead ends: 1281 [2021-11-20 23:16:07,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=322, Invalid=1742, Unknown=6, NotChecked=0, Total=2070 [2021-11-20 23:16:07,706 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 373 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 1549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 131 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:16:07,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 235 Invalid, 1549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1342 Invalid, 0 Unknown, 131 Unchecked, 1.3s Time] [2021-11-20 23:16:07,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2021-11-20 23:16:07,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 931. [2021-11-20 23:16:07,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 930 states have (on average 3.30752688172043) internal successors, (3076), 930 states have internal predecessors, (3076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:07,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 3076 transitions. [2021-11-20 23:16:07,757 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 3076 transitions. Word has length 36 [2021-11-20 23:16:07,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:16:07,758 INFO L470 AbstractCegarLoop]: Abstraction has 931 states and 3076 transitions. [2021-11-20 23:16:07,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.074074074074074) internal successors, (83), 27 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:07,758 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 3076 transitions. [2021-11-20 23:16:07,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 23:16:07,763 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:16:07,763 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:16:07,810 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-20 23:16:07,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-20 23:16:07,985 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:16:07,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:16:07,985 INFO L85 PathProgramCache]: Analyzing trace with hash 899845916, now seen corresponding path program 3 times [2021-11-20 23:16:07,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:16:07,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458082541] [2021-11-20 23:16:07,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:16:07,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:16:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:16:08,497 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:16:08,498 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:16:08,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458082541] [2021-11-20 23:16:08,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458082541] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:16:08,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799194063] [2021-11-20 23:16:08,498 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:16:08,498 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:16:08,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:16:08,504 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:16:08,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-20 23:16:08,637 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:16:08,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:16:08,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 61 conjunts are in the unsatisfiable core [2021-11-20 23:16:08,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:16:08,653 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-20 23:16:08,904 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-20 23:16:08,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 26 treesize of output 25 [2021-11-20 23:16:09,032 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-20 23:16:09,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2021-11-20 23:16:09,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-20 23:16:09,274 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:16:09,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:16:10,638 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~#t4~0#1.offset| Int) (|ULTIMATE.start_main_#t~pre30#1| Int)) (< (+ c_~s_2~0 c_~t_4~0) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base|) |ULTIMATE.start_main_~#t4~0#1.offset| |ULTIMATE.start_main_#t~pre30#1|)) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 1))) (forall ((|ULTIMATE.start_main_~#t4~0#1.offset| Int) (|ULTIMATE.start_main_#t~pre30#1| Int)) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base|) |ULTIMATE.start_main_~#t4~0#1.offset| |ULTIMATE.start_main_#t~pre30#1|)) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_2~0 c_~t_4~0)))) is different from false [2021-11-20 23:16:12,348 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~#t4~0#1.offset| Int) (|ULTIMATE.start_main_#t~pre30#1| Int) (|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (< (+ c_~s_2~0 c_~t_4~0) (+ (select (select (let ((.cse0 (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| (store (select |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|)))) (store .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base|) |ULTIMATE.start_main_~#t4~0#1.offset| |ULTIMATE.start_main_#t~pre30#1|))) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 1))) (forall ((|ULTIMATE.start_main_~#t4~0#1.offset| Int) (|ULTIMATE.start_main_#t~pre30#1| Int) (|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (<= (select (select (let ((.cse1 (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| (store (select |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|)))) (store .cse1 |c_ULTIMATE.start_main_~#t4~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#t4~0#1.base|) |ULTIMATE.start_main_~#t4~0#1.offset| |ULTIMATE.start_main_#t~pre30#1|))) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_2~0 c_~t_4~0)))) is different from false [2021-11-20 23:16:12,402 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:16:12,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 128 treesize of output 101 [2021-11-20 23:16:12,602 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:16:12,603 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:16:12,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:16:12,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 3 [2021-11-20 23:16:12,817 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:16:12,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799194063] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:16:12,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1103296353] [2021-11-20 23:16:12,818 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:16:12,818 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:16:12,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 21 [2021-11-20 23:16:12,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504212533] [2021-11-20 23:16:12,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:16:12,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-20 23:16:12,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:16:12,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-20 23:16:12,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=355, Unknown=2, NotChecked=78, Total=506 [2021-11-20 23:16:12,821 INFO L87 Difference]: Start difference. First operand 931 states and 3076 transitions. Second operand has 23 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 22 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) [2021-11-20 23:16:15,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:16:15,658 INFO L93 Difference]: Finished difference Result 1288 states and 4363 transitions. [2021-11-20 23:16:15,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-20 23:16:15,659 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 22 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) Word has length 36 [2021-11-20 23:16:15,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:16:15,672 INFO L225 Difference]: With dead ends: 1288 [2021-11-20 23:16:15,672 INFO L226 Difference]: Without dead ends: 1243 [2021-11-20 23:16:15,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 54 SyntacticMatches, 9 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=237, Invalid=825, Unknown=2, NotChecked=126, Total=1190 [2021-11-20 23:16:15,674 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 290 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 218 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-20 23:16:15,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [290 Valid, 150 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 927 Invalid, 0 Unknown, 218 Unchecked, 0.7s Time] [2021-11-20 23:16:15,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2021-11-20 23:16:15,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 955. [2021-11-20 23:16:15,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 954 states have (on average 3.3207547169811322) internal successors, (3168), 954 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:15,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 3168 transitions. [2021-11-20 23:16:15,723 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 3168 transitions. Word has length 36 [2021-11-20 23:16:15,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:16:15,724 INFO L470 AbstractCegarLoop]: Abstraction has 955 states and 3168 transitions. [2021-11-20 23:16:15,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 22 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) [2021-11-20 23:16:15,724 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 3168 transitions. [2021-11-20 23:16:15,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 23:16:15,729 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:16:15,730 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:16:15,773 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-20 23:16:15,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-20 23:16:15,949 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:16:15,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:16:15,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1961781948, now seen corresponding path program 4 times [2021-11-20 23:16:15,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:16:15,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198922244] [2021-11-20 23:16:15,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:16:15,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:16:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:16:16,540 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:16:16,540 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:16:16,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198922244] [2021-11-20 23:16:16,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198922244] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:16:16,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602476350] [2021-11-20 23:16:16,541 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:16:16,541 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:16:16,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:16:16,543 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:16:16,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-20 23:16:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:16:16,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 60 conjunts are in the unsatisfiable core [2021-11-20 23:16:16,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:16:16,993 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-20 23:16:16,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2021-11-20 23:16:17,205 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-20 23:16:17,205 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2021-11-20 23:16:17,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 10 [2021-11-20 23:16:17,351 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:16:17,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:16:18,808 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| (store (select |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|)) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4))) (+ c_~s_2~0 1))) (forall ((|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (<= c_~s_2~0 (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| (store (select |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|)) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4)))))) is different from false [2021-11-20 23:16:47,768 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:16:47,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 132 treesize of output 105 [2021-11-20 23:16:47,862 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:16:47,863 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:16:47,871 INFO L354 Elim1Store]: treesize reduction 11, result has 26.7 percent of original size [2021-11-20 23:16:47,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 10 [2021-11-20 23:16:48,048 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-20 23:16:48,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602476350] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:16:48,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2072869306] [2021-11-20 23:16:48,049 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:16:48,049 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:16:48,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2021-11-20 23:16:48,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552151880] [2021-11-20 23:16:48,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:16:48,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-20 23:16:48,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:16:48,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-20 23:16:48,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=509, Unknown=14, NotChecked=46, Total=650 [2021-11-20 23:16:48,052 INFO L87 Difference]: Start difference. First operand 955 states and 3168 transitions. Second operand has 26 states, 25 states have (on average 3.2) internal successors, (80), 25 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:49,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:16:49,512 INFO L93 Difference]: Finished difference Result 1430 states and 4843 transitions. [2021-11-20 23:16:49,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-20 23:16:49,515 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.2) internal successors, (80), 25 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-20 23:16:49,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:16:49,531 INFO L225 Difference]: With dead ends: 1430 [2021-11-20 23:16:49,531 INFO L226 Difference]: Without dead ends: 1395 [2021-11-20 23:16:49,532 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 56 SyntacticMatches, 7 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 31.2s TimeCoverageRelationStatistics Valid=272, Invalid=1124, Unknown=14, NotChecked=72, Total=1482 [2021-11-20 23:16:49,533 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 357 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 1323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 450 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-20 23:16:49,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [357 Valid, 165 Invalid, 1323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 808 Invalid, 0 Unknown, 450 Unchecked, 0.7s Time] [2021-11-20 23:16:49,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2021-11-20 23:16:49,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 943. [2021-11-20 23:16:49,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 942 states have (on average 3.3184713375796178) internal successors, (3126), 942 states have internal predecessors, (3126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:49,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 3126 transitions. [2021-11-20 23:16:49,637 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 3126 transitions. Word has length 36 [2021-11-20 23:16:49,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:16:49,638 INFO L470 AbstractCegarLoop]: Abstraction has 943 states and 3126 transitions. [2021-11-20 23:16:49,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.2) internal successors, (80), 25 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:49,639 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 3126 transitions. [2021-11-20 23:16:49,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 23:16:49,643 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:16:49,644 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:16:49,692 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-20 23:16:49,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:16:49,859 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:16:49,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:16:49,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1524486198, now seen corresponding path program 1 times [2021-11-20 23:16:49,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:16:49,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119271618] [2021-11-20 23:16:49,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:16:49,861 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:16:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:16:50,264 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:16:50,264 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:16:50,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119271618] [2021-11-20 23:16:50,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119271618] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:16:50,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152766157] [2021-11-20 23:16:50,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:16:50,265 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:16:50,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:16:50,267 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:16:50,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-20 23:16:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:16:50,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 58 conjunts are in the unsatisfiable core [2021-11-20 23:16:50,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:16:50,409 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-20 23:16:50,770 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-20 23:16:50,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2021-11-20 23:16:50,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 10 [2021-11-20 23:16:50,867 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:16:50,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:16:58,092 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~#t4~0#1.offset| Int) (|ULTIMATE.start_main_#t~pre30#1| Int)) (<= (+ c_~s_2~0 c_~t_5~0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base|) |ULTIMATE.start_main_~#t4~0#1.offset| |ULTIMATE.start_main_#t~pre30#1|)) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((|ULTIMATE.start_main_~#t4~0#1.offset| Int) (|ULTIMATE.start_main_#t~pre30#1| Int)) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base|) |ULTIMATE.start_main_~#t4~0#1.offset| |ULTIMATE.start_main_#t~pre30#1|)) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_2~0 c_~t_5~0 1)))) is different from false [2021-11-20 23:16:58,121 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:16:58,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 56 treesize of output 47 [2021-11-20 23:16:58,175 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:16:58,181 INFO L354 Elim1Store]: treesize reduction 11, result has 26.7 percent of original size [2021-11-20 23:16:58,181 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 11 [2021-11-20 23:16:59,249 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:16:59,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152766157] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:16:59,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1404880616] [2021-11-20 23:16:59,250 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:16:59,250 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:16:59,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2021-11-20 23:16:59,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009483491] [2021-11-20 23:16:59,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:16:59,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-20 23:16:59,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:16:59,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-20 23:16:59,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=4, NotChecked=32, Total=342 [2021-11-20 23:16:59,253 INFO L87 Difference]: Start difference. First operand 943 states and 3126 transitions. Second operand has 19 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:00,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:17:00,971 INFO L93 Difference]: Finished difference Result 1676 states and 5687 transitions. [2021-11-20 23:17:00,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-20 23:17:00,972 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-20 23:17:00,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:17:00,990 INFO L225 Difference]: With dead ends: 1676 [2021-11-20 23:17:00,991 INFO L226 Difference]: Without dead ends: 1643 [2021-11-20 23:17:00,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=226, Invalid=766, Unknown=4, NotChecked=60, Total=1056 [2021-11-20 23:17:00,992 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 272 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 212 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-20 23:17:00,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [272 Valid, 121 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 870 Invalid, 0 Unknown, 212 Unchecked, 0.7s Time] [2021-11-20 23:17:00,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2021-11-20 23:17:01,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 985. [2021-11-20 23:17:01,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 984 states have (on average 3.3302845528455283) internal successors, (3277), 984 states have internal predecessors, (3277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:01,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 3277 transitions. [2021-11-20 23:17:01,046 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 3277 transitions. Word has length 36 [2021-11-20 23:17:01,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:17:01,046 INFO L470 AbstractCegarLoop]: Abstraction has 985 states and 3277 transitions. [2021-11-20 23:17:01,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:01,047 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 3277 transitions. [2021-11-20 23:17:01,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 23:17:01,052 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:17:01,052 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:17:01,093 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-20 23:17:01,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-20 23:17:01,267 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:17:01,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:17:01,268 INFO L85 PathProgramCache]: Analyzing trace with hash -856137578, now seen corresponding path program 2 times [2021-11-20 23:17:01,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:17:01,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437979057] [2021-11-20 23:17:01,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:17:01,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:17:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:17:01,617 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:17:01,617 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:17:01,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437979057] [2021-11-20 23:17:01,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437979057] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:17:01,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295614629] [2021-11-20 23:17:01,618 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:17:01,618 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:17:01,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:17:01,623 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:17:01,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-20 23:17:01,787 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-20 23:17:01,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:17:01,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 67 conjunts are in the unsatisfiable core [2021-11-20 23:17:01,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:17:02,174 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-20 23:17:02,175 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2021-11-20 23:17:02,286 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-20 23:17:02,372 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:17:02,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:17:09,201 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:17:09,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 60 treesize of output 51 [2021-11-20 23:17:09,244 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:17:09,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:09,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 3 [2021-11-20 23:17:10,456 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:17:10,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295614629] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:17:10,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [905397945] [2021-11-20 23:17:10,457 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:17:10,459 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:17:10,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 25 [2021-11-20 23:17:10,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528232794] [2021-11-20 23:17:10,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:17:10,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-20 23:17:10,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:17:10,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-20 23:17:10,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=595, Unknown=5, NotChecked=0, Total=702 [2021-11-20 23:17:10,462 INFO L87 Difference]: Start difference. First operand 985 states and 3277 transitions. Second operand has 27 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 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) [2021-11-20 23:17:13,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:17:13,827 INFO L93 Difference]: Finished difference Result 3890 states and 13276 transitions. [2021-11-20 23:17:13,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-11-20 23:17:13,828 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-20 23:17:13,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:17:13,850 INFO L225 Difference]: With dead ends: 3890 [2021-11-20 23:17:13,851 INFO L226 Difference]: Without dead ends: 3761 [2021-11-20 23:17:13,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 51 SyntacticMatches, 10 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1461 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=917, Invalid=3770, Unknown=5, NotChecked=0, Total=4692 [2021-11-20 23:17:13,854 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 1000 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1000 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-20 23:17:13,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1000 Valid, 168 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1003 Invalid, 0 Unknown, 11 Unchecked, 1.0s Time] [2021-11-20 23:17:13,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3761 states. [2021-11-20 23:17:13,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3761 to 1007. [2021-11-20 23:17:13,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 1006 states have (on average 3.3479125248508947) internal successors, (3368), 1006 states have internal predecessors, (3368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:13,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 3368 transitions. [2021-11-20 23:17:13,941 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 3368 transitions. Word has length 36 [2021-11-20 23:17:13,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:17:13,942 INFO L470 AbstractCegarLoop]: Abstraction has 1007 states and 3368 transitions. [2021-11-20 23:17:13,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 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) [2021-11-20 23:17:13,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 3368 transitions. [2021-11-20 23:17:13,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 23:17:13,948 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:17:13,948 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:17:13,993 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-20 23:17:14,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-20 23:17:14,163 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:17:14,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:17:14,164 INFO L85 PathProgramCache]: Analyzing trace with hash -198192426, now seen corresponding path program 3 times [2021-11-20 23:17:14,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:17:14,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754482009] [2021-11-20 23:17:14,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:17:14,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:17:14,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:17:14,553 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:17:14,554 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:17:14,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754482009] [2021-11-20 23:17:14,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754482009] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:17:14,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928456700] [2021-11-20 23:17:14,555 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:17:14,555 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:17:14,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:17:14,563 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:17:14,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-20 23:17:14,664 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:17:14,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:17:14,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 56 conjunts are in the unsatisfiable core [2021-11-20 23:17:14,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:17:14,980 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-20 23:17:14,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2021-11-20 23:17:15,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 10 [2021-11-20 23:17:15,156 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:17:15,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:17:16,528 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~#t4~0#1.offset| Int) (|ULTIMATE.start_main_#t~pre30#1| Int)) (<= (+ c_~s_2~0 c_~t_5~0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base|) |ULTIMATE.start_main_~#t4~0#1.offset| |ULTIMATE.start_main_#t~pre30#1|)) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((|ULTIMATE.start_main_~#t4~0#1.offset| Int) (|ULTIMATE.start_main_#t~pre30#1| Int)) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base|) |ULTIMATE.start_main_~#t4~0#1.offset| |ULTIMATE.start_main_#t~pre30#1|)) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_2~0 c_~t_5~0 1)))) is different from false [2021-11-20 23:17:16,615 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:17:16,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 56 treesize of output 47 [2021-11-20 23:17:16,661 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:17:16,668 INFO L354 Elim1Store]: treesize reduction 11, result has 26.7 percent of original size [2021-11-20 23:17:16,668 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 11 [2021-11-20 23:17:16,822 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:17:16,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928456700] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:17:16,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1335123440] [2021-11-20 23:17:16,822 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:17:16,824 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:17:16,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2021-11-20 23:17:16,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165659121] [2021-11-20 23:17:16,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:17:16,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-20 23:17:16,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:17:16,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-20 23:17:16,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=424, Unknown=1, NotChecked=42, Total=552 [2021-11-20 23:17:16,827 INFO L87 Difference]: Start difference. First operand 1007 states and 3368 transitions. Second operand has 24 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 23 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:18,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:17:18,045 INFO L93 Difference]: Finished difference Result 1332 states and 4540 transitions. [2021-11-20 23:17:18,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-20 23:17:18,046 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 23 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-20 23:17:18,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:17:18,052 INFO L225 Difference]: With dead ends: 1332 [2021-11-20 23:17:18,053 INFO L226 Difference]: Without dead ends: 1299 [2021-11-20 23:17:18,054 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=257, Invalid=936, Unknown=1, NotChecked=66, Total=1260 [2021-11-20 23:17:18,055 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 283 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-20 23:17:18,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 140 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 952 Invalid, 0 Unknown, 133 Unchecked, 0.8s Time] [2021-11-20 23:17:18,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2021-11-20 23:17:18,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 1007. [2021-11-20 23:17:18,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 1006 states have (on average 3.3479125248508947) internal successors, (3368), 1006 states have internal predecessors, (3368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:18,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 3368 transitions. [2021-11-20 23:17:18,103 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 3368 transitions. Word has length 36 [2021-11-20 23:17:18,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:17:18,104 INFO L470 AbstractCegarLoop]: Abstraction has 1007 states and 3368 transitions. [2021-11-20 23:17:18,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 23 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:18,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 3368 transitions. [2021-11-20 23:17:18,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 23:17:18,109 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:17:18,109 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:17:18,153 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-20 23:17:18,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-20 23:17:18,323 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:17:18,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:17:18,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1466398744, now seen corresponding path program 5 times [2021-11-20 23:17:18,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:17:18,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842128268] [2021-11-20 23:17:18,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:17:18,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:17:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:17:18,623 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:17:18,623 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:17:18,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842128268] [2021-11-20 23:17:18,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842128268] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:17:18,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426966791] [2021-11-20 23:17:18,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:17:18,624 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:17:18,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:17:18,628 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:17:18,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-20 23:17:18,738 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-20 23:17:18,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:17:18,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 51 conjunts are in the unsatisfiable core [2021-11-20 23:17:18,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:17:18,989 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 10 [2021-11-20 23:17:19,063 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:17:19,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:17:19,234 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:17:19,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 27 [2021-11-20 23:17:19,257 INFO L354 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2021-11-20 23:17:19,258 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2021-11-20 23:17:19,429 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:17:19,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426966791] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:17:19,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1265590546] [2021-11-20 23:17:19,430 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:17:19,431 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:17:19,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 14 [2021-11-20 23:17:19,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850651742] [2021-11-20 23:17:19,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:17:19,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-20 23:17:19,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:17:19,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-20 23:17:19,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2021-11-20 23:17:19,434 INFO L87 Difference]: Start difference. First operand 1007 states and 3368 transitions. Second operand has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:20,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:17:20,134 INFO L93 Difference]: Finished difference Result 1663 states and 5667 transitions. [2021-11-20 23:17:20,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-20 23:17:20,135 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-20 23:17:20,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:17:20,143 INFO L225 Difference]: With dead ends: 1663 [2021-11-20 23:17:20,143 INFO L226 Difference]: Without dead ends: 1581 [2021-11-20 23:17:20,144 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=511, Unknown=0, NotChecked=0, Total=650 [2021-11-20 23:17:20,147 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 247 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-20 23:17:20,147 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 130 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-20 23:17:20,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2021-11-20 23:17:20,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1139. [2021-11-20 23:17:20,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 1138 states have (on average 3.4578207381370825) internal successors, (3935), 1138 states have internal predecessors, (3935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:20,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 3935 transitions. [2021-11-20 23:17:20,219 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 3935 transitions. Word has length 36 [2021-11-20 23:17:20,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:17:20,219 INFO L470 AbstractCegarLoop]: Abstraction has 1139 states and 3935 transitions. [2021-11-20 23:17:20,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:20,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 3935 transitions. [2021-11-20 23:17:20,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 23:17:20,225 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:17:20,225 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:17:20,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-20 23:17:20,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:17:20,460 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:17:20,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:17:20,460 INFO L85 PathProgramCache]: Analyzing trace with hash -907892090, now seen corresponding path program 6 times [2021-11-20 23:17:20,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:17:20,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479040724] [2021-11-20 23:17:20,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:17:20,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:17:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:17:20,669 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:17:20,669 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:17:20,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479040724] [2021-11-20 23:17:20,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479040724] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:17:20,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958070921] [2021-11-20 23:17:20,670 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:17:20,670 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:17:20,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:17:20,672 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:17:20,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-20 23:17:20,806 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:17:20,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:17:20,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 51 conjunts are in the unsatisfiable core [2021-11-20 23:17:20,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:17:21,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-20 23:17:21,182 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:17:21,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:17:21,346 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:17:21,346 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 27 [2021-11-20 23:17:21,370 INFO L354 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2021-11-20 23:17:21,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2021-11-20 23:17:21,562 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:17:21,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958070921] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:17:21,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [369668627] [2021-11-20 23:17:21,563 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:17:21,563 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:17:21,564 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 13 [2021-11-20 23:17:21,564 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987254937] [2021-11-20 23:17:21,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:17:21,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-20 23:17:21,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:17:21,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-20 23:17:21,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2021-11-20 23:17:21,566 INFO L87 Difference]: Start difference. First operand 1139 states and 3935 transitions. Second operand has 14 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:22,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:17:22,135 INFO L93 Difference]: Finished difference Result 1396 states and 4854 transitions. [2021-11-20 23:17:22,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 23:17:22,136 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-20 23:17:22,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:17:22,143 INFO L225 Difference]: With dead ends: 1396 [2021-11-20 23:17:22,143 INFO L226 Difference]: Without dead ends: 1351 [2021-11-20 23:17:22,144 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2021-11-20 23:17:22,145 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 142 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 23:17:22,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 129 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-20 23:17:22,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2021-11-20 23:17:22,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1135. [2021-11-20 23:17:22,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 1134 states have (on average 3.4594356261022927) internal successors, (3923), 1134 states have internal predecessors, (3923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:22,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 3923 transitions. [2021-11-20 23:17:22,217 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 3923 transitions. Word has length 36 [2021-11-20 23:17:22,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:17:22,217 INFO L470 AbstractCegarLoop]: Abstraction has 1135 states and 3923 transitions. [2021-11-20 23:17:22,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:22,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 3923 transitions. [2021-11-20 23:17:22,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 23:17:22,222 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:17:22,223 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:17:22,270 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-20 23:17:22,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-20 23:17:22,444 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:17:22,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:17:22,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1032329512, now seen corresponding path program 7 times [2021-11-20 23:17:22,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:17:22,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728293888] [2021-11-20 23:17:22,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:17:22,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:17:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:17:22,767 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:17:22,768 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:17:22,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728293888] [2021-11-20 23:17:22,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728293888] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:17:22,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652548122] [2021-11-20 23:17:22,768 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:17:22,768 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:17:22,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:17:22,770 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:17:22,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-20 23:17:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:17:22,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 51 conjunts are in the unsatisfiable core [2021-11-20 23:17:22,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:17:23,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 10 [2021-11-20 23:17:23,217 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:17:23,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:17:23,369 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:17:23,370 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 27 [2021-11-20 23:17:23,391 INFO L354 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2021-11-20 23:17:23,392 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2021-11-20 23:17:23,584 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:17:23,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652548122] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:17:23,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [592712485] [2021-11-20 23:17:23,585 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:17:23,587 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:17:23,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 13 [2021-11-20 23:17:23,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378747321] [2021-11-20 23:17:23,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:17:23,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-20 23:17:23,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:17:23,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-20 23:17:23,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-11-20 23:17:23,589 INFO L87 Difference]: Start difference. First operand 1135 states and 3923 transitions. Second operand has 14 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:24,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:17:24,197 INFO L93 Difference]: Finished difference Result 1428 states and 4956 transitions. [2021-11-20 23:17:24,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 23:17:24,200 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-20 23:17:24,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:17:24,207 INFO L225 Difference]: With dead ends: 1428 [2021-11-20 23:17:24,207 INFO L226 Difference]: Without dead ends: 1383 [2021-11-20 23:17:24,207 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2021-11-20 23:17:24,208 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 132 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-20 23:17:24,209 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 167 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-20 23:17:24,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2021-11-20 23:17:24,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1163. [2021-11-20 23:17:24,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 1162 states have (on average 3.4604130808950084) internal successors, (4021), 1162 states have internal predecessors, (4021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:24,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 4021 transitions. [2021-11-20 23:17:24,259 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 4021 transitions. Word has length 36 [2021-11-20 23:17:24,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:17:24,259 INFO L470 AbstractCegarLoop]: Abstraction has 1163 states and 4021 transitions. [2021-11-20 23:17:24,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:24,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 4021 transitions. [2021-11-20 23:17:24,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 23:17:24,265 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:17:24,265 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:17:24,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-20 23:17:24,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-20 23:17:24,479 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:17:24,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:17:24,480 INFO L85 PathProgramCache]: Analyzing trace with hash -587082962, now seen corresponding path program 4 times [2021-11-20 23:17:24,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:17:24,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99587600] [2021-11-20 23:17:24,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:17:24,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:17:24,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:17:24,771 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:17:24,771 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:17:24,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99587600] [2021-11-20 23:17:24,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99587600] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:17:24,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146433647] [2021-11-20 23:17:24,771 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:17:24,772 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:17:24,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:17:24,773 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:17:24,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-20 23:17:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:17:24,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 51 conjunts are in the unsatisfiable core [2021-11-20 23:17:24,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:17:25,108 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 10 [2021-11-20 23:17:25,205 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:17:25,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:17:25,363 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:17:25,363 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 27 [2021-11-20 23:17:25,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:25,385 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:17:25,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2021-11-20 23:17:25,580 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:17:25,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146433647] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:17:25,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [480106655] [2021-11-20 23:17:25,581 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:17:25,582 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:17:25,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 13 [2021-11-20 23:17:25,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781190788] [2021-11-20 23:17:25,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:17:25,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-20 23:17:25,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:17:25,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-20 23:17:25,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-11-20 23:17:25,585 INFO L87 Difference]: Start difference. First operand 1163 states and 4021 transitions. Second operand has 14 states, 13 states have (on average 4.769230769230769) internal successors, (62), 14 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:25,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:17:25,992 INFO L93 Difference]: Finished difference Result 1376 states and 4778 transitions. [2021-11-20 23:17:25,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 23:17:25,993 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.769230769230769) internal successors, (62), 14 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-20 23:17:25,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:17:26,003 INFO L225 Difference]: With dead ends: 1376 [2021-11-20 23:17:26,004 INFO L226 Difference]: Without dead ends: 1333 [2021-11-20 23:17:26,004 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2021-11-20 23:17:26,005 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 144 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:17:26,006 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 92 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-20 23:17:26,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2021-11-20 23:17:26,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 1163. [2021-11-20 23:17:26,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 1162 states have (on average 3.4604130808950084) internal successors, (4021), 1162 states have internal predecessors, (4021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:26,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 4021 transitions. [2021-11-20 23:17:26,055 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 4021 transitions. Word has length 36 [2021-11-20 23:17:26,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:17:26,056 INFO L470 AbstractCegarLoop]: Abstraction has 1163 states and 4021 transitions. [2021-11-20 23:17:26,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.769230769230769) internal successors, (62), 14 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:26,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 4021 transitions. [2021-11-20 23:17:26,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 23:17:26,061 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:17:26,061 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:17:26,110 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-20 23:17:26,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:17:26,276 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:17:26,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:17:26,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1119336366, now seen corresponding path program 5 times [2021-11-20 23:17:26,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:17:26,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074029794] [2021-11-20 23:17:26,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:17:26,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:17:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:17:26,491 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:17:26,491 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:17:26,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074029794] [2021-11-20 23:17:26,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074029794] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:17:26,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68954801] [2021-11-20 23:17:26,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:17:26,491 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:17:26,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:17:26,494 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:17:26,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-20 23:17:26,623 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-20 23:17:26,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:17:26,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 71 conjunts are in the unsatisfiable core [2021-11-20 23:17:26,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:17:26,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:26,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:26,654 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:17:26,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 16 [2021-11-20 23:17:26,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-20 23:17:26,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 16 [2021-11-20 23:17:26,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:26,957 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-11-20 23:17:26,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 16 treesize of output 18 [2021-11-20 23:17:27,042 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 16 [2021-11-20 23:17:27,148 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 13 [2021-11-20 23:17:27,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 13 [2021-11-20 23:17:27,360 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-20 23:17:27,470 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:17:27,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:17:45,933 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:17:45,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68954801] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:17:45,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1773646966] [2021-11-20 23:17:45,934 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:17:45,934 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:17:45,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 9] total 23 [2021-11-20 23:17:45,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643803248] [2021-11-20 23:17:45,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:17:45,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-20 23:17:45,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:17:45,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-20 23:17:45,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=450, Unknown=8, NotChecked=0, Total=552 [2021-11-20 23:17:45,937 INFO L87 Difference]: Start difference. First operand 1163 states and 4021 transitions. Second operand has 24 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 24 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:47,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:17:47,208 INFO L93 Difference]: Finished difference Result 1424 states and 4958 transitions. [2021-11-20 23:17:47,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-20 23:17:47,209 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 24 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-20 23:17:47,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:17:47,215 INFO L225 Difference]: With dead ends: 1424 [2021-11-20 23:17:47,216 INFO L226 Difference]: Without dead ends: 1381 [2021-11-20 23:17:47,216 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=239, Invalid=1085, Unknown=8, NotChecked=0, Total=1332 [2021-11-20 23:17:47,217 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 298 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 179 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-20 23:17:47,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 121 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 690 Invalid, 0 Unknown, 179 Unchecked, 0.6s Time] [2021-11-20 23:17:47,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2021-11-20 23:17:47,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1177. [2021-11-20 23:17:47,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 1176 states have (on average 3.4659863945578233) internal successors, (4076), 1176 states have internal predecessors, (4076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:47,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 4076 transitions. [2021-11-20 23:17:47,267 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 4076 transitions. Word has length 36 [2021-11-20 23:17:47,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:17:47,268 INFO L470 AbstractCegarLoop]: Abstraction has 1177 states and 4076 transitions. [2021-11-20 23:17:47,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 24 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:47,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 4076 transitions. [2021-11-20 23:17:47,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 23:17:47,273 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:17:47,273 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:17:47,321 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-20 23:17:47,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:17:47,486 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:17:47,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:17:47,486 INFO L85 PathProgramCache]: Analyzing trace with hash 303721940, now seen corresponding path program 6 times [2021-11-20 23:17:47,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:17:47,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477849672] [2021-11-20 23:17:47,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:17:47,487 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:17:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:17:47,795 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:17:47,796 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:17:47,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477849672] [2021-11-20 23:17:47,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477849672] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:17:47,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406178728] [2021-11-20 23:17:47,796 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:17:47,796 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:17:47,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:17:47,799 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:17:47,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-20 23:17:47,926 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:17:47,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:17:47,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 51 conjunts are in the unsatisfiable core [2021-11-20 23:17:47,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:17:48,257 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 10 [2021-11-20 23:17:48,321 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:17:48,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:17:48,457 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:17:48,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 27 [2021-11-20 23:17:48,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:48,507 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:17:48,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2021-11-20 23:17:48,662 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:17:48,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406178728] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:17:48,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [238430233] [2021-11-20 23:17:48,663 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:17:48,663 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:17:48,663 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 14 [2021-11-20 23:17:48,663 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056998584] [2021-11-20 23:17:48,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:17:48,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-20 23:17:48,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:17:48,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-20 23:17:48,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2021-11-20 23:17:48,665 INFO L87 Difference]: Start difference. First operand 1177 states and 4076 transitions. Second operand has 15 states, 14 states have (on average 4.642857142857143) internal successors, (65), 15 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:49,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:17:49,374 INFO L93 Difference]: Finished difference Result 1633 states and 5671 transitions. [2021-11-20 23:17:49,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-20 23:17:49,375 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.642857142857143) internal successors, (65), 15 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-20 23:17:49,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:17:49,379 INFO L225 Difference]: With dead ends: 1633 [2021-11-20 23:17:49,379 INFO L226 Difference]: Without dead ends: 1567 [2021-11-20 23:17:49,379 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=511, Unknown=0, NotChecked=0, Total=650 [2021-11-20 23:17:49,380 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 223 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-20 23:17:49,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 107 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-20 23:17:49,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2021-11-20 23:17:49,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1189. [2021-11-20 23:17:49,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1189 states, 1188 states have (on average 3.5033670033670035) internal successors, (4162), 1188 states have internal predecessors, (4162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:49,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1189 states to 1189 states and 4162 transitions. [2021-11-20 23:17:49,433 INFO L78 Accepts]: Start accepts. Automaton has 1189 states and 4162 transitions. Word has length 36 [2021-11-20 23:17:49,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:17:49,434 INFO L470 AbstractCegarLoop]: Abstraction has 1189 states and 4162 transitions. [2021-11-20 23:17:49,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.642857142857143) internal successors, (65), 15 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:49,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 4162 transitions. [2021-11-20 23:17:49,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 23:17:49,439 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:17:49,439 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:17:49,472 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-20 23:17:49,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:17:49,656 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:17:49,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:17:49,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1242914242, now seen corresponding path program 8 times [2021-11-20 23:17:49,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:17:49,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43554037] [2021-11-20 23:17:49,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:17:49,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:17:49,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:17:50,055 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:17:50,055 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:17:50,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43554037] [2021-11-20 23:17:50,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43554037] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:17:50,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664759919] [2021-11-20 23:17:50,056 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:17:50,056 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:17:50,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:17:50,057 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:17:50,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-20 23:17:50,183 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-20 23:17:50,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:17:50,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 56 conjunts are in the unsatisfiable core [2021-11-20 23:17:50,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:17:50,538 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-20 23:17:50,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2021-11-20 23:17:50,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 10 [2021-11-20 23:17:50,679 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:17:50,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:18:04,272 WARN L227 SmtUtils]: Spent 5.46s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 23:18:04,285 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:18:04,285 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 62 [2021-11-20 23:18:04,374 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:18:04,384 INFO L354 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2021-11-20 23:18:04,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2021-11-20 23:18:04,635 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:18:04,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664759919] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:18:04,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [638026096] [2021-11-20 23:18:04,636 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:18:04,636 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:18:04,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2021-11-20 23:18:04,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083835547] [2021-11-20 23:18:04,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:18:04,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-20 23:18:04,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:18:04,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-20 23:18:04,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=386, Unknown=4, NotChecked=0, Total=462 [2021-11-20 23:18:04,639 INFO L87 Difference]: Start difference. First operand 1189 states and 4162 transitions. Second operand has 22 states, 21 states have (on average 3.619047619047619) internal successors, (76), 21 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) [2021-11-20 23:18:16,957 WARN L838 $PredicateComparison]: unable to prove that (and (= c_~X_0~0.offset 0) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (forall ((|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| (store (select |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|)) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4))) (+ c_~s_2~0 1))) (forall ((|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (<= c_~s_2~0 (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| (store (select |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|)) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4))))) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) is different from false [2021-11-20 23:18:19,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:18:19,053 INFO L93 Difference]: Finished difference Result 2419 states and 8475 transitions. [2021-11-20 23:18:19,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-20 23:18:19,054 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.619047619047619) internal successors, (76), 21 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) Word has length 36 [2021-11-20 23:18:19,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:18:19,059 INFO L225 Difference]: With dead ends: 2419 [2021-11-20 23:18:19,059 INFO L226 Difference]: Without dead ends: 2319 [2021-11-20 23:18:19,060 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 27.3s TimeCoverageRelationStatistics Valid=209, Invalid=906, Unknown=11, NotChecked=64, Total=1190 [2021-11-20 23:18:19,061 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 327 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 289 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-20 23:18:19,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [327 Valid, 217 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1098 Invalid, 0 Unknown, 289 Unchecked, 0.9s Time] [2021-11-20 23:18:19,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2319 states. [2021-11-20 23:18:19,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2319 to 1258. [2021-11-20 23:18:19,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1257 states have (on average 3.580747812251392) internal successors, (4501), 1257 states have internal predecessors, (4501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:19,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 4501 transitions. [2021-11-20 23:18:19,121 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 4501 transitions. Word has length 36 [2021-11-20 23:18:19,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:18:19,122 INFO L470 AbstractCegarLoop]: Abstraction has 1258 states and 4501 transitions. [2021-11-20 23:18:19,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.619047619047619) internal successors, (76), 21 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) [2021-11-20 23:18:19,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 4501 transitions. [2021-11-20 23:18:19,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 23:18:19,127 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:18:19,127 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:18:19,176 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-11-20 23:18:19,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:18:19,355 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:18:19,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:18:19,356 INFO L85 PathProgramCache]: Analyzing trace with hash -938226144, now seen corresponding path program 9 times [2021-11-20 23:18:19,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:18:19,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216778497] [2021-11-20 23:18:19,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:18:19,357 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:18:19,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:18:19,676 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:18:19,677 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:18:19,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216778497] [2021-11-20 23:18:19,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216778497] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:18:19,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720744077] [2021-11-20 23:18:19,677 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:18:19,677 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:18:19,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:18:19,678 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:18:19,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-20 23:18:19,779 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:18:19,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:18:19,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 58 conjunts are in the unsatisfiable core [2021-11-20 23:18:19,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:18:19,815 INFO L354 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-11-20 23:18:19,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 16 [2021-11-20 23:18:19,893 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:18:19,893 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 15 [2021-11-20 23:18:20,137 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-20 23:18:20,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2021-11-20 23:18:20,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-20 23:18:20,299 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:18:20,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:18:21,935 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (< (+ c_~s_2~0 c_~t_4~0) (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| (store (select |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|)) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4)) 1))) (forall ((|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (<= (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| (store (select |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|)) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4))) (+ c_~s_2~0 c_~t_4~0)))) is different from false [2021-11-20 23:18:21,948 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:18:21,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 69 treesize of output 60 [2021-11-20 23:18:22,007 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:18:22,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:22,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 5 [2021-11-20 23:18:22,264 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:18:22,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720744077] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:18:22,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [702110114] [2021-11-20 23:18:22,264 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:18:22,264 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:18:22,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 18 [2021-11-20 23:18:22,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192154679] [2021-11-20 23:18:22,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:18:22,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-20 23:18:22,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:18:22,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-20 23:18:22,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=290, Unknown=1, NotChecked=34, Total=380 [2021-11-20 23:18:22,266 INFO L87 Difference]: Start difference. First operand 1258 states and 4501 transitions. Second operand has 20 states, 19 states have (on average 3.526315789473684) internal successors, (67), 19 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:24,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:18:24,124 INFO L93 Difference]: Finished difference Result 1561 states and 5568 transitions. [2021-11-20 23:18:24,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 23:18:24,124 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.526315789473684) internal successors, (67), 19 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-20 23:18:24,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:18:24,128 INFO L225 Difference]: With dead ends: 1561 [2021-11-20 23:18:24,128 INFO L226 Difference]: Without dead ends: 1522 [2021-11-20 23:18:24,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=127, Invalid=632, Unknown=1, NotChecked=52, Total=812 [2021-11-20 23:18:24,129 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 205 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 267 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 23:18:24,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 126 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 426 Invalid, 0 Unknown, 267 Unchecked, 0.4s Time] [2021-11-20 23:18:24,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2021-11-20 23:18:24,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1254. [2021-11-20 23:18:24,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1253 states have (on average 3.582601755786113) internal successors, (4489), 1253 states have internal predecessors, (4489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:24,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 4489 transitions. [2021-11-20 23:18:24,200 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 4489 transitions. Word has length 36 [2021-11-20 23:18:24,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:18:24,201 INFO L470 AbstractCegarLoop]: Abstraction has 1254 states and 4489 transitions. [2021-11-20 23:18:24,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.526315789473684) internal successors, (67), 19 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:24,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 4489 transitions. [2021-11-20 23:18:24,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 23:18:24,206 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:18:24,206 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:18:24,246 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-11-20 23:18:24,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-11-20 23:18:24,431 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:18:24,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:18:24,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1733815734, now seen corresponding path program 10 times [2021-11-20 23:18:24,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:18:24,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351207794] [2021-11-20 23:18:24,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:18:24,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:18:24,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:18:24,756 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:18:24,756 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:18:24,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351207794] [2021-11-20 23:18:24,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351207794] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:18:24,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115611967] [2021-11-20 23:18:24,757 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:18:24,757 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:18:24,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:18:24,759 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:18:24,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-20 23:18:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:18:24,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 56 conjunts are in the unsatisfiable core [2021-11-20 23:18:24,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:18:25,266 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-20 23:18:25,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2021-11-20 23:18:25,327 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-20 23:18:25,430 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:18:25,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:18:37,354 WARN L227 SmtUtils]: Spent 5.73s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 23:18:37,378 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:18:37,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 62 [2021-11-20 23:18:37,441 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:18:37,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:37,444 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 3 [2021-11-20 23:18:37,676 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:18:37,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115611967] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:18:37,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [936325931] [2021-11-20 23:18:37,677 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:18:37,677 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:18:37,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2021-11-20 23:18:37,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201990809] [2021-11-20 23:18:37,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:18:37,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-20 23:18:37,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:18:37,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-20 23:18:37,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=341, Unknown=3, NotChecked=0, Total=420 [2021-11-20 23:18:37,679 INFO L87 Difference]: Start difference. First operand 1254 states and 4489 transitions. Second operand has 21 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:38,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:18:38,350 INFO L93 Difference]: Finished difference Result 1573 states and 5606 transitions. [2021-11-20 23:18:38,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 23:18:38,351 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-20 23:18:38,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:18:38,355 INFO L225 Difference]: With dead ends: 1573 [2021-11-20 23:18:38,355 INFO L226 Difference]: Without dead ends: 1534 [2021-11-20 23:18:38,356 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=142, Invalid=557, Unknown=3, NotChecked=0, Total=702 [2021-11-20 23:18:38,356 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 198 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-20 23:18:38,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 115 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 514 Invalid, 0 Unknown, 79 Unchecked, 0.5s Time] [2021-11-20 23:18:38,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2021-11-20 23:18:38,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 1266. [2021-11-20 23:18:38,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1265 states have (on average 3.5849802371541504) internal successors, (4535), 1265 states have internal predecessors, (4535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:38,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 4535 transitions. [2021-11-20 23:18:38,410 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 4535 transitions. Word has length 36 [2021-11-20 23:18:38,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:18:38,411 INFO L470 AbstractCegarLoop]: Abstraction has 1266 states and 4535 transitions. [2021-11-20 23:18:38,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:38,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 4535 transitions. [2021-11-20 23:18:38,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 23:18:38,416 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:18:38,416 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:18:38,460 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-11-20 23:18:38,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-11-20 23:18:38,631 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:18:38,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:18:38,632 INFO L85 PathProgramCache]: Analyzing trace with hash 93078744, now seen corresponding path program 7 times [2021-11-20 23:18:38,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:18:38,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915768833] [2021-11-20 23:18:38,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:18:38,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:18:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:18:38,957 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:18:38,957 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:18:38,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915768833] [2021-11-20 23:18:38,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915768833] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:18:38,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996312269] [2021-11-20 23:18:38,957 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:18:38,958 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:18:38,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:18:38,959 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:18:38,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-20 23:18:39,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:18:39,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 56 conjunts are in the unsatisfiable core [2021-11-20 23:18:39,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:18:39,442 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-20 23:18:39,442 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2021-11-20 23:18:39,488 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 10 [2021-11-20 23:18:39,581 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:18:39,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:18:49,938 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:18:49,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 62 [2021-11-20 23:18:49,983 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:18:49,992 INFO L354 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2021-11-20 23:18:49,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2021-11-20 23:18:50,282 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:18:50,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996312269] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:18:50,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [286021176] [2021-11-20 23:18:50,283 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:18:50,284 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:18:50,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2021-11-20 23:18:50,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581940757] [2021-11-20 23:18:50,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:18:50,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-20 23:18:50,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:18:50,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-20 23:18:50,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=339, Unknown=5, NotChecked=0, Total=420 [2021-11-20 23:18:50,286 INFO L87 Difference]: Start difference. First operand 1266 states and 4535 transitions. Second operand has 21 states, 20 states have (on average 3.65) internal successors, (73), 20 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:50,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:18:50,938 INFO L93 Difference]: Finished difference Result 1523 states and 5437 transitions. [2021-11-20 23:18:50,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 23:18:50,939 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.65) internal successors, (73), 20 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-20 23:18:50,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:18:50,943 INFO L225 Difference]: With dead ends: 1523 [2021-11-20 23:18:50,943 INFO L226 Difference]: Without dead ends: 1480 [2021-11-20 23:18:50,944 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=142, Invalid=555, Unknown=5, NotChecked=0, Total=702 [2021-11-20 23:18:50,945 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 231 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 23:18:50,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [231 Valid, 84 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-20 23:18:50,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2021-11-20 23:18:50,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1254. [2021-11-20 23:18:50,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1253 states have (on average 3.582601755786113) internal successors, (4489), 1253 states have internal predecessors, (4489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:51,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 4489 transitions. [2021-11-20 23:18:51,016 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 4489 transitions. Word has length 36 [2021-11-20 23:18:51,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:18:51,017 INFO L470 AbstractCegarLoop]: Abstraction has 1254 states and 4489 transitions. [2021-11-20 23:18:51,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.65) internal successors, (73), 20 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:51,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 4489 transitions. [2021-11-20 23:18:51,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 23:18:51,021 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:18:51,022 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:18:51,066 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-11-20 23:18:51,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-11-20 23:18:51,222 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:18:51,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:18:51,223 INFO L85 PathProgramCache]: Analyzing trace with hash 2128680666, now seen corresponding path program 11 times [2021-11-20 23:18:51,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:18:51,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432621082] [2021-11-20 23:18:51,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:18:51,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:18:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:18:51,751 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:18:51,751 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:18:51,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432621082] [2021-11-20 23:18:51,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432621082] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:18:51,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434795045] [2021-11-20 23:18:51,758 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:18:51,758 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:18:51,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:18:51,759 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:18:51,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-11-20 23:18:51,865 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-20 23:18:51,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:18:51,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 59 conjunts are in the unsatisfiable core [2021-11-20 23:18:51,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:18:51,895 INFO L354 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-11-20 23:18:51,895 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 16 [2021-11-20 23:18:51,980 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:18:51,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-11-20 23:18:52,158 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-20 23:18:52,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2021-11-20 23:18:52,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 10 [2021-11-20 23:18:52,399 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:18:52,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:18:54,138 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|thread1Thread1of1ForFork3_~#t2~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre9| Int)) (<= c_~s_6~0 (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| (store (select |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base|) |thread1Thread1of1ForFork3_~#t2~0.offset| |thread1Thread1of1ForFork3_#t~pre9|)) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))))) (forall ((|thread1Thread1of1ForFork3_~#t2~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre9| Int)) (< (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| (store (select |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base|) |thread1Thread1of1ForFork3_~#t2~0.offset| |thread1Thread1of1ForFork3_#t~pre9|)) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (+ c_~s_6~0 1)))) is different from false [2021-11-20 23:18:54,171 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:18:54,172 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 62 [2021-11-20 23:18:54,218 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:18:54,225 INFO L354 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2021-11-20 23:18:54,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2021-11-20 23:18:54,400 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:18:54,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434795045] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:18:54,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1777630475] [2021-11-20 23:18:54,401 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:18:54,401 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:18:54,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2021-11-20 23:18:54,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421219433] [2021-11-20 23:18:54,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:18:54,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-20 23:18:54,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:18:54,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-20 23:18:54,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=355, Unknown=1, NotChecked=38, Total=462 [2021-11-20 23:18:54,404 INFO L87 Difference]: Start difference. First operand 1254 states and 4489 transitions. Second operand has 22 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 21 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:55,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:18:55,846 INFO L93 Difference]: Finished difference Result 1625 states and 5784 transitions. [2021-11-20 23:18:55,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 23:18:55,847 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 21 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-20 23:18:55,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:18:55,851 INFO L225 Difference]: With dead ends: 1625 [2021-11-20 23:18:55,851 INFO L226 Difference]: Without dead ends: 1580 [2021-11-20 23:18:55,852 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=158, Invalid=601, Unknown=1, NotChecked=52, Total=812 [2021-11-20 23:18:55,852 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 240 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-20 23:18:55,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [240 Valid, 140 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 630 Invalid, 0 Unknown, 88 Unchecked, 0.5s Time] [2021-11-20 23:18:55,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2021-11-20 23:18:55,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1278. [2021-11-20 23:18:55,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1278 states, 1277 states have (on average 3.571652310101801) internal successors, (4561), 1277 states have internal predecessors, (4561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:55,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 4561 transitions. [2021-11-20 23:18:55,889 INFO L78 Accepts]: Start accepts. Automaton has 1278 states and 4561 transitions. Word has length 36 [2021-11-20 23:18:55,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:18:55,889 INFO L470 AbstractCegarLoop]: Abstraction has 1278 states and 4561 transitions. [2021-11-20 23:18:55,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 21 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:55,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 4561 transitions. [2021-11-20 23:18:55,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 23:18:55,895 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:18:55,895 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:18:55,933 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-11-20 23:18:56,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-11-20 23:18:56,119 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:18:56,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:18:56,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1409636218, now seen corresponding path program 12 times [2021-11-20 23:18:56,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:18:56,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650325773] [2021-11-20 23:18:56,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:18:56,121 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:18:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:18:56,651 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:18:56,651 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:18:56,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650325773] [2021-11-20 23:18:56,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650325773] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:18:56,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753167975] [2021-11-20 23:18:56,652 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:18:56,652 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:18:56,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:18:56,653 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:18:56,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-11-20 23:18:56,797 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:18:56,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:18:56,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 61 conjunts are in the unsatisfiable core [2021-11-20 23:18:56,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:18:56,834 INFO L354 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-11-20 23:18:56,835 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 16 [2021-11-20 23:18:56,930 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:18:56,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 15 [2021-11-20 23:18:57,290 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-20 23:18:57,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 30 treesize of output 29 [2021-11-20 23:18:57,440 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-20 23:18:57,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2021-11-20 23:18:57,481 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 10 [2021-11-20 23:18:57,574 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:18:57,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:19:10,280 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:19:10,281 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 350 treesize of output 278 [2021-11-20 23:19:10,530 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:19:10,531 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:19:10,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:19:10,535 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 3 [2021-11-20 23:19:11,018 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:11,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753167975] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:19:11,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [287845596] [2021-11-20 23:19:11,019 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:19:11,021 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:19:11,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2021-11-20 23:19:11,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044003830] [2021-11-20 23:19:11,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:19:11,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-20 23:19:11,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:19:11,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-20 23:19:11,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=412, Unknown=4, NotChecked=0, Total=506 [2021-11-20 23:19:11,023 INFO L87 Difference]: Start difference. First operand 1278 states and 4561 transitions. Second operand has 23 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:19:11,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:19:11,751 INFO L93 Difference]: Finished difference Result 1589 states and 5658 transitions. [2021-11-20 23:19:11,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 23:19:11,751 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-20 23:19:11,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:19:11,755 INFO L225 Difference]: With dead ends: 1589 [2021-11-20 23:19:11,755 INFO L226 Difference]: Without dead ends: 1550 [2021-11-20 23:19:11,755 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 55 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=143, Invalid=665, Unknown=4, NotChecked=0, Total=812 [2021-11-20 23:19:11,756 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 163 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-20 23:19:11,757 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 137 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 655 Invalid, 0 Unknown, 81 Unchecked, 0.5s Time] [2021-11-20 23:19:11,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2021-11-20 23:19:11,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 1290. [2021-11-20 23:19:11,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1290 states, 1289 states have (on average 3.5740884406516678) internal successors, (4607), 1289 states have internal predecessors, (4607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:19:11,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 4607 transitions. [2021-11-20 23:19:11,794 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 4607 transitions. Word has length 36 [2021-11-20 23:19:11,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:19:11,795 INFO L470 AbstractCegarLoop]: Abstraction has 1290 states and 4607 transitions. [2021-11-20 23:19:11,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:19:11,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 4607 transitions. [2021-11-20 23:19:11,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 23:19:11,800 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:19:11,800 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:19:11,851 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-11-20 23:19:12,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:19:12,015 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:19:12,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:19:12,015 INFO L85 PathProgramCache]: Analyzing trace with hash 417258260, now seen corresponding path program 8 times [2021-11-20 23:19:12,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:19:12,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554221292] [2021-11-20 23:19:12,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:19:12,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:19:12,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:19:12,529 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:12,529 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:19:12,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554221292] [2021-11-20 23:19:12,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554221292] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:19:12,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424005085] [2021-11-20 23:19:12,530 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:19:12,530 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:19:12,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:19:12,535 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:19:12,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-11-20 23:19:12,669 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-20 23:19:12,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:19:12,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 60 conjunts are in the unsatisfiable core [2021-11-20 23:19:12,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:19:13,074 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-20 23:19:13,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2021-11-20 23:19:13,228 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-20 23:19:13,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2021-11-20 23:19:13,278 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 10 [2021-11-20 23:19:13,402 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:13,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:19:15,149 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (< (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| (store (select |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|)) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (+ c_~s_6~0 1))) (forall ((|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (<= c_~s_6~0 (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| (store (select |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|)) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)))))) is different from false [2021-11-20 23:19:23,032 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:19:23,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 350 treesize of output 278 [2021-11-20 23:19:23,281 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:19:23,281 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:19:23,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:19:23,285 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 3 [2021-11-20 23:19:23,505 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-20 23:19:23,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424005085] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:19:23,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [913617794] [2021-11-20 23:19:23,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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:19:23,506 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:19:23,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2021-11-20 23:19:23,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123024583] [2021-11-20 23:19:23,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:19:23,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-20 23:19:23,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:19:23,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-20 23:19:23,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=4, NotChecked=44, Total=600 [2021-11-20 23:19:23,508 INFO L87 Difference]: Start difference. First operand 1290 states and 4607 transitions. Second operand has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:19:24,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:19:24,201 INFO L93 Difference]: Finished difference Result 1539 states and 5489 transitions. [2021-11-20 23:19:24,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 23:19:24,202 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-20 23:19:24,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:19:24,207 INFO L225 Difference]: With dead ends: 1539 [2021-11-20 23:19:24,207 INFO L226 Difference]: Without dead ends: 1496 [2021-11-20 23:19:24,208 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=206, Invalid=850, Unknown=4, NotChecked=62, Total=1122 [2021-11-20 23:19:24,209 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 271 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 23:19:24,209 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 88 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 483 Invalid, 0 Unknown, 98 Unchecked, 0.4s Time] [2021-11-20 23:19:24,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2021-11-20 23:19:24,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1262. [2021-11-20 23:19:24,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1262 states, 1261 states have (on average 3.57573354480571) internal successors, (4509), 1261 states have internal predecessors, (4509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:19:24,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 4509 transitions. [2021-11-20 23:19:24,239 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 4509 transitions. Word has length 36 [2021-11-20 23:19:24,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:19:24,239 INFO L470 AbstractCegarLoop]: Abstraction has 1262 states and 4509 transitions. [2021-11-20 23:19:24,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:19:24,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 4509 transitions. [2021-11-20 23:19:24,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 23:19:24,244 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:19:24,244 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:19:24,271 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2021-11-20 23:19:24,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-11-20 23:19:24,448 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:19:24,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:19:24,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1273686664, now seen corresponding path program 13 times [2021-11-20 23:19:24,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:19:24,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542534440] [2021-11-20 23:19:24,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:19:24,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:19:24,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:19:24,718 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:24,718 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:19:24,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542534440] [2021-11-20 23:19:24,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542534440] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:19:24,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072947068] [2021-11-20 23:19:24,719 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:19:24,719 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:19:24,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:19:24,720 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:19:24,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-11-20 23:19:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:19:24,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 51 conjunts are in the unsatisfiable core [2021-11-20 23:19:24,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:19:24,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-20 23:19:25,081 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:25,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:19:25,238 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:19:25,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 27 [2021-11-20 23:19:25,256 INFO L354 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2021-11-20 23:19:25,257 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2021-11-20 23:19:25,339 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:25,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072947068] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:19:25,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [422375235] [2021-11-20 23:19:25,339 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:19:25,339 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:19:25,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 14 [2021-11-20 23:19:25,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521518481] [2021-11-20 23:19:25,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:19:25,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-20 23:19:25,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:19:25,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-20 23:19:25,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-11-20 23:19:25,342 INFO L87 Difference]: Start difference. First operand 1262 states and 4509 transitions. Second operand has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 15 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) [2021-11-20 23:19:26,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:19:26,250 INFO L93 Difference]: Finished difference Result 1942 states and 6877 transitions. [2021-11-20 23:19:26,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-20 23:19:26,250 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 15 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-20 23:19:26,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:19:26,255 INFO L225 Difference]: With dead ends: 1942 [2021-11-20 23:19:26,255 INFO L226 Difference]: Without dead ends: 1860 [2021-11-20 23:19:26,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2021-11-20 23:19:26,256 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 206 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-20 23:19:26,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [206 Valid, 180 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-20 23:19:26,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2021-11-20 23:19:26,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1299. [2021-11-20 23:19:26,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1299 states, 1298 states have (on average 3.589368258859784) internal successors, (4659), 1298 states have internal predecessors, (4659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:19:26,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 4659 transitions. [2021-11-20 23:19:26,313 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 4659 transitions. Word has length 36 [2021-11-20 23:19:26,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:19:26,314 INFO L470 AbstractCegarLoop]: Abstraction has 1299 states and 4659 transitions. [2021-11-20 23:19:26,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 15 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) [2021-11-20 23:19:26,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 4659 transitions. [2021-11-20 23:19:26,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 23:19:26,319 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:19:26,319 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:19:26,368 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2021-11-20 23:19:26,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-11-20 23:19:26,535 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:19:26,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:19:26,535 INFO L85 PathProgramCache]: Analyzing trace with hash 658338782, now seen corresponding path program 14 times [2021-11-20 23:19:26,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:19:26,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819377634] [2021-11-20 23:19:26,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:19:26,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:19:26,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:19:27,143 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:19:27,144 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:19:27,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819377634] [2021-11-20 23:19:27,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819377634] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:19:27,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885544621] [2021-11-20 23:19:27,144 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:19:27,145 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:19:27,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:19:27,146 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:19:27,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-11-20 23:19:27,288 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-20 23:19:27,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:19:27,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 56 conjunts are in the unsatisfiable core [2021-11-20 23:19:27,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:19:27,701 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-20 23:19:27,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2021-11-20 23:19:27,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-20 23:19:27,859 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:27,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:19:39,412 WARN L227 SmtUtils]: Spent 5.81s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 23:19:44,693 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:19:44,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 62 [2021-11-20 23:19:44,751 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:19:44,758 INFO L354 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2021-11-20 23:19:44,758 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2021-11-20 23:19:44,952 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:44,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885544621] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:19:44,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1763092044] [2021-11-20 23:19:44,952 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:19:44,952 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:19:44,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 25 [2021-11-20 23:19:44,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656129089] [2021-11-20 23:19:44,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:19:44,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-20 23:19:44,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:19:44,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-20 23:19:44,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=600, Unknown=4, NotChecked=0, Total=702 [2021-11-20 23:19:44,955 INFO L87 Difference]: Start difference. First operand 1299 states and 4659 transitions. Second operand has 27 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 26 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:19:47,226 WARN L838 $PredicateComparison]: unable to prove that (and (<= c_~s_2~0 c_~s_6~0) (< c_~s_6~0 (+ c_~s_2~0 1)) (= c_~X_0~0.offset 0) (forall ((|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (<= (+ c_~s_2~0 c_~t_4~0) (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| (store (select |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|)) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4))))) (forall ((|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| (store (select |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|)) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4))) (+ c_~s_2~0 c_~t_4~0 1))) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t4~0#1.base|)) (not (= c_~X_0~0.base |c_ULTIMATE.start_main_~#t4~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (not (= |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t1~0#1.base|)) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (= (select |c_#valid| c_~X_0~0.base) 1) (= |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) is different from false [2021-11-20 23:19:48,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:19:48,421 INFO L93 Difference]: Finished difference Result 2816 states and 10012 transitions. [2021-11-20 23:19:48,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-20 23:19:48,421 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 26 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-20 23:19:48,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:19:48,428 INFO L225 Difference]: With dead ends: 2816 [2021-11-20 23:19:48,428 INFO L226 Difference]: Without dead ends: 2746 [2021-11-20 23:19:48,430 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=434, Invalid=1727, Unknown=5, NotChecked=90, Total=2256 [2021-11-20 23:19:48,430 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 429 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 1503 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 2124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 575 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:19:48,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [429 Valid, 326 Invalid, 2124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1503 Invalid, 0 Unknown, 575 Unchecked, 1.2s Time] [2021-11-20 23:19:48,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2021-11-20 23:19:48,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 1323. [2021-11-20 23:19:48,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1323 states, 1322 states have (on average 3.636157337367625) internal successors, (4807), 1322 states have internal predecessors, (4807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:19:48,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 4807 transitions. [2021-11-20 23:19:48,479 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 4807 transitions. Word has length 36 [2021-11-20 23:19:48,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:19:48,479 INFO L470 AbstractCegarLoop]: Abstraction has 1323 states and 4807 transitions. [2021-11-20 23:19:48,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 26 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:19:48,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 4807 transitions. [2021-11-20 23:19:48,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 23:19:48,485 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:19:48,485 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:19:48,530 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2021-11-20 23:19:48,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:19:48,711 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:19:48,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:19:48,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1876314518, now seen corresponding path program 15 times [2021-11-20 23:19:48,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:19:48,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100235560] [2021-11-20 23:19:48,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:19:48,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:19:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:19:48,917 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:48,918 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:19:48,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100235560] [2021-11-20 23:19:48,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100235560] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:19:48,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712954014] [2021-11-20 23:19:48,919 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:19:48,919 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:19:48,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:19:48,933 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:19:48,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-11-20 23:19:49,079 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:19:49,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:19:49,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 51 conjunts are in the unsatisfiable core [2021-11-20 23:19:49,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:19:49,246 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-20 23:19:49,402 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:49,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:19:49,612 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:19:49,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 27 [2021-11-20 23:19:49,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:19:49,635 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:19:49,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2021-11-20 23:19:49,741 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:49,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712954014] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:19:49,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1473095591] [2021-11-20 23:19:49,741 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:19:49,742 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:19:49,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 13 [2021-11-20 23:19:49,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473870946] [2021-11-20 23:19:49,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:19:49,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-20 23:19:49,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:19:49,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-20 23:19:49,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-11-20 23:19:49,744 INFO L87 Difference]: Start difference. First operand 1323 states and 4807 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:19:50,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:19:50,440 INFO L93 Difference]: Finished difference Result 1616 states and 5827 transitions. [2021-11-20 23:19:50,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-20 23:19:50,441 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-20 23:19:50,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:19:50,445 INFO L225 Difference]: With dead ends: 1616 [2021-11-20 23:19:50,445 INFO L226 Difference]: Without dead ends: 1571 [2021-11-20 23:19:50,446 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2021-11-20 23:19:50,447 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 129 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-20 23:19:50,447 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 155 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-20 23:19:50,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2021-11-20 23:19:50,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 1317. [2021-11-20 23:19:50,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1317 states, 1316 states have (on average 3.6322188449848025) internal successors, (4780), 1316 states have internal predecessors, (4780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:19:50,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 4780 transitions. [2021-11-20 23:19:50,479 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 4780 transitions. Word has length 36 [2021-11-20 23:19:50,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:19:50,480 INFO L470 AbstractCegarLoop]: Abstraction has 1317 states and 4780 transitions. [2021-11-20 23:19:50,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:19:50,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 4780 transitions. [2021-11-20 23:19:50,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 23:19:50,483 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:19:50,483 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:19:50,515 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2021-11-20 23:19:50,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:19:50,687 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:19:50,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:19:50,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1471862468, now seen corresponding path program 16 times [2021-11-20 23:19:50,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:19:50,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778466694] [2021-11-20 23:19:50,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:19:50,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:19:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:19:51,005 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:51,005 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:19:51,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778466694] [2021-11-20 23:19:51,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778466694] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:19:51,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818648270] [2021-11-20 23:19:51,006 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:19:51,006 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:19:51,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:19:51,007 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:19:51,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-11-20 23:19:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:19:51,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 56 conjunts are in the unsatisfiable core [2021-11-20 23:19:51,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:19:51,375 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-20 23:19:51,375 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2021-11-20 23:19:51,450 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-20 23:19:51,550 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:51,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:19:53,116 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (< (+ c_~s_2~0 c_~t_4~0) (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| (store (select |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|)) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4)) 1))) (forall ((|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (<= (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| (store (select |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|)) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4))) (+ c_~s_2~0 c_~t_4~0)))) is different from false [2021-11-20 23:19:53,149 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:19:53,149 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 69 treesize of output 60 [2021-11-20 23:19:53,209 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:19:53,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:19:53,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 5 [2021-11-20 23:19:53,381 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:53,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818648270] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:19:53,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [693108015] [2021-11-20 23:19:53,381 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:19:53,382 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:19:53,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2021-11-20 23:19:53,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045290776] [2021-11-20 23:19:53,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:19:53,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-20 23:19:53,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:19:53,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-20 23:19:53,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=283, Unknown=1, NotChecked=34, Total=380 [2021-11-20 23:19:53,384 INFO L87 Difference]: Start difference. First operand 1317 states and 4780 transitions. Second operand has 20 states, 19 states have (on average 3.5789473684210527) internal successors, (68), 19 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:19:54,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:19:54,254 INFO L93 Difference]: Finished difference Result 1672 states and 6022 transitions. [2021-11-20 23:19:54,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-20 23:19:54,255 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.5789473684210527) internal successors, (68), 19 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-20 23:19:54,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:19:54,259 INFO L225 Difference]: With dead ends: 1672 [2021-11-20 23:19:54,259 INFO L226 Difference]: Without dead ends: 1633 [2021-11-20 23:19:54,260 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 56 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=157, Invalid=548, Unknown=1, NotChecked=50, Total=756 [2021-11-20 23:19:54,260 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 219 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-20 23:19:54,261 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 179 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 804 Invalid, 0 Unknown, 121 Unchecked, 0.6s Time] [2021-11-20 23:19:54,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2021-11-20 23:19:54,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1313. [2021-11-20 23:19:54,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1313 states, 1312 states have (on average 3.6341463414634148) internal successors, (4768), 1312 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:19:54,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 4768 transitions. [2021-11-20 23:19:54,293 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 4768 transitions. Word has length 36 [2021-11-20 23:19:54,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:19:54,294 INFO L470 AbstractCegarLoop]: Abstraction has 1313 states and 4768 transitions. [2021-11-20 23:19:54,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.5789473684210527) internal successors, (68), 19 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:19:54,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 4768 transitions. [2021-11-20 23:19:54,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 23:19:54,297 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:19:54,297 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:19:54,324 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2021-11-20 23:19:54,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:19:54,498 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:19:54,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:19:54,499 INFO L85 PathProgramCache]: Analyzing trace with hash -884300770, now seen corresponding path program 17 times [2021-11-20 23:19:54,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:19:54,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417829801] [2021-11-20 23:19:54,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:19:54,499 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:19:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:19:54,747 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:54,748 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:19:54,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417829801] [2021-11-20 23:19:54,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417829801] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:19:54,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044986101] [2021-11-20 23:19:54,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:19:54,748 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:19:54,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:19:54,749 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:19:54,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2021-11-20 23:19:54,859 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-20 23:19:54,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:19:54,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 51 conjunts are in the unsatisfiable core [2021-11-20 23:19:54,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:19:55,037 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 10 [2021-11-20 23:19:55,180 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:55,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:19:55,391 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:19:55,392 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 27 [2021-11-20 23:19:55,422 INFO L354 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2021-11-20 23:19:55,423 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2021-11-20 23:19:55,507 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:55,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044986101] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:19:55,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [925680443] [2021-11-20 23:19:55,507 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:19:55,507 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:19:55,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 13 [2021-11-20 23:19:55,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398114870] [2021-11-20 23:19:55,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:19:55,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-20 23:19:55,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:19:55,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-20 23:19:55,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-11-20 23:19:55,509 INFO L87 Difference]: Start difference. First operand 1313 states and 4768 transitions. Second operand has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:19:56,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:19:56,122 INFO L93 Difference]: Finished difference Result 1644 states and 5917 transitions. [2021-11-20 23:19:56,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 23:19:56,122 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-20 23:19:56,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:19:56,126 INFO L225 Difference]: With dead ends: 1644 [2021-11-20 23:19:56,126 INFO L226 Difference]: Without dead ends: 1599 [2021-11-20 23:19:56,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2021-11-20 23:19:56,127 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 163 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-20 23:19:56,128 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 179 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-20 23:19:56,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2021-11-20 23:19:56,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1341. [2021-11-20 23:19:56,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1341 states, 1340 states have (on average 3.6313432835820896) internal successors, (4866), 1340 states have internal predecessors, (4866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:19:56,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 4866 transitions. [2021-11-20 23:19:56,161 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 4866 transitions. Word has length 36 [2021-11-20 23:19:56,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:19:56,161 INFO L470 AbstractCegarLoop]: Abstraction has 1341 states and 4866 transitions. [2021-11-20 23:19:56,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:19:56,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 4866 transitions. [2021-11-20 23:19:56,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 23:19:56,165 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:19:56,165 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:19:56,197 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2021-11-20 23:19:56,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-11-20 23:19:56,366 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:19:56,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:19:56,367 INFO L85 PathProgramCache]: Analyzing trace with hash -127650358, now seen corresponding path program 18 times [2021-11-20 23:19:56,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:19:56,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742052471] [2021-11-20 23:19:56,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:19:56,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:19:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:19:56,690 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:56,690 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:19:56,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742052471] [2021-11-20 23:19:56,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742052471] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:19:56,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685037060] [2021-11-20 23:19:56,691 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:19:56,691 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:19:56,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:19:56,693 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:19:56,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2021-11-20 23:19:56,793 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:19:56,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:19:56,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 58 conjunts are in the unsatisfiable core [2021-11-20 23:19:56,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:19:56,822 INFO L354 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-11-20 23:19:56,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 16 [2021-11-20 23:19:56,988 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:19:56,988 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 15 [2021-11-20 23:19:57,175 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-20 23:19:57,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2021-11-20 23:19:57,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 10 [2021-11-20 23:19:57,308 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:57,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:19:59,088 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:19:59,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 62 [2021-11-20 23:19:59,147 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:19:59,154 INFO L354 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2021-11-20 23:19:59,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2021-11-20 23:19:59,400 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:59,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685037060] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:19:59,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [208727970] [2021-11-20 23:19:59,401 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:19:59,401 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:19:59,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2021-11-20 23:19:59,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889038693] [2021-11-20 23:19:59,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:19:59,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-20 23:19:59,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:19:59,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-20 23:19:59,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=360, Unknown=1, NotChecked=0, Total=420 [2021-11-20 23:19:59,403 INFO L87 Difference]: Start difference. First operand 1341 states and 4866 transitions. Second operand has 21 states, 20 states have (on average 3.55) internal successors, (71), 20 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:20:00,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:20:00,423 INFO L93 Difference]: Finished difference Result 1712 states and 6158 transitions. [2021-11-20 23:20:00,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-20 23:20:00,424 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.55) internal successors, (71), 20 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-20 23:20:00,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:20:00,428 INFO L225 Difference]: With dead ends: 1712 [2021-11-20 23:20:00,428 INFO L226 Difference]: Without dead ends: 1673 [2021-11-20 23:20:00,428 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=190, Invalid=801, Unknown=1, NotChecked=0, Total=992 [2021-11-20 23:20:00,429 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 230 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-20 23:20:00,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [230 Valid, 204 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 843 Invalid, 0 Unknown, 66 Unchecked, 0.7s Time] [2021-11-20 23:20:00,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2021-11-20 23:20:00,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1341. [2021-11-20 23:20:00,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1341 states, 1340 states have (on average 3.6313432835820896) internal successors, (4866), 1340 states have internal predecessors, (4866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:20:00,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 4866 transitions. [2021-11-20 23:20:00,460 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 4866 transitions. Word has length 36 [2021-11-20 23:20:00,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:20:00,461 INFO L470 AbstractCegarLoop]: Abstraction has 1341 states and 4866 transitions. [2021-11-20 23:20:00,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.55) internal successors, (71), 20 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:20:00,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 4866 transitions. [2021-11-20 23:20:00,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 23:20:00,464 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:20:00,464 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:20:00,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2021-11-20 23:20:00,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-11-20 23:20:00,665 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:20:00,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:20:00,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1699244120, now seen corresponding path program 9 times [2021-11-20 23:20:00,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:20:00,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678657204] [2021-11-20 23:20:00,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:20:00,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:20:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:20:00,992 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:20:00,992 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:20:00,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678657204] [2021-11-20 23:20:00,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678657204] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:20:00,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872482962] [2021-11-20 23:20:00,993 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:20:00,993 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:20:00,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:20:00,995 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:20:01,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2021-11-20 23:20:01,126 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:20:01,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:20:01,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 58 conjunts are in the unsatisfiable core [2021-11-20 23:20:01,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:20:01,164 INFO L354 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-11-20 23:20:01,164 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 16 [2021-11-20 23:20:01,357 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:20:01,357 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 15 [2021-11-20 23:20:01,572 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-20 23:20:01,573 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2021-11-20 23:20:01,651 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 10 [2021-11-20 23:20:01,804 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:20:01,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:20:03,714 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (< (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| (store (select |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|)) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (+ c_~s_6~0 1))) (forall ((|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (<= c_~s_6~0 (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| (store (select |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|)) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)))))) is different from false [2021-11-20 23:20:03,758 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:20:03,758 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 62 [2021-11-20 23:20:03,841 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:20:03,850 INFO L354 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2021-11-20 23:20:03,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2021-11-20 23:20:04,157 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-20 23:20:04,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872482962] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:20:04,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [697826713] [2021-11-20 23:20:04,158 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:20:04,158 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:20:04,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2021-11-20 23:20:04,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640174472] [2021-11-20 23:20:04,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:20:04,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-20 23:20:04,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:20:04,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-20 23:20:04,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=327, Unknown=1, NotChecked=36, Total=420 [2021-11-20 23:20:04,162 INFO L87 Difference]: Start difference. First operand 1341 states and 4866 transitions. Second operand has 21 states, 20 states have (on average 3.7) internal successors, (74), 20 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:20:09,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:20:09,351 INFO L93 Difference]: Finished difference Result 1640 states and 5910 transitions. [2021-11-20 23:20:09,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-20 23:20:09,351 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.7) internal successors, (74), 20 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-20 23:20:09,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:20:09,355 INFO L225 Difference]: With dead ends: 1640 [2021-11-20 23:20:09,355 INFO L226 Difference]: Without dead ends: 1597 [2021-11-20 23:20:09,356 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=207, Invalid=918, Unknown=1, NotChecked=64, Total=1190 [2021-11-20 23:20:09,356 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 199 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 295 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-20 23:20:09,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 222 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 755 Invalid, 0 Unknown, 295 Unchecked, 0.6s Time] [2021-11-20 23:20:09,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1597 states. [2021-11-20 23:20:09,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1597 to 1353. [2021-11-20 23:20:09,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1352 states have (on average 3.636094674556213) internal successors, (4916), 1352 states have internal predecessors, (4916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:20:09,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 4916 transitions. [2021-11-20 23:20:09,403 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 4916 transitions. Word has length 36 [2021-11-20 23:20:09,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:20:09,403 INFO L470 AbstractCegarLoop]: Abstraction has 1353 states and 4916 transitions. [2021-11-20 23:20:09,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.7) internal successors, (74), 20 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:20:09,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 4916 transitions. [2021-11-20 23:20:09,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 23:20:09,406 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:20:09,406 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:20:09,433 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2021-11-20 23:20:09,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-11-20 23:20:09,607 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:20:09,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:20:09,608 INFO L85 PathProgramCache]: Analyzing trace with hash 992395096, now seen corresponding path program 10 times [2021-11-20 23:20:09,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:20:09,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662837919] [2021-11-20 23:20:09,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:20:09,608 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:20:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:20:09,816 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:20:09,817 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:20:09,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662837919] [2021-11-20 23:20:09,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662837919] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:20:09,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041293520] [2021-11-20 23:20:09,817 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:20:09,817 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:20:09,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:20:09,819 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:20:09,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2021-11-20 23:20:09,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:20:09,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 51 conjunts are in the unsatisfiable core [2021-11-20 23:20:09,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:20:10,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-20 23:20:10,354 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:20:10,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:20:10,523 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:20:10,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 27 [2021-11-20 23:20:10,542 INFO L354 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2021-11-20 23:20:10,542 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2021-11-20 23:20:10,659 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:20:10,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041293520] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:20:10,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1894997875] [2021-11-20 23:20:10,660 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:20:10,660 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:20:10,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 13 [2021-11-20 23:20:10,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900227613] [2021-11-20 23:20:10,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:20:10,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-20 23:20:10,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:20:10,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-20 23:20:10,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-11-20 23:20:10,662 INFO L87 Difference]: Start difference. First operand 1353 states and 4916 transitions. Second operand has 14 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:20:11,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:20:11,231 INFO L93 Difference]: Finished difference Result 1600 states and 5785 transitions. [2021-11-20 23:20:11,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-20 23:20:11,231 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-20 23:20:11,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:20:11,235 INFO L225 Difference]: With dead ends: 1600 [2021-11-20 23:20:11,235 INFO L226 Difference]: Without dead ends: 1557 [2021-11-20 23:20:11,235 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2021-11-20 23:20:11,236 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 136 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 23:20:11,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 148 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-20 23:20:11,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2021-11-20 23:20:11,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1367. [2021-11-20 23:20:11,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1367 states, 1366 states have (on average 3.6390922401171304) internal successors, (4971), 1366 states have internal predecessors, (4971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:20:11,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 4971 transitions. [2021-11-20 23:20:11,274 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 4971 transitions. Word has length 36 [2021-11-20 23:20:11,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:20:11,275 INFO L470 AbstractCegarLoop]: Abstraction has 1367 states and 4971 transitions. [2021-11-20 23:20:11,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:20:11,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 4971 transitions. [2021-11-20 23:20:11,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 23:20:11,280 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:20:11,280 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:20:11,328 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2021-11-20 23:20:11,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-11-20 23:20:11,495 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:20:11,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:20:11,496 INFO L85 PathProgramCache]: Analyzing trace with hash 953880984, now seen corresponding path program 11 times [2021-11-20 23:20:11,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:20:11,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95229531] [2021-11-20 23:20:11,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:20:11,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:20:11,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:20:11,775 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:20:11,776 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:20:11,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95229531] [2021-11-20 23:20:11,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95229531] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:20:11,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784894294] [2021-11-20 23:20:11,776 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:20:11,776 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:20:11,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:20:11,778 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:20:11,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2021-11-20 23:20:11,923 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-20 23:20:11,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:20:11,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 51 conjunts are in the unsatisfiable core [2021-11-20 23:20:11,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:20:12,246 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 10 [2021-11-20 23:20:12,337 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:20:12,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:20:12,499 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:20:12,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 27 [2021-11-20 23:20:12,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:20:12,516 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:20:12,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2021-11-20 23:20:12,638 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:20:12,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784894294] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:20:12,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [997367977] [2021-11-20 23:20:12,639 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:20:12,639 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:20:12,639 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 14 [2021-11-20 23:20:12,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044353943] [2021-11-20 23:20:12,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:20:12,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-20 23:20:12,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:20:12,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-20 23:20:12,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-11-20 23:20:12,641 INFO L87 Difference]: Start difference. First operand 1367 states and 4971 transitions. Second operand has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:20:13,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:20:13,433 INFO L93 Difference]: Finished difference Result 1861 states and 6682 transitions. [2021-11-20 23:20:13,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-20 23:20:13,434 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-20 23:20:13,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:20:13,438 INFO L225 Difference]: With dead ends: 1861 [2021-11-20 23:20:13,438 INFO L226 Difference]: Without dead ends: 1795 [2021-11-20 23:20:13,439 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2021-11-20 23:20:13,439 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 220 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-20 23:20:13,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 141 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-20 23:20:13,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states. [2021-11-20 23:20:13,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1350. [2021-11-20 23:20:13,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 1349 states have (on average 3.636767976278725) internal successors, (4906), 1349 states have internal predecessors, (4906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:20:13,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 4906 transitions. [2021-11-20 23:20:13,473 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 4906 transitions. Word has length 36 [2021-11-20 23:20:13,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:20:13,474 INFO L470 AbstractCegarLoop]: Abstraction has 1350 states and 4906 transitions. [2021-11-20 23:20:13,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:20:13,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 4906 transitions. [2021-11-20 23:20:13,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 23:20:13,477 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:20:13,477 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:20:13,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2021-11-20 23:20:13,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-11-20 23:20:13,678 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:20:13,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:20:13,679 INFO L85 PathProgramCache]: Analyzing trace with hash 2142383406, now seen corresponding path program 12 times [2021-11-20 23:20:13,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:20:13,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257645117] [2021-11-20 23:20:13,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:20:13,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:20:13,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:20:14,146 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:20:14,146 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:20:14,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257645117] [2021-11-20 23:20:14,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257645117] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:20:14,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376251361] [2021-11-20 23:20:14,147 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:20:14,147 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:20:14,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:20:14,151 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:20:14,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2021-11-20 23:20:14,280 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:20:14,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:20:14,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 58 conjunts are in the unsatisfiable core [2021-11-20 23:20:14,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:20:14,316 INFO L354 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-11-20 23:20:14,317 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 16 [2021-11-20 23:20:14,510 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:20:14,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 15 [2021-11-20 23:20:14,720 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-20 23:20:14,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2021-11-20 23:20:14,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 10 [2021-11-20 23:20:14,883 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:20:14,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:20:28,149 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:20:28,149 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 62 [2021-11-20 23:20:28,219 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:20:28,228 INFO L354 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2021-11-20 23:20:28,229 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2021-11-20 23:20:28,476 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:20:28,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376251361] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:20:28,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2118669081] [2021-11-20 23:20:28,477 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:20:28,477 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:20:28,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 21 [2021-11-20 23:20:28,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434921880] [2021-11-20 23:20:28,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:20:28,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-20 23:20:28,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:20:28,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-20 23:20:28,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=438, Unknown=6, NotChecked=0, Total=506 [2021-11-20 23:20:28,479 INFO L87 Difference]: Start difference. First operand 1350 states and 4906 transitions. Second operand has 23 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 22 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:20:29,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:20:29,626 INFO L93 Difference]: Finished difference Result 1674 states and 6031 transitions. [2021-11-20 23:20:29,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-20 23:20:29,627 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 22 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-20 23:20:29,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:20:29,630 INFO L225 Difference]: With dead ends: 1674 [2021-11-20 23:20:29,631 INFO L226 Difference]: Without dead ends: 1631 [2021-11-20 23:20:29,631 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=223, Invalid=1031, Unknown=6, NotChecked=0, Total=1260 [2021-11-20 23:20:29,632 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 249 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-20 23:20:29,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 214 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 912 Invalid, 0 Unknown, 129 Unchecked, 0.7s Time] [2021-11-20 23:20:29,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2021-11-20 23:20:29,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1307. [2021-11-20 23:20:29,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1307 states, 1306 states have (on average 3.63323124042879) internal successors, (4745), 1306 states have internal predecessors, (4745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:20:29,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 4745 transitions. [2021-11-20 23:20:29,661 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 4745 transitions. Word has length 36 [2021-11-20 23:20:29,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:20:29,661 INFO L470 AbstractCegarLoop]: Abstraction has 1307 states and 4745 transitions. [2021-11-20 23:20:29,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 22 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:20:29,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 4745 transitions. [2021-11-20 23:20:29,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 23:20:29,666 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:20:29,667 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:20:29,704 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2021-11-20 23:20:29,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:20:29,882 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:20:29,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:20:29,883 INFO L85 PathProgramCache]: Analyzing trace with hash 2082679322, now seen corresponding path program 19 times [2021-11-20 23:20:29,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:20:29,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949596824] [2021-11-20 23:20:29,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:20:29,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:20:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:20:30,239 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:20:30,240 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:20:30,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949596824] [2021-11-20 23:20:30,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949596824] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:20:30,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423827894] [2021-11-20 23:20:30,240 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:20:30,240 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:20:30,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:20:30,242 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:20:30,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2021-11-20 23:20:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:20:30,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 59 conjunts are in the unsatisfiable core [2021-11-20 23:20:30,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:20:30,402 INFO L354 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-11-20 23:20:30,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 16 [2021-11-20 23:20:30,604 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:20:30,604 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-11-20 23:20:30,696 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-20 23:20:30,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2021-11-20 23:20:30,799 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 10 [2021-11-20 23:20:30,943 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:20:30,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:20:35,508 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:20:35,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 62 [2021-11-20 23:20:35,552 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:20:35,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:20:35,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 3 [2021-11-20 23:20:35,711 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:20:35,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423827894] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:20:35,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1395220049] [2021-11-20 23:20:35,712 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:20:35,712 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:20:35,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2021-11-20 23:20:35,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270470044] [2021-11-20 23:20:35,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:20:35,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-20 23:20:35,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:20:35,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-20 23:20:35,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2021-11-20 23:20:35,714 INFO L87 Difference]: Start difference. First operand 1307 states and 4745 transitions. Second operand has 21 states, 20 states have (on average 3.45) internal successors, (69), 20 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:20:36,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:20:36,568 INFO L93 Difference]: Finished difference Result 1826 states and 6590 transitions. [2021-11-20 23:20:36,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-20 23:20:36,568 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.45) internal successors, (69), 20 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-20 23:20:36,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:20:36,572 INFO L225 Difference]: With dead ends: 1826 [2021-11-20 23:20:36,572 INFO L226 Difference]: Without dead ends: 1781 [2021-11-20 23:20:36,573 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=177, Invalid=753, Unknown=0, NotChecked=0, Total=930 [2021-11-20 23:20:36,573 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 185 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-20 23:20:36,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 161 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 602 Invalid, 0 Unknown, 39 Unchecked, 0.5s Time] [2021-11-20 23:20:36,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2021-11-20 23:20:36,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1331. [2021-11-20 23:20:36,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1331 states, 1330 states have (on average 3.6218045112781954) internal successors, (4817), 1330 states have internal predecessors, (4817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:20:36,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 4817 transitions. [2021-11-20 23:20:36,616 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 4817 transitions. Word has length 36 [2021-11-20 23:20:36,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:20:36,617 INFO L470 AbstractCegarLoop]: Abstraction has 1331 states and 4817 transitions. [2021-11-20 23:20:36,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.45) internal successors, (69), 20 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:20:36,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 4817 transitions. [2021-11-20 23:20:36,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 23:20:36,622 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:20:36,622 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:20:36,664 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2021-11-20 23:20:36,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-11-20 23:20:36,847 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:20:36,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:20:36,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1455637562, now seen corresponding path program 20 times [2021-11-20 23:20:36,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:20:36,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681981211] [2021-11-20 23:20:36,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:20:36,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:20:36,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:20:37,304 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:20:37,305 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:20:37,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681981211] [2021-11-20 23:20:37,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681981211] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:20:37,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136644184] [2021-11-20 23:20:37,305 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:20:37,306 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:20:37,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:20:37,307 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:20:37,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2021-11-20 23:20:37,446 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-20 23:20:37,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:20:37,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 62 conjunts are in the unsatisfiable core [2021-11-20 23:20:37,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:20:37,484 INFO L354 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-11-20 23:20:37,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 16 [2021-11-20 23:20:37,691 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:20:37,692 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 15 [2021-11-20 23:20:37,878 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-20 23:20:37,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 30 treesize of output 29 [2021-11-20 23:20:38,034 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-20 23:20:38,035 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2021-11-20 23:20:38,081 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 10 [2021-11-20 23:20:38,190 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:20:38,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:20:39,718 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (< (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| (store (select |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|)) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (+ c_~s_6~0 1))) (forall ((|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (<= c_~s_6~0 (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| (store (select |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|)) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)))))) is different from false [2021-11-20 23:20:41,769 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|thread1Thread1of1ForFork3_~#t2~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre9| Int) (|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (<= c_~s_6~0 (+ c_~s_2~0 (select (select (let ((.cse0 (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| (store (select |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base|) |thread1Thread1of1ForFork3_~#t2~0.offset| |thread1Thread1of1ForFork3_#t~pre9|)))) (store .cse0 |c_thread1Thread1of1ForFork3_~#t3~0.base| (store (select .cse0 |c_thread1Thread1of1ForFork3_~#t3~0.base|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|))) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))))) (forall ((|thread1Thread1of1ForFork3_~#t2~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre9| Int) (|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (< (+ c_~s_2~0 (select (select (let ((.cse1 (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| (store (select |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base|) |thread1Thread1of1ForFork3_~#t2~0.offset| |thread1Thread1of1ForFork3_#t~pre9|)))) (store .cse1 |c_thread1Thread1of1ForFork3_~#t3~0.base| (store (select .cse1 |c_thread1Thread1of1ForFork3_~#t3~0.base|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|))) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (+ c_~s_6~0 1)))) is different from false [2021-11-20 23:20:41,786 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:20:41,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 350 treesize of output 278 [2021-11-20 23:20:41,961 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:20:41,962 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:20:41,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:20:41,966 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 3 [2021-11-20 23:20:42,588 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-20 23:20:42,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136644184] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:20:42,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [351927679] [2021-11-20 23:20:42,589 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:20:42,589 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:20:42,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2021-11-20 23:20:42,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323972253] [2021-11-20 23:20:42,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:20:42,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-20 23:20:42,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:20:42,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-20 23:20:42,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=433, Unknown=2, NotChecked=86, Total=600 [2021-11-20 23:20:42,591 INFO L87 Difference]: Start difference. First operand 1331 states and 4817 transitions. Second operand has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:20:50,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:20:50,365 INFO L93 Difference]: Finished difference Result 1794 states and 6432 transitions. [2021-11-20 23:20:50,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-20 23:20:50,366 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-20 23:20:50,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:20:50,370 INFO L225 Difference]: With dead ends: 1794 [2021-11-20 23:20:50,370 INFO L226 Difference]: Without dead ends: 1755 [2021-11-20 23:20:50,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 57 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=271, Invalid=1217, Unknown=2, NotChecked=150, Total=1640 [2021-11-20 23:20:50,372 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 176 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 486 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-20 23:20:50,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 209 Invalid, 1197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 690 Invalid, 0 Unknown, 486 Unchecked, 0.6s Time] [2021-11-20 23:20:50,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2021-11-20 23:20:50,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1357. [2021-11-20 23:20:50,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1357 states, 1356 states have (on average 3.6150442477876106) internal successors, (4902), 1356 states have internal predecessors, (4902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:20:50,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 4902 transitions. [2021-11-20 23:20:50,404 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 4902 transitions. Word has length 36 [2021-11-20 23:20:50,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:20:50,404 INFO L470 AbstractCegarLoop]: Abstraction has 1357 states and 4902 transitions. [2021-11-20 23:20:50,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:20:50,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 4902 transitions. [2021-11-20 23:20:50,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 23:20:50,407 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:20:50,407 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:20:50,435 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2021-11-20 23:20:50,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-11-20 23:20:50,608 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:20:50,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:20:50,609 INFO L85 PathProgramCache]: Analyzing trace with hash 371256916, now seen corresponding path program 13 times [2021-11-20 23:20:50,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:20:50,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171935502] [2021-11-20 23:20:50,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:20:50,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:20:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:20:51,108 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:20:51,108 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:20:51,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171935502] [2021-11-20 23:20:51,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171935502] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:20:51,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266173348] [2021-11-20 23:20:51,109 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:20:51,109 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:20:51,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:20:51,110 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:20:51,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2021-11-20 23:20:51,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:20:51,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 60 conjunts are in the unsatisfiable core [2021-11-20 23:20:51,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:20:51,588 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-20 23:20:51,588 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2021-11-20 23:20:51,743 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-20 23:20:51,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2021-11-20 23:20:51,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 10 [2021-11-20 23:20:51,920 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:20:51,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:21:16,302 WARN L227 SmtUtils]: Spent 7.14s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 23:21:16,319 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:21:16,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 350 treesize of output 278 [2021-11-20 23:21:16,610 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:21:16,611 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:21:16,620 INFO L354 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2021-11-20 23:21:16,620 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2021-11-20 23:21:16,851 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:21:16,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266173348] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:21:16,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1126998839] [2021-11-20 23:21:16,852 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:21:16,852 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:21:16,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2021-11-20 23:21:16,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925274686] [2021-11-20 23:21:16,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:21:16,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-20 23:21:16,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:21:16,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-20 23:21:16,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=503, Unknown=7, NotChecked=0, Total=600 [2021-11-20 23:21:16,854 INFO L87 Difference]: Start difference. First operand 1357 states and 4902 transitions. Second operand has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:21:18,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:21:18,037 INFO L93 Difference]: Finished difference Result 1701 states and 6110 transitions. [2021-11-20 23:21:18,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-20 23:21:18,038 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-20 23:21:18,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:21:18,042 INFO L225 Difference]: With dead ends: 1701 [2021-11-20 23:21:18,042 INFO L226 Difference]: Without dead ends: 1658 [2021-11-20 23:21:18,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 25.0s TimeCoverageRelationStatistics Valid=233, Invalid=1020, Unknown=7, NotChecked=0, Total=1260 [2021-11-20 23:21:18,043 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 314 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 187 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-20 23:21:18,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [314 Valid, 203 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 832 Invalid, 0 Unknown, 187 Unchecked, 0.8s Time] [2021-11-20 23:21:18,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2021-11-20 23:21:18,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1352. [2021-11-20 23:21:18,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 1351 states have (on average 3.619541080680977) internal successors, (4890), 1351 states have internal predecessors, (4890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:21:18,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 4890 transitions. [2021-11-20 23:21:18,088 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 4890 transitions. Word has length 36 [2021-11-20 23:21:18,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:21:18,089 INFO L470 AbstractCegarLoop]: Abstraction has 1352 states and 4890 transitions. [2021-11-20 23:21:18,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:21:18,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 4890 transitions. [2021-11-20 23:21:18,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 23:21:18,095 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:21:18,095 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:21:18,144 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2021-11-20 23:21:18,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:21:18,309 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:21:18,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:21:18,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1127552630, now seen corresponding path program 21 times [2021-11-20 23:21:18,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:21:18,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742143900] [2021-11-20 23:21:18,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:21:18,310 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:21:18,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:21:18,714 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:21:18,714 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:21:18,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742143900] [2021-11-20 23:21:18,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742143900] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:21:18,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132850404] [2021-11-20 23:21:18,714 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:21:18,715 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:21:18,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:21:18,716 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:21:18,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2021-11-20 23:21:18,815 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:21:18,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:21:18,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 61 conjunts are in the unsatisfiable core [2021-11-20 23:21:18,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:21:18,850 INFO L354 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-11-20 23:21:18,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 16 [2021-11-20 23:21:19,005 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 23:21:19,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2021-11-20 23:21:19,162 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-20 23:21:19,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 29 treesize of output 28 [2021-11-20 23:21:19,262 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-20 23:21:19,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2021-11-20 23:21:19,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 10 [2021-11-20 23:21:19,396 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:21:19,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:21:22,612 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|thread1Thread1of1ForFork3_~#t2~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre9| Int) (|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (<= c_~s_6~0 (+ c_~s_2~0 (select (select (let ((.cse0 (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| (store (select |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base|) |thread1Thread1of1ForFork3_~#t2~0.offset| |thread1Thread1of1ForFork3_#t~pre9|)))) (store .cse0 |c_thread1Thread1of1ForFork3_~#t3~0.base| (store (select .cse0 |c_thread1Thread1of1ForFork3_~#t3~0.base|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|))) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))))) (forall ((|thread1Thread1of1ForFork3_~#t2~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre9| Int) (|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (< (+ c_~s_2~0 (select (select (let ((.cse1 (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| (store (select |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base|) |thread1Thread1of1ForFork3_~#t2~0.offset| |thread1Thread1of1ForFork3_#t~pre9|)))) (store .cse1 |c_thread1Thread1of1ForFork3_~#t3~0.base| (store (select .cse1 |c_thread1Thread1of1ForFork3_~#t3~0.base|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|))) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (+ c_~s_6~0 1)))) is different from false [2021-11-20 23:21:22,640 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:21:22,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 350 treesize of output 278 [2021-11-20 23:21:22,841 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:21:22,842 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:21:22,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:22,846 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 3 [2021-11-20 23:21:23,515 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-20 23:21:23,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132850404] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:21:23,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [480296945] [2021-11-20 23:21:23,516 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:21:23,516 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:21:23,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2021-11-20 23:21:23,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308184036] [2021-11-20 23:21:23,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:21:23,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-20 23:21:23,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:21:23,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-20 23:21:23,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=475, Unknown=1, NotChecked=44, Total=600 [2021-11-20 23:21:23,518 INFO L87 Difference]: Start difference. First operand 1352 states and 4890 transitions. Second operand has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:21:29,756 WARN L227 SmtUtils]: Spent 5.93s on a formula simplification. DAG size of input: 68 DAG size of output: 59 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 23:21:30,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:21:30,793 INFO L93 Difference]: Finished difference Result 1807 states and 6424 transitions. [2021-11-20 23:21:30,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-20 23:21:30,794 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-20 23:21:30,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:21:30,798 INFO L225 Difference]: With dead ends: 1807 [2021-11-20 23:21:30,798 INFO L226 Difference]: Without dead ends: 1768 [2021-11-20 23:21:30,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=272, Invalid=1137, Unknown=1, NotChecked=72, Total=1482 [2021-11-20 23:21:30,799 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 257 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 1469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 319 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-20 23:21:30,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 251 Invalid, 1469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1121 Invalid, 0 Unknown, 319 Unchecked, 0.9s Time] [2021-11-20 23:21:30,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2021-11-20 23:21:30,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1307. [2021-11-20 23:21:30,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1307 states, 1306 states have (on average 3.63323124042879) internal successors, (4745), 1306 states have internal predecessors, (4745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:21:30,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 4745 transitions. [2021-11-20 23:21:30,830 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 4745 transitions. Word has length 36 [2021-11-20 23:21:30,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:21:30,830 INFO L470 AbstractCegarLoop]: Abstraction has 1307 states and 4745 transitions. [2021-11-20 23:21:30,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:21:30,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 4745 transitions. [2021-11-20 23:21:30,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 23:21:30,833 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:21:30,834 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:21:30,859 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2021-11-20 23:21:31,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:21:31,035 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:21:31,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:21:31,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1966772322, now seen corresponding path program 22 times [2021-11-20 23:21:31,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:21:31,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574074761] [2021-11-20 23:21:31,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:21:31,037 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:21:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:21:31,435 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:21:31,435 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:21:31,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574074761] [2021-11-20 23:21:31,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574074761] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:21:31,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137235605] [2021-11-20 23:21:31,436 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:21:31,436 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:21:31,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:21:31,439 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:21:31,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2021-11-20 23:21:31,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:21:31,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 59 conjunts are in the unsatisfiable core [2021-11-20 23:21:31,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:21:31,590 INFO L354 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-11-20 23:21:31,590 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 16 [2021-11-20 23:21:31,752 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:21:31,753 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-11-20 23:21:31,819 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-20 23:21:31,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2021-11-20 23:21:31,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 10 [2021-11-20 23:21:31,996 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:21:31,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:21:33,520 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:21:33,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 122 treesize of output 89 [2021-11-20 23:21:35,722 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:21:35,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137235605] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:21:35,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1882771004] [2021-11-20 23:21:35,722 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:21:35,722 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:21:35,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2021-11-20 23:21:35,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117180221] [2021-11-20 23:21:35,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:21:35,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-20 23:21:35,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:21:35,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-20 23:21:35,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=316, Unknown=1, NotChecked=0, Total=380 [2021-11-20 23:21:35,724 INFO L87 Difference]: Start difference. First operand 1307 states and 4745 transitions. Second operand has 20 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:21:36,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:21:36,699 INFO L93 Difference]: Finished difference Result 1982 states and 7199 transitions. [2021-11-20 23:21:36,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-20 23:21:36,700 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-20 23:21:36,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:21:36,707 INFO L225 Difference]: With dead ends: 1982 [2021-11-20 23:21:36,707 INFO L226 Difference]: Without dead ends: 1937 [2021-11-20 23:21:36,708 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=161, Invalid=650, Unknown=1, NotChecked=0, Total=812 [2021-11-20 23:21:36,709 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 226 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 252 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-20 23:21:36,709 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 230 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 886 Invalid, 0 Unknown, 252 Unchecked, 0.7s Time] [2021-11-20 23:21:36,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1937 states. [2021-11-20 23:21:36,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1937 to 1335. [2021-11-20 23:21:36,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1335 states, 1334 states have (on average 3.6184407796101947) internal successors, (4827), 1334 states have internal predecessors, (4827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:21:36,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 1335 states and 4827 transitions. [2021-11-20 23:21:36,787 INFO L78 Accepts]: Start accepts. Automaton has 1335 states and 4827 transitions. Word has length 36 [2021-11-20 23:21:36,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:21:36,790 INFO L470 AbstractCegarLoop]: Abstraction has 1335 states and 4827 transitions. [2021-11-20 23:21:36,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:21:36,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 4827 transitions. [2021-11-20 23:21:36,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 23:21:36,795 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:21:36,795 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:21:36,844 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2021-11-20 23:21:37,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:21:37,014 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:21:37,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:21:37,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1210121910, now seen corresponding path program 23 times [2021-11-20 23:21:37,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:21:37,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779664980] [2021-11-20 23:21:37,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:21:37,015 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:21:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:21:37,487 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:21:37,487 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:21:37,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779664980] [2021-11-20 23:21:37,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779664980] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:21:37,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056625107] [2021-11-20 23:21:37,488 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:21:37,488 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:21:37,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:21:37,490 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:21:37,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2021-11-20 23:21:37,625 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-20 23:21:37,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:21:37,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 60 conjunts are in the unsatisfiable core [2021-11-20 23:21:37,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:21:37,881 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-20 23:21:37,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2021-11-20 23:21:38,027 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-20 23:21:38,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2021-11-20 23:21:38,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 10 [2021-11-20 23:21:38,195 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:21:38,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:21:52,361 WARN L227 SmtUtils]: Spent 5.83s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 23:21:54,510 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork3_~#t2~0.base_156| Int) (|v_thread1Thread1of1ForFork3_~#t3~0.base_154| Int)) (or (<= |v_thread1Thread1of1ForFork3_~#t3~0.base_154| |c_#StackHeapBarrier|) (and (forall ((|thread1Thread1of1ForFork3_~#t2~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre9| Int) (|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (< (select (select (let ((.cse0 (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_156| (store (select |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_156|) |thread1Thread1of1ForFork3_~#t2~0.offset| |thread1Thread1of1ForFork3_#t~pre9|)))) (store .cse0 |v_thread1Thread1of1ForFork3_~#t3~0.base_154| (store (select .cse0 |v_thread1Thread1of1ForFork3_~#t3~0.base_154|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|))) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1))) (forall ((|thread1Thread1of1ForFork3_~#t2~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre9| Int) (|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (<= c_~s_6~0 (select (select (let ((.cse1 (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_156| (store (select |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_156|) |thread1Thread1of1ForFork3_~#t2~0.offset| |thread1Thread1of1ForFork3_#t~pre9|)))) (store .cse1 |v_thread1Thread1of1ForFork3_~#t3~0.base_154| (store (select .cse1 |v_thread1Thread1of1ForFork3_~#t3~0.base_154|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|))) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) (<= |v_thread1Thread1of1ForFork3_~#t2~0.base_156| |c_#StackHeapBarrier|))) is different from false [2021-11-20 23:21:54,531 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:21:54,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 422 treesize of output 311 [2021-11-20 23:21:54,887 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:21:54,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056625107] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:21:54,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [39505176] [2021-11-20 23:21:54,888 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:21:54,889 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:21:54,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2021-11-20 23:21:54,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354810450] [2021-11-20 23:21:54,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:21:54,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-20 23:21:54,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:21:54,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-20 23:21:54,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=4, NotChecked=38, Total=462 [2021-11-20 23:21:54,891 INFO L87 Difference]: Start difference. First operand 1335 states and 4827 transitions. Second operand has 22 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:21:57,119 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4))))) (and (= c_~X_0~0.offset 0) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= 1 c_~i_7~0) (<= .cse0 c_~s_6~0) (<= c_~s_6~0 .cse0) (forall ((|v_thread1Thread1of1ForFork3_~#t2~0.base_156| Int) (|v_thread1Thread1of1ForFork3_~#t3~0.base_154| Int)) (or (<= |v_thread1Thread1of1ForFork3_~#t3~0.base_154| |c_#StackHeapBarrier|) (and (forall ((|thread1Thread1of1ForFork3_~#t2~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre9| Int) (|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (< (select (select (let ((.cse1 (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_156| (store (select |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_156|) |thread1Thread1of1ForFork3_~#t2~0.offset| |thread1Thread1of1ForFork3_#t~pre9|)))) (store .cse1 |v_thread1Thread1of1ForFork3_~#t3~0.base_154| (store (select .cse1 |v_thread1Thread1of1ForFork3_~#t3~0.base_154|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|))) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1))) (forall ((|thread1Thread1of1ForFork3_~#t2~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre9| Int) (|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (<= c_~s_6~0 (select (select (let ((.cse2 (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_156| (store (select |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_156|) |thread1Thread1of1ForFork3_~#t2~0.offset| |thread1Thread1of1ForFork3_#t~pre9|)))) (store .cse2 |v_thread1Thread1of1ForFork3_~#t3~0.base_154| (store (select .cse2 |v_thread1Thread1of1ForFork3_~#t3~0.base_154|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|))) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) (<= |v_thread1Thread1of1ForFork3_~#t2~0.base_156| |c_#StackHeapBarrier|))) (<= (+ c_~X_0~0.offset (* 4 c_~i_7~0)) 4) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0))) is different from false [2021-11-20 23:21:57,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:21:57,786 INFO L93 Difference]: Finished difference Result 2205 states and 8029 transitions. [2021-11-20 23:21:57,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 23:21:57,787 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-20 23:21:57,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:21:57,792 INFO L225 Difference]: With dead ends: 2205 [2021-11-20 23:21:57,792 INFO L226 Difference]: Without dead ends: 2166 [2021-11-20 23:21:57,793 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=122, Invalid=531, Unknown=5, NotChecked=98, Total=756 [2021-11-20 23:21:57,793 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 270 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 352 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-20 23:21:57,794 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [270 Valid, 228 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 903 Invalid, 0 Unknown, 352 Unchecked, 0.7s Time] [2021-11-20 23:21:57,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2166 states. [2021-11-20 23:21:57,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2166 to 1366. [2021-11-20 23:21:57,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1366 states, 1365 states have (on average 3.605128205128205) internal successors, (4921), 1365 states have internal predecessors, (4921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:21:57,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 4921 transitions. [2021-11-20 23:21:57,851 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 4921 transitions. Word has length 36 [2021-11-20 23:21:57,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:21:57,851 INFO L470 AbstractCegarLoop]: Abstraction has 1366 states and 4921 transitions. [2021-11-20 23:21:57,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:21:57,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 4921 transitions. [2021-11-20 23:21:57,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 23:21:57,854 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:21:57,855 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:21:57,881 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2021-11-20 23:21:58,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2021-11-20 23:21:58,056 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:21:58,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:21:58,057 INFO L85 PathProgramCache]: Analyzing trace with hash 616772568, now seen corresponding path program 14 times [2021-11-20 23:21:58,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:21:58,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102102074] [2021-11-20 23:21:58,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:21:58,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:21:58,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:21:58,510 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:21:58,510 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:21:58,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102102074] [2021-11-20 23:21:58,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102102074] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:21:58,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102902190] [2021-11-20 23:21:58,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:21:58,511 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:21:58,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:21:58,512 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:21:58,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2021-11-20 23:21:58,613 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-20 23:21:58,613 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:21:58,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 60 conjunts are in the unsatisfiable core [2021-11-20 23:21:58,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:21:58,816 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-20 23:21:58,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2021-11-20 23:21:58,948 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-20 23:21:58,948 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2021-11-20 23:21:59,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 10 [2021-11-20 23:21:59,125 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:21:59,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:22:00,886 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (< (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| (store (select |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|)) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (+ c_~s_6~0 1))) (forall ((|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (<= c_~s_6~0 (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| (store (select |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|)) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)))))) is different from false [2021-11-20 23:22:02,956 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|thread1Thread1of1ForFork3_~#t2~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre9| Int) (|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (<= c_~s_6~0 (+ c_~s_2~0 (select (select (let ((.cse0 (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| (store (select |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base|) |thread1Thread1of1ForFork3_~#t2~0.offset| |thread1Thread1of1ForFork3_#t~pre9|)))) (store .cse0 |c_thread1Thread1of1ForFork3_~#t3~0.base| (store (select .cse0 |c_thread1Thread1of1ForFork3_~#t3~0.base|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|))) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))))) (forall ((|thread1Thread1of1ForFork3_~#t2~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre9| Int) (|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (< (+ c_~s_2~0 (select (select (let ((.cse1 (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| (store (select |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base|) |thread1Thread1of1ForFork3_~#t2~0.offset| |thread1Thread1of1ForFork3_#t~pre9|)))) (store .cse1 |c_thread1Thread1of1ForFork3_~#t3~0.base| (store (select .cse1 |c_thread1Thread1of1ForFork3_~#t3~0.base|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|))) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (+ c_~s_6~0 1)))) is different from false [2021-11-20 23:22:05,124 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_157| Int) (|v_thread1Thread1of1ForFork3_~#t2~0.base_159| Int)) (or (<= |v_thread1Thread1of1ForFork3_~#t2~0.base_159| |c_#StackHeapBarrier|) (<= |v_thread1Thread1of1ForFork3_~#t3~0.base_157| |c_#StackHeapBarrier|) (and (forall ((|thread1Thread1of1ForFork3_~#t2~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre9| Int) (|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (<= c_~s_6~0 (select (select (let ((.cse0 (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_159| (store (select |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_159|) |thread1Thread1of1ForFork3_~#t2~0.offset| |thread1Thread1of1ForFork3_#t~pre9|)))) (store .cse0 |v_thread1Thread1of1ForFork3_~#t3~0.base_157| (store (select .cse0 |v_thread1Thread1of1ForFork3_~#t3~0.base_157|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|))) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((|thread1Thread1of1ForFork3_~#t2~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre9| Int) (|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (< (select (select (let ((.cse1 (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_159| (store (select |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_159|) |thread1Thread1of1ForFork3_~#t2~0.offset| |thread1Thread1of1ForFork3_#t~pre9|)))) (store .cse1 |v_thread1Thread1of1ForFork3_~#t3~0.base_157| (store (select .cse1 |v_thread1Thread1of1ForFork3_~#t3~0.base_157|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|))) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1)))))) is different from false [2021-11-20 23:22:05,146 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:22:05,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 572 treesize of output 419 [2021-11-20 23:22:05,709 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-20 23:22:05,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102902190] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:22:05,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [219719756] [2021-11-20 23:22:05,710 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:22:05,710 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:22:05,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2021-11-20 23:22:05,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214218889] [2021-11-20 23:22:05,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:22:05,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-20 23:22:05,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:22:05,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-20 23:22:05,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=286, Unknown=3, NotChecked=108, Total=462 [2021-11-20 23:22:05,712 INFO L87 Difference]: Start difference. First operand 1366 states and 4921 transitions. Second operand has 22 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:22:07,928 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4))))) (and (= c_~X_0~0.offset 0) (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_157| Int) (|v_thread1Thread1of1ForFork3_~#t2~0.base_159| Int)) (or (<= |v_thread1Thread1of1ForFork3_~#t2~0.base_159| |c_#StackHeapBarrier|) (<= |v_thread1Thread1of1ForFork3_~#t3~0.base_157| |c_#StackHeapBarrier|) (and (forall ((|thread1Thread1of1ForFork3_~#t2~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre9| Int) (|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (<= c_~s_6~0 (select (select (let ((.cse0 (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_159| (store (select |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_159|) |thread1Thread1of1ForFork3_~#t2~0.offset| |thread1Thread1of1ForFork3_#t~pre9|)))) (store .cse0 |v_thread1Thread1of1ForFork3_~#t3~0.base_157| (store (select .cse0 |v_thread1Thread1of1ForFork3_~#t3~0.base_157|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|))) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((|thread1Thread1of1ForFork3_~#t2~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre9| Int) (|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (< (select (select (let ((.cse1 (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_159| (store (select |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_159|) |thread1Thread1of1ForFork3_~#t2~0.offset| |thread1Thread1of1ForFork3_#t~pre9|)))) (store .cse1 |v_thread1Thread1of1ForFork3_~#t3~0.base_157| (store (select .cse1 |v_thread1Thread1of1ForFork3_~#t3~0.base_157|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|))) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1)))))) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= 1 c_~i_7~0) (<= .cse2 c_~s_6~0) (<= c_~s_6~0 .cse2) (<= (+ c_~X_0~0.offset (* 4 c_~i_7~0)) 4) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0))) is different from false [2021-11-20 23:22:08,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:22:08,752 INFO L93 Difference]: Finished difference Result 2122 states and 7727 transitions. [2021-11-20 23:22:08,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 23:22:08,752 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-20 23:22:08,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:22:08,758 INFO L225 Difference]: With dead ends: 2122 [2021-11-20 23:22:08,758 INFO L226 Difference]: Without dead ends: 2079 [2021-11-20 23:22:08,758 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 59 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=118, Invalid=494, Unknown=4, NotChecked=196, Total=812 [2021-11-20 23:22:08,759 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 177 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 391 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-20 23:22:08,759 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 216 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 860 Invalid, 0 Unknown, 391 Unchecked, 0.7s Time] [2021-11-20 23:22:08,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states. [2021-11-20 23:22:08,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 1375. [2021-11-20 23:22:08,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 1374 states have (on average 3.601164483260553) internal successors, (4948), 1374 states have internal predecessors, (4948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:22:08,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 4948 transitions. [2021-11-20 23:22:08,802 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 4948 transitions. Word has length 36 [2021-11-20 23:22:08,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:22:08,803 INFO L470 AbstractCegarLoop]: Abstraction has 1375 states and 4948 transitions. [2021-11-20 23:22:08,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:22:08,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 4948 transitions. [2021-11-20 23:22:08,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 23:22:08,806 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:22:08,806 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:22:08,838 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2021-11-20 23:22:09,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2021-11-20 23:22:09,019 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:22:09,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:22:09,020 INFO L85 PathProgramCache]: Analyzing trace with hash 944857500, now seen corresponding path program 15 times [2021-11-20 23:22:09,020 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:22:09,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029747141] [2021-11-20 23:22:09,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:22:09,020 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:22:09,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:22:09,466 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:22:09,466 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:22:09,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029747141] [2021-11-20 23:22:09,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029747141] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:22:09,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946352831] [2021-11-20 23:22:09,467 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:22:09,467 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:22:09,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:22:09,469 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:22:09,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2021-11-20 23:22:09,591 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:22:09,592 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:22:09,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 61 conjunts are in the unsatisfiable core [2021-11-20 23:22:09,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:22:09,631 INFO L354 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-11-20 23:22:09,631 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 16 [2021-11-20 23:22:09,960 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:22:09,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 15 [2021-11-20 23:22:10,105 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-20 23:22:10,106 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 30 treesize of output 29 [2021-11-20 23:22:10,227 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-20 23:22:10,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2021-11-20 23:22:10,277 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 10 [2021-11-20 23:22:10,400 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:22:10,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:22:12,604 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (< (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| (store (select |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|)) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (+ c_~s_6~0 1))) (forall ((|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (<= c_~s_6~0 (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| (store (select |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|)) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)))))) is different from false [2021-11-20 23:22:20,759 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:22:20,760 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 577 treesize of output 424 [2021-11-20 23:22:23,849 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:22:23,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946352831] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:22:23,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1007162393] [2021-11-20 23:22:23,849 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:22:23,851 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:22:23,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2021-11-20 23:22:23,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055933257] [2021-11-20 23:22:23,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:22:23,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-20 23:22:23,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:22:23,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-20 23:22:23,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=471, Unknown=3, NotChecked=44, Total=600 [2021-11-20 23:22:23,854 INFO L87 Difference]: Start difference. First operand 1375 states and 4948 transitions. Second operand has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:22:25,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:22:25,059 INFO L93 Difference]: Finished difference Result 2049 states and 7339 transitions. [2021-11-20 23:22:25,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-20 23:22:25,060 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-20 23:22:25,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:22:25,065 INFO L225 Difference]: With dead ends: 2049 [2021-11-20 23:22:25,065 INFO L226 Difference]: Without dead ends: 2006 [2021-11-20 23:22:25,065 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=148, Invalid=783, Unknown=3, NotChecked=58, Total=992 [2021-11-20 23:22:25,066 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 212 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 331 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-20 23:22:25,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 298 Invalid, 1477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1119 Invalid, 0 Unknown, 331 Unchecked, 0.9s Time] [2021-11-20 23:22:25,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2006 states. [2021-11-20 23:22:25,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2006 to 1339. [2021-11-20 23:22:25,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1339 states, 1338 states have (on average 3.6121076233183858) internal successors, (4833), 1338 states have internal predecessors, (4833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:22:25,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 4833 transitions. [2021-11-20 23:22:25,103 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 4833 transitions. Word has length 36 [2021-11-20 23:22:25,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:22:25,103 INFO L470 AbstractCegarLoop]: Abstraction has 1339 states and 4833 transitions. [2021-11-20 23:22:25,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:22:25,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 4833 transitions. [2021-11-20 23:22:25,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 23:22:25,107 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:22:25,107 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:22:25,134 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2021-11-20 23:22:25,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2021-11-20 23:22:25,308 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:22:25,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:22:25,309 INFO L85 PathProgramCache]: Analyzing trace with hash -622085046, now seen corresponding path program 24 times [2021-11-20 23:22:25,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:22:25,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759964461] [2021-11-20 23:22:25,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:22:25,310 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:22:25,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:22:25,712 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:22:25,713 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:22:25,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759964461] [2021-11-20 23:22:25,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759964461] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:22:25,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475949926] [2021-11-20 23:22:25,713 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:22:25,713 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:22:25,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:22:25,715 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:22:25,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2021-11-20 23:22:25,852 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:22:25,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:22:25,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 61 conjunts are in the unsatisfiable core [2021-11-20 23:22:25,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:22:25,889 INFO L354 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-11-20 23:22:25,890 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 16 [2021-11-20 23:22:26,175 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 23:22:26,175 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2021-11-20 23:22:26,279 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-20 23:22:26,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 29 treesize of output 28 [2021-11-20 23:22:26,415 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-20 23:22:26,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2021-11-20 23:22:26,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 10 [2021-11-20 23:22:26,599 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:22:26,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:22:36,563 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|thread1Thread1of1ForFork3_~#t2~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre9| Int) (|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (<= c_~s_6~0 (+ c_~s_2~0 (select (select (let ((.cse0 (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| (store (select |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base|) |thread1Thread1of1ForFork3_~#t2~0.offset| |thread1Thread1of1ForFork3_#t~pre9|)))) (store .cse0 |c_thread1Thread1of1ForFork3_~#t3~0.base| (store (select .cse0 |c_thread1Thread1of1ForFork3_~#t3~0.base|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|))) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))))) (forall ((|thread1Thread1of1ForFork3_~#t2~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre9| Int) (|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (< (+ c_~s_2~0 (select (select (let ((.cse1 (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| (store (select |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base|) |thread1Thread1of1ForFork3_~#t2~0.offset| |thread1Thread1of1ForFork3_#t~pre9|)))) (store .cse1 |c_thread1Thread1of1ForFork3_~#t3~0.base| (store (select .cse1 |c_thread1Thread1of1ForFork3_~#t3~0.base|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|))) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (+ c_~s_6~0 1)))) is different from false [2021-11-20 23:22:36,909 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:22:36,909 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 276 treesize of output 207 [2021-11-20 23:22:39,758 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:22:39,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475949926] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:22:39,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1524658979] [2021-11-20 23:22:39,758 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:22:39,760 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:22:39,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2021-11-20 23:22:39,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588088894] [2021-11-20 23:22:39,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:22:39,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-20 23:22:39,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:22:39,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-20 23:22:39,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=476, Unknown=5, NotChecked=44, Total=600 [2021-11-20 23:22:39,762 INFO L87 Difference]: Start difference. First operand 1339 states and 4833 transitions. Second operand has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:22:46,499 WARN L227 SmtUtils]: Spent 6.41s on a formula simplification. DAG size of input: 68 DAG size of output: 59 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 23:22:47,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:22:47,877 INFO L93 Difference]: Finished difference Result 2459 states and 8777 transitions. [2021-11-20 23:22:47,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-20 23:22:47,878 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-20 23:22:47,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:22:47,883 INFO L225 Difference]: With dead ends: 2459 [2021-11-20 23:22:47,883 INFO L226 Difference]: Without dead ends: 2420 [2021-11-20 23:22:47,884 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=359, Invalid=1532, Unknown=5, NotChecked=84, Total=1980 [2021-11-20 23:22:47,885 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 430 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 1599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 399 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-20 23:22:47,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [430 Valid, 228 Invalid, 1599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1151 Invalid, 0 Unknown, 399 Unchecked, 0.9s Time] [2021-11-20 23:22:47,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2021-11-20 23:22:47,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 1327. [2021-11-20 23:22:47,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1327 states, 1326 states have (on average 3.6161387631975868) internal successors, (4795), 1326 states have internal predecessors, (4795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:22:47,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 4795 transitions. [2021-11-20 23:22:47,923 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 4795 transitions. Word has length 36 [2021-11-20 23:22:47,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:22:47,923 INFO L470 AbstractCegarLoop]: Abstraction has 1327 states and 4795 transitions. [2021-11-20 23:22:47,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:22:47,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 4795 transitions. [2021-11-20 23:22:47,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 23:22:47,927 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:22:47,927 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:22:47,953 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2021-11-20 23:22:48,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2021-11-20 23:22:48,128 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:22:48,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:22:48,128 INFO L85 PathProgramCache]: Analyzing trace with hash -600971336, now seen corresponding path program 25 times [2021-11-20 23:22:48,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:22:48,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714288548] [2021-11-20 23:22:48,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:22:48,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:22:48,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:22:48,549 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:22:48,549 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:22:48,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714288548] [2021-11-20 23:22:48,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714288548] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:22:48,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630329835] [2021-11-20 23:22:48,549 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:22:48,550 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:22:48,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:22:48,551 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:22:48,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2021-11-20 23:22:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:22:48,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 60 conjunts are in the unsatisfiable core [2021-11-20 23:22:48,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:22:48,846 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-20 23:22:48,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2021-11-20 23:22:48,967 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-20 23:22:48,967 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2021-11-20 23:22:49,010 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-20 23:22:49,107 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:22:49,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:23:11,187 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_166| Int) (|v_thread1Thread1of1ForFork3_~#t2~0.base_168| Int)) (or (<= |v_thread1Thread1of1ForFork3_~#t2~0.base_168| |c_#StackHeapBarrier|) (and (forall ((|thread1Thread1of1ForFork3_~#t2~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre9| Int) (|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (<= c_~s_6~0 (select (select (let ((.cse0 (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_168| (store (select |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_168|) |thread1Thread1of1ForFork3_~#t2~0.offset| |thread1Thread1of1ForFork3_#t~pre9|)))) (store .cse0 |v_thread1Thread1of1ForFork3_~#t3~0.base_166| (store (select .cse0 |v_thread1Thread1of1ForFork3_~#t3~0.base_166|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|))) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((|thread1Thread1of1ForFork3_~#t2~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre9| Int) (|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (< (select (select (let ((.cse1 (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_168| (store (select |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_168|) |thread1Thread1of1ForFork3_~#t2~0.offset| |thread1Thread1of1ForFork3_#t~pre9|)))) (store .cse1 |v_thread1Thread1of1ForFork3_~#t3~0.base_166| (store (select .cse1 |v_thread1Thread1of1ForFork3_~#t3~0.base_166|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|))) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1)))) (<= |v_thread1Thread1of1ForFork3_~#t3~0.base_166| |c_#StackHeapBarrier|))) is different from false [2021-11-20 23:23:11,344 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:23:11,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 268 treesize of output 199 [2021-11-20 23:23:11,633 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:23:11,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630329835] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:23:11,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1951712992] [2021-11-20 23:23:11,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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:23:11,634 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:23:11,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2021-11-20 23:23:11,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724298974] [2021-11-20 23:23:11,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:23:11,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-20 23:23:11,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:23:11,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-20 23:23:11,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=376, Unknown=9, NotChecked=40, Total=506 [2021-11-20 23:23:11,635 INFO L87 Difference]: Start difference. First operand 1327 states and 4795 transitions. Second operand has 23 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 22 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:23:13,829 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4))))) (and (= c_~X_0~0.offset 0) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= 1 c_~i_7~0) (<= .cse0 c_~s_6~0) (<= c_~s_6~0 .cse0) (<= (+ c_~X_0~0.offset (* 4 c_~i_7~0)) 4) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_166| Int) (|v_thread1Thread1of1ForFork3_~#t2~0.base_168| Int)) (or (<= |v_thread1Thread1of1ForFork3_~#t2~0.base_168| |c_#StackHeapBarrier|) (and (forall ((|thread1Thread1of1ForFork3_~#t2~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre9| Int) (|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (<= c_~s_6~0 (select (select (let ((.cse1 (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_168| (store (select |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_168|) |thread1Thread1of1ForFork3_~#t2~0.offset| |thread1Thread1of1ForFork3_#t~pre9|)))) (store .cse1 |v_thread1Thread1of1ForFork3_~#t3~0.base_166| (store (select .cse1 |v_thread1Thread1of1ForFork3_~#t3~0.base_166|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|))) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((|thread1Thread1of1ForFork3_~#t2~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre9| Int) (|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (< (select (select (let ((.cse2 (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_168| (store (select |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_168|) |thread1Thread1of1ForFork3_~#t2~0.offset| |thread1Thread1of1ForFork3_#t~pre9|)))) (store .cse2 |v_thread1Thread1of1ForFork3_~#t3~0.base_166| (store (select .cse2 |v_thread1Thread1of1ForFork3_~#t3~0.base_166|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|))) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1)))) (<= |v_thread1Thread1of1ForFork3_~#t3~0.base_166| |c_#StackHeapBarrier|))))) is different from false [2021-11-20 23:23:15,905 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4))))) (and (= c_~X_0~0.offset 0) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= 1 c_~i_7~0) (<= .cse0 c_~s_6~0) (<= c_~s_6~0 .cse0) (<= (+ c_~X_0~0.offset (* 4 c_~i_7~0)) 4) (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_166| Int) (|v_thread1Thread1of1ForFork3_~#t2~0.base_168| Int)) (or (<= |v_thread1Thread1of1ForFork3_~#t2~0.base_168| |c_#StackHeapBarrier|) (and (forall ((|thread1Thread1of1ForFork3_~#t2~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre9| Int) (|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (<= c_~s_6~0 (select (select (let ((.cse1 (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_168| (store (select |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_168|) |thread1Thread1of1ForFork3_~#t2~0.offset| |thread1Thread1of1ForFork3_#t~pre9|)))) (store .cse1 |v_thread1Thread1of1ForFork3_~#t3~0.base_166| (store (select .cse1 |v_thread1Thread1of1ForFork3_~#t3~0.base_166|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|))) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((|thread1Thread1of1ForFork3_~#t2~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre9| Int) (|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (< (select (select (let ((.cse2 (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_168| (store (select |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_168|) |thread1Thread1of1ForFork3_~#t2~0.offset| |thread1Thread1of1ForFork3_#t~pre9|)))) (store .cse2 |v_thread1Thread1of1ForFork3_~#t3~0.base_166| (store (select .cse2 |v_thread1Thread1of1ForFork3_~#t3~0.base_166|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|))) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1)))) (<= |v_thread1Thread1of1ForFork3_~#t3~0.base_166| |c_#StackHeapBarrier|))))) is different from false [2021-11-20 23:23:16,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:23:16,600 INFO L93 Difference]: Finished difference Result 1960 states and 7229 transitions. [2021-11-20 23:23:16,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-20 23:23:16,601 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 22 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-20 23:23:16,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:23:16,605 INFO L225 Difference]: With dead ends: 1960 [2021-11-20 23:23:16,605 INFO L226 Difference]: Without dead ends: 1939 [2021-11-20 23:23:16,606 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 56 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 26.2s TimeCoverageRelationStatistics Valid=122, Invalid=529, Unknown=11, NotChecked=150, Total=812 [2021-11-20 23:23:16,607 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 132 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 1537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 357 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-20 23:23:16,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 307 Invalid, 1537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1172 Invalid, 0 Unknown, 357 Unchecked, 0.8s Time] [2021-11-20 23:23:16,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2021-11-20 23:23:16,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1311. [2021-11-20 23:23:16,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1311 states, 1310 states have (on average 3.6297709923664123) internal successors, (4755), 1310 states have internal predecessors, (4755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:23:16,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 4755 transitions. [2021-11-20 23:23:16,641 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 4755 transitions. Word has length 36 [2021-11-20 23:23:16,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:23:16,641 INFO L470 AbstractCegarLoop]: Abstraction has 1311 states and 4755 transitions. [2021-11-20 23:23:16,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 22 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:23:16,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 4755 transitions. [2021-11-20 23:23:16,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-20 23:23:16,645 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:23:16,645 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:23:16,670 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2021-11-20 23:23:16,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2021-11-20 23:23:16,846 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:23:16,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:23:16,846 INFO L85 PathProgramCache]: Analyzing trace with hash -258059794, now seen corresponding path program 26 times [2021-11-20 23:23:16,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:23:16,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134766185] [2021-11-20 23:23:16,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:23:16,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:23:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:23:16,935 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:23:16,935 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:23:16,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134766185] [2021-11-20 23:23:16,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134766185] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:23:16,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875125691] [2021-11-20 23:23:16,936 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:23:16,936 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:23:16,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:23:16,946 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:23:16,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2021-11-20 23:23:17,089 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-20 23:23:17,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:23:17,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-20 23:23:17,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:23:17,309 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:23:17,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:23:17,485 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:23:17,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875125691] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:23:17,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [886910023] [2021-11-20 23:23:17,486 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:23:17,486 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:23:17,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2021-11-20 23:23:17,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738898245] [2021-11-20 23:23:17,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:23:17,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-20 23:23:17,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:23:17,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-20 23:23:17,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2021-11-20 23:23:17,488 INFO L87 Difference]: Start difference. First operand 1311 states and 4755 transitions. Second operand has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 16 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:23:17,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:23:17,961 INFO L93 Difference]: Finished difference Result 2645 states and 9199 transitions. [2021-11-20 23:23:17,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 23:23:17,961 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 16 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-20 23:23:17,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:23:17,969 INFO L225 Difference]: With dead ends: 2645 [2021-11-20 23:23:17,969 INFO L226 Difference]: Without dead ends: 2379 [2021-11-20 23:23:17,970 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2021-11-20 23:23:17,970 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 276 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 23:23:17,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 165 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-20 23:23:17,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2379 states. [2021-11-20 23:23:18,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2379 to 1979. [2021-11-20 23:23:18,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1979 states, 1978 states have (on average 3.5278058645096055) internal successors, (6978), 1978 states have internal predecessors, (6978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:23:18,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1979 states to 1979 states and 6978 transitions. [2021-11-20 23:23:18,018 INFO L78 Accepts]: Start accepts. Automaton has 1979 states and 6978 transitions. Word has length 37 [2021-11-20 23:23:18,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:23:18,019 INFO L470 AbstractCegarLoop]: Abstraction has 1979 states and 6978 transitions. [2021-11-20 23:23:18,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 16 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:23:18,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1979 states and 6978 transitions. [2021-11-20 23:23:18,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-20 23:23:18,023 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:23:18,023 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:23:18,050 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2021-11-20 23:23:18,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:23:18,224 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:23:18,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:23:18,224 INFO L85 PathProgramCache]: Analyzing trace with hash -173256605, now seen corresponding path program 27 times [2021-11-20 23:23:18,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:23:18,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156216239] [2021-11-20 23:23:18,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:23:18,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:23:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:23:18,338 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:23:18,338 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:23:18,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156216239] [2021-11-20 23:23:18,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156216239] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:23:18,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911699472] [2021-11-20 23:23:18,339 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:23:18,339 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:23:18,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:23:18,343 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:23:18,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2021-11-20 23:23:18,471 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:23:18,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:23:18,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-20 23:23:18,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:23:18,677 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:23:18,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:23:18,883 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:23:18,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911699472] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:23:18,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1422854443] [2021-11-20 23:23:18,883 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:23:18,884 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:23:18,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2021-11-20 23:23:18,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047788322] [2021-11-20 23:23:18,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:23:18,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-20 23:23:18,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:23:18,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-20 23:23:18,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2021-11-20 23:23:18,885 INFO L87 Difference]: Start difference. First operand 1979 states and 6978 transitions. Second operand has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 16 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:23:19,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:23:19,206 INFO L93 Difference]: Finished difference Result 1601 states and 5526 transitions. [2021-11-20 23:23:19,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 23:23:19,207 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 16 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-11-20 23:23:19,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:23:19,210 INFO L225 Difference]: With dead ends: 1601 [2021-11-20 23:23:19,210 INFO L226 Difference]: Without dead ends: 1312 [2021-11-20 23:23:19,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2021-11-20 23:23:19,211 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 162 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:23:19,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 108 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-20 23:23:19,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2021-11-20 23:23:19,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1312. [2021-11-20 23:23:19,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 1311 states have (on average 3.627765064836003) internal successors, (4756), 1311 states have internal predecessors, (4756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:23:19,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 4756 transitions. [2021-11-20 23:23:19,238 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 4756 transitions. Word has length 38 [2021-11-20 23:23:19,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:23:19,238 INFO L470 AbstractCegarLoop]: Abstraction has 1312 states and 4756 transitions. [2021-11-20 23:23:19,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 16 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:23:19,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 4756 transitions. [2021-11-20 23:23:19,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-20 23:23:19,242 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:23:19,242 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:23:19,272 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2021-11-20 23:23:19,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2021-11-20 23:23:19,447 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:23:19,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:23:19,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1693065051, now seen corresponding path program 28 times [2021-11-20 23:23:19,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:23:19,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997643820] [2021-11-20 23:23:19,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:23:19,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:23:19,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:23:19,562 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:23:19,562 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:23:19,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997643820] [2021-11-20 23:23:19,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997643820] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:23:19,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168701499] [2021-11-20 23:23:19,563 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:23:19,563 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:23:19,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:23:19,565 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:23:19,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2021-11-20 23:23:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:23:19,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-20 23:23:19,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:23:19,932 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:23:19,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:23:20,116 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:23:20,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168701499] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:23:20,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1559117708] [2021-11-20 23:23:20,117 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:23:20,117 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:23:20,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2021-11-20 23:23:20,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296756242] [2021-11-20 23:23:20,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:23:20,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-20 23:23:20,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:23:20,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-20 23:23:20,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2021-11-20 23:23:20,119 INFO L87 Difference]: Start difference. First operand 1312 states and 4756 transitions. Second operand has 17 states, 17 states have (on average 4.0) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:23:20,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:23:20,363 INFO L93 Difference]: Finished difference Result 1192 states and 4285 transitions. [2021-11-20 23:23:20,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 23:23:20,364 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.0) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-11-20 23:23:20,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:23:20,368 INFO L225 Difference]: With dead ends: 1192 [2021-11-20 23:23:20,368 INFO L226 Difference]: Without dead ends: 1192 [2021-11-20 23:23:20,368 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2021-11-20 23:23:20,368 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 217 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:23:20,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 51 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 23:23:20,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2021-11-20 23:23:20,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1084. [2021-11-20 23:23:20,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1083 states have (on average 3.616805170821791) internal successors, (3917), 1083 states have internal predecessors, (3917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:23:20,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 3917 transitions. [2021-11-20 23:23:20,438 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 3917 transitions. Word has length 38 [2021-11-20 23:23:20,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:23:20,439 INFO L470 AbstractCegarLoop]: Abstraction has 1084 states and 3917 transitions. [2021-11-20 23:23:20,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.0) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:23:20,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 3917 transitions. [2021-11-20 23:23:20,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-20 23:23:20,443 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:23:20,444 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:23:20,487 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2021-11-20 23:23:20,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2021-11-20 23:23:20,661 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:23:20,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:23:20,662 INFO L85 PathProgramCache]: Analyzing trace with hash 182071446, now seen corresponding path program 29 times [2021-11-20 23:23:20,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:23:20,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054412329] [2021-11-20 23:23:20,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:23:20,662 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:23:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:23:20,766 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-20 23:23:20,767 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:23:20,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054412329] [2021-11-20 23:23:20,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054412329] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:23:20,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882653048] [2021-11-20 23:23:20,768 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:23:20,768 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:23:20,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:23:20,769 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:23:20,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2021-11-20 23:23:20,924 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-20 23:23:20,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:23:20,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-20 23:23:20,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:23:21,096 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-20 23:23:21,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:23:21,249 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-20 23:23:21,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882653048] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:23:21,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [219509741] [2021-11-20 23:23:21,250 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:23:21,250 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:23:21,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2021-11-20 23:23:21,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629489707] [2021-11-20 23:23:21,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:23:21,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-20 23:23:21,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:23:21,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-20 23:23:21,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2021-11-20 23:23:21,252 INFO L87 Difference]: Start difference. First operand 1084 states and 3917 transitions. Second operand has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 16 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:23:21,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:23:21,480 INFO L93 Difference]: Finished difference Result 1258 states and 4318 transitions. [2021-11-20 23:23:21,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 23:23:21,480 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 16 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-11-20 23:23:21,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:23:21,483 INFO L225 Difference]: With dead ends: 1258 [2021-11-20 23:23:21,483 INFO L226 Difference]: Without dead ends: 1258 [2021-11-20 23:23:21,484 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2021-11-20 23:23:21,484 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 198 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:23:21,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 73 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 23:23:21,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2021-11-20 23:23:21,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1178. [2021-11-20 23:23:21,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1178 states, 1177 states have (on average 3.4766355140186915) internal successors, (4092), 1177 states have internal predecessors, (4092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:23:21,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 4092 transitions. [2021-11-20 23:23:21,521 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 4092 transitions. Word has length 39 [2021-11-20 23:23:21,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:23:21,522 INFO L470 AbstractCegarLoop]: Abstraction has 1178 states and 4092 transitions. [2021-11-20 23:23:21,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 16 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:23:21,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 4092 transitions. [2021-11-20 23:23:21,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-20 23:23:21,527 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:23:21,527 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:23:21,570 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2021-11-20 23:23:21,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:23:21,743 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:23:21,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:23:21,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1347573864, now seen corresponding path program 30 times [2021-11-20 23:23:21,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:23:21,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589137553] [2021-11-20 23:23:21,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:23:21,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:23:21,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:23:22,529 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:23:22,530 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:23:22,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589137553] [2021-11-20 23:23:22,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589137553] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:23:22,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600746049] [2021-11-20 23:23:22,530 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:23:22,530 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:23:22,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:23:22,531 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:23:22,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2021-11-20 23:23:22,641 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:23:22,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:23:22,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 90 conjunts are in the unsatisfiable core [2021-11-20 23:23:22,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:23:23,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:23,153 INFO L354 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2021-11-20 23:23:23,153 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2021-11-20 23:23:23,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:23,338 INFO L354 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2021-11-20 23:23:23,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2021-11-20 23:23:23,496 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:23:23,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 16 [2021-11-20 23:23:23,532 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-20 23:23:23,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:23:37,178 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~#t4~0#1.offset| Int) (|ULTIMATE.start_main_#t~pre30#1| Int) (|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (< (let ((.cse0 (select (let ((.cse1 (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| (store (select |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|)))) (store .cse1 |c_ULTIMATE.start_main_~#t4~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#t4~0#1.base|) |ULTIMATE.start_main_~#t4~0#1.offset| |ULTIMATE.start_main_#t~pre30#1|))) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 8)) (select .cse0 (+ c_~X_0~0.offset 4)))) (+ c_~s_2~0 1))) (forall ((|ULTIMATE.start_main_~#t4~0#1.offset| Int) (|ULTIMATE.start_main_#t~pre30#1| Int) (|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (<= c_~s_2~0 (let ((.cse2 (select (let ((.cse3 (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| (store (select |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|)))) (store .cse3 |c_ULTIMATE.start_main_~#t4~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#t4~0#1.base|) |ULTIMATE.start_main_~#t4~0#1.offset| |ULTIMATE.start_main_#t~pre30#1|))) c_~X_0~0.base))) (+ (select .cse2 (+ c_~X_0~0.offset 8)) (select .cse2 (+ c_~X_0~0.offset 4))))))) is different from false [2021-11-20 23:24:06,841 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~#t4~0#1.offset| Int) (|ULTIMATE.start_main_#t~pre30#1| Int) (|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (< (let ((.cse0 (select (let ((.cse1 (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| (store (select |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|)))) (store .cse1 |c_ULTIMATE.start_main_~#t4~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#t4~0#1.base|) |ULTIMATE.start_main_~#t4~0#1.offset| |ULTIMATE.start_main_#t~pre30#1|))) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 8)) (select .cse0 (+ c_~X_0~0.offset 4)))) (+ c_~s_2~0 c_~t_4~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) 1))) (forall ((|ULTIMATE.start_main_~#t4~0#1.offset| Int) (|ULTIMATE.start_main_#t~pre30#1| Int) (|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (<= (+ c_~s_2~0 c_~t_4~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (let ((.cse2 (select (let ((.cse3 (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| (store (select |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|)))) (store .cse3 |c_ULTIMATE.start_main_~#t4~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#t4~0#1.base|) |ULTIMATE.start_main_~#t4~0#1.offset| |ULTIMATE.start_main_#t~pre30#1|))) c_~X_0~0.base))) (+ (select .cse2 (+ c_~X_0~0.offset 8)) (select .cse2 (+ c_~X_0~0.offset 4))))))) is different from false [2021-11-20 23:24:06,895 INFO L354 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2021-11-20 23:24:06,895 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 794 treesize of output 500 [2021-11-20 23:24:07,311 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:24:07,312 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:24:07,332 INFO L354 Elim1Store]: treesize reduction 82, result has 9.9 percent of original size [2021-11-20 23:24:07,333 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 18 [2021-11-20 23:24:07,557 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 3 not checked. [2021-11-20 23:24:07,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600746049] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:24:07,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [104455749] [2021-11-20 23:24:07,557 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:24:07,558 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:24:07,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 36 [2021-11-20 23:24:07,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032734423] [2021-11-20 23:24:07,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:24:07,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-11-20 23:24:07,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:24:07,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-11-20 23:24:07,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1131, Unknown=16, NotChecked=138, Total=1406 [2021-11-20 23:24:07,560 INFO L87 Difference]: Start difference. First operand 1178 states and 4092 transitions. Second operand has 38 states, 37 states have (on average 2.8378378378378377) internal successors, (105), 37 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:24:18,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:24:18,996 INFO L93 Difference]: Finished difference Result 4385 states and 15055 transitions. [2021-11-20 23:24:18,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-11-20 23:24:18,996 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.8378378378378377) internal successors, (105), 37 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-20 23:24:18,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:24:19,006 INFO L225 Difference]: With dead ends: 4385 [2021-11-20 23:24:19,006 INFO L226 Difference]: Without dead ends: 4239 [2021-11-20 23:24:19,007 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 63 SyntacticMatches, 6 SemanticMatches, 76 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 1368 ImplicationChecksByTransitivity, 52.1s TimeCoverageRelationStatistics Valid=588, Invalid=5103, Unknown=17, NotChecked=298, Total=6006 [2021-11-20 23:24:19,008 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 724 mSDsluCounter, 2679 mSDsCounter, 0 mSdLazyCounter, 3864 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 5149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 3864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1177 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:24:19,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [724 Valid, 877 Invalid, 5149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 3864 Invalid, 0 Unknown, 1177 Unchecked, 3.1s Time] [2021-11-20 23:24:19,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4239 states. [2021-11-20 23:24:19,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4239 to 1484. [2021-11-20 23:24:19,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1484 states, 1483 states have (on average 3.406608226567768) internal successors, (5052), 1483 states have internal predecessors, (5052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:24:19,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 5052 transitions. [2021-11-20 23:24:19,087 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 5052 transitions. Word has length 40 [2021-11-20 23:24:19,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:24:19,088 INFO L470 AbstractCegarLoop]: Abstraction has 1484 states and 5052 transitions. [2021-11-20 23:24:19,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.8378378378378377) internal successors, (105), 37 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:24:19,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 5052 transitions. [2021-11-20 23:24:19,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-20 23:24:19,092 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:24:19,092 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:24:19,136 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2021-11-20 23:24:19,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:24:19,319 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:24:19,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:24:19,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1380218962, now seen corresponding path program 31 times [2021-11-20 23:24:19,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:24:19,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996331169] [2021-11-20 23:24:19,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:24:19,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:24:19,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:24:20,146 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:24:20,146 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:24:20,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996331169] [2021-11-20 23:24:20,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996331169] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:24:20,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635145893] [2021-11-20 23:24:20,147 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:24:20,147 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:24:20,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:24:20,149 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:24:20,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2021-11-20 23:24:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:24:20,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 90 conjunts are in the unsatisfiable core [2021-11-20 23:24:20,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:24:20,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:20,766 INFO L354 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2021-11-20 23:24:20,766 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2021-11-20 23:24:20,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:20,899 INFO L354 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2021-11-20 23:24:20,899 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2021-11-20 23:24:21,107 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:24:21,108 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2021-11-20 23:24:21,214 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-20 23:24:21,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:24:23,215 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~#t4~0#1.offset| Int) (|ULTIMATE.start_main_#t~pre30#1| Int)) (<= c_~s_2~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base|) |ULTIMATE.start_main_~#t4~0#1.offset| |ULTIMATE.start_main_#t~pre30#1|)) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 8)) (select .cse0 (+ c_~X_0~0.offset 4)))))) (forall ((|ULTIMATE.start_main_~#t4~0#1.offset| Int) (|ULTIMATE.start_main_#t~pre30#1| Int)) (< (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base|) |ULTIMATE.start_main_~#t4~0#1.offset| |ULTIMATE.start_main_#t~pre30#1|)) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset 8)) (select .cse1 (+ c_~X_0~0.offset 4)))) (+ c_~s_2~0 1)))) is different from false [2021-11-20 23:24:48,990 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~#t4~0#1.offset| Int) (|ULTIMATE.start_main_#t~pre30#1| Int) (|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (< (let ((.cse0 (select (let ((.cse1 (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| (store (select |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|)))) (store .cse1 |c_ULTIMATE.start_main_~#t4~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#t4~0#1.base|) |ULTIMATE.start_main_~#t4~0#1.offset| |ULTIMATE.start_main_#t~pre30#1|))) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 8)) (select .cse0 (+ c_~X_0~0.offset 4)))) (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) 1))) (forall ((|ULTIMATE.start_main_~#t4~0#1.offset| Int) (|ULTIMATE.start_main_#t~pre30#1| Int) (|thread1Thread1of1ForFork3_~#t3~0.offset| Int) (|thread1Thread1of1ForFork3_#t~pre11| Int)) (<= (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (let ((.cse2 (select (let ((.cse3 (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| (store (select |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base|) |thread1Thread1of1ForFork3_~#t3~0.offset| |thread1Thread1of1ForFork3_#t~pre11|)))) (store .cse3 |c_ULTIMATE.start_main_~#t4~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#t4~0#1.base|) |ULTIMATE.start_main_~#t4~0#1.offset| |ULTIMATE.start_main_#t~pre30#1|))) c_~X_0~0.base))) (+ (select .cse2 (+ c_~X_0~0.offset 8)) (select .cse2 (+ c_~X_0~0.offset 4))))))) is different from false [2021-11-20 23:24:57,185 INFO L354 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2021-11-20 23:24:57,186 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 794 treesize of output 500 [2021-11-20 23:24:59,411 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:24:59,412 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:24:59,429 INFO L354 Elim1Store]: treesize reduction 82, result has 9.9 percent of original size [2021-11-20 23:24:59,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 18 [2021-11-20 23:24:59,651 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2021-11-20 23:24:59,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635145893] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:24:59,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [10123173] [2021-11-20 23:24:59,651 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:24:59,652 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:24:59,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 37 [2021-11-20 23:24:59,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897591305] [2021-11-20 23:24:59,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:24:59,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-20 23:24:59,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:24:59,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-20 23:24:59,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1208, Unknown=10, NotChecked=142, Total=1482 [2021-11-20 23:24:59,654 INFO L87 Difference]: Start difference. First operand 1484 states and 5052 transitions. Second operand has 39 states, 38 states have (on average 2.473684210526316) internal successors, (94), 38 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:25:06,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:25:06,452 INFO L93 Difference]: Finished difference Result 5711 states and 19505 transitions. [2021-11-20 23:25:06,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-11-20 23:25:06,452 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.473684210526316) internal successors, (94), 38 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-20 23:25:06,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:25:06,464 INFO L225 Difference]: With dead ends: 5711 [2021-11-20 23:25:06,465 INFO L226 Difference]: Without dead ends: 5629 [2021-11-20 23:25:06,465 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 56 SyntacticMatches, 19 SemanticMatches, 78 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 1755 ImplicationChecksByTransitivity, 40.3s TimeCoverageRelationStatistics Valid=701, Invalid=5303, Unknown=10, NotChecked=306, Total=6320 [2021-11-20 23:25:06,466 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 778 mSDsluCounter, 2357 mSDsCounter, 0 mSdLazyCounter, 3703 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 5572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 3703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1737 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2021-11-20 23:25:06,466 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [778 Valid, 711 Invalid, 5572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 3703 Invalid, 0 Unknown, 1737 Unchecked, 3.0s Time] [2021-11-20 23:25:06,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5629 states. [2021-11-20 23:25:06,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5629 to 1722. [2021-11-20 23:25:06,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1722 states, 1721 states have (on average 3.432887855897734) internal successors, (5908), 1721 states have internal predecessors, (5908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:25:06,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 5908 transitions. [2021-11-20 23:25:06,596 INFO L78 Accepts]: Start accepts. Automaton has 1722 states and 5908 transitions. Word has length 40 [2021-11-20 23:25:06,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:25:06,596 INFO L470 AbstractCegarLoop]: Abstraction has 1722 states and 5908 transitions. [2021-11-20 23:25:06,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.473684210526316) internal successors, (94), 38 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:25:06,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 5908 transitions. [2021-11-20 23:25:06,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-20 23:25:06,601 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:25:06,602 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:25:06,631 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2021-11-20 23:25:06,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,51 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:25:06,811 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 23:25:06,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:25:06,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1118448612, now seen corresponding path program 32 times [2021-11-20 23:25:06,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:25:06,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578561531] [2021-11-20 23:25:06,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:25:06,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:25:06,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:25:07,612 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:25:07,612 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:25:07,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578561531] [2021-11-20 23:25:07,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578561531] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:25:07,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646728888] [2021-11-20 23:25:07,613 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:25:07,613 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:25:07,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:25:07,614 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:25:07,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10f9256-459e-496a-a837-7297114cb454/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2021-11-20 23:25:07,741 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-20 23:25:07,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:25:07,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 105 conjunts are in the unsatisfiable core [2021-11-20 23:25:07,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:25:07,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-20 23:25:08,259 INFO L354 Elim1Store]: treesize reduction 80, result has 20.8 percent of original size [2021-11-20 23:25:08,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2021-11-20 23:25:08,461 INFO L354 Elim1Store]: treesize reduction 80, result has 20.8 percent of original size [2021-11-20 23:25:08,461 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 37 [2021-11-20 23:25:08,813 INFO L354 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2021-11-20 23:25:08,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 20 [2021-11-20 23:25:08,915 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:25:08,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:25:28,685 INFO L354 Elim1Store]: treesize reduction 43, result has 51.1 percent of original size [2021-11-20 23:25:28,687 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 2398 treesize of output 1482