./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7 --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 6990ac65798f2c5a95ce01b01bd39640075d7bea37e69dff3da0d3d7c4b56ab2 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 19:01:50,136 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 19:01:50,138 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 19:01:50,185 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 19:01:50,186 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 19:01:50,187 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 19:01:50,189 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 19:01:50,191 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 19:01:50,194 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 19:01:50,195 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 19:01:50,196 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 19:01:50,198 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 19:01:50,198 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 19:01:50,199 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 19:01:50,201 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 19:01:50,203 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 19:01:50,207 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 19:01:50,208 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 19:01:50,211 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 19:01:50,213 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 19:01:50,215 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 19:01:50,225 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 19:01:50,226 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 19:01:50,227 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 19:01:50,234 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 19:01:50,234 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 19:01:50,235 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 19:01:50,236 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 19:01:50,236 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 19:01:50,238 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 19:01:50,238 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 19:01:50,243 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 19:01:50,245 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 19:01:50,246 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 19:01:50,248 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 19:01:50,249 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 19:01:50,249 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 19:01:50,250 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 19:01:50,250 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 19:01:50,251 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 19:01:50,252 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 19:01:50,253 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-25 19:01:50,297 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 19:01:50,297 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 19:01:50,297 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 19:01:50,298 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 19:01:50,298 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 19:01:50,299 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 19:01:50,299 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 19:01:50,299 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 19:01:50,299 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 19:01:50,300 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-25 19:01:50,300 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 19:01:50,300 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 19:01:50,300 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-25 19:01:50,301 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-25 19:01:50,301 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 19:01:50,301 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-25 19:01:50,301 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-25 19:01:50,302 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-25 19:01:50,302 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 19:01:50,303 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 19:01:50,303 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 19:01:50,303 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 19:01:50,303 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 19:01:50,304 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-25 19:01:50,304 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 19:01:50,304 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-25 19:01:50,304 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 19:01:50,305 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-25 19:01:50,305 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 19:01:50,305 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-25 19:01:50,305 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 19:01:50,305 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 19:01:50,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 19:01:50,306 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 19:01:50,306 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 19:01:50,306 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-25 19:01:50,307 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-25 19:01:50,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-25 19:01:50,307 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-25 19:01:50,307 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 19:01:50,308 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 19:01:50,308 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_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/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_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7 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 -> 6990ac65798f2c5a95ce01b01bd39640075d7bea37e69dff3da0d3d7c4b56ab2 [2021-11-25 19:01:50,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 19:01:50,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 19:01:50,634 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 19:01:50,635 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 19:01:50,635 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 19:01:50,637 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c [2021-11-25 19:01:50,721 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/data/06a5d4298/eaaa8887182e4a0282646954cc581015/FLAGbc0173d59 [2021-11-25 19:01:51,189 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 19:01:51,198 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c [2021-11-25 19:01:51,206 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/data/06a5d4298/eaaa8887182e4a0282646954cc581015/FLAGbc0173d59 [2021-11-25 19:01:51,563 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/data/06a5d4298/eaaa8887182e4a0282646954cc581015 [2021-11-25 19:01:51,566 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 19:01:51,569 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 19:01:51,572 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 19:01:51,572 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 19:01:51,576 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 19:01:51,577 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 07:01:51" (1/1) ... [2021-11-25 19:01:51,579 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33c6bae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:01:51, skipping insertion in model container [2021-11-25 19:01:51,580 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 07:01:51" (1/1) ... [2021-11-25 19:01:51,587 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 19:01:51,619 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 19:01:51,839 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_c82ae31f-31d0-4845-8e3f-5212fcdb4428/sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c[3412,3425] [2021-11-25 19:01:51,850 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 19:01:51,858 INFO L203 MainTranslator]: Completed pre-run [2021-11-25 19:01:51,884 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_c82ae31f-31d0-4845-8e3f-5212fcdb4428/sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c[3412,3425] [2021-11-25 19:01:51,888 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 19:01:51,900 INFO L208 MainTranslator]: Completed translation [2021-11-25 19:01:51,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:01:51 WrapperNode [2021-11-25 19:01:51,901 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 19:01:51,902 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-25 19:01:51,902 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-25 19:01:51,902 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-25 19:01:51,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:01:51" (1/1) ... [2021-11-25 19:01:51,941 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:01:51" (1/1) ... [2021-11-25 19:01:51,981 INFO L137 Inliner]: procedures = 25, calls = 55, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 245 [2021-11-25 19:01:51,982 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-25 19:01:51,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-25 19:01:51,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-25 19:01:51,984 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-25 19:01:51,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:01:51" (1/1) ... [2021-11-25 19:01:51,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:01:51" (1/1) ... [2021-11-25 19:01:52,009 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:01:51" (1/1) ... [2021-11-25 19:01:52,012 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:01:51" (1/1) ... [2021-11-25 19:01:52,021 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:01:51" (1/1) ... [2021-11-25 19:01:52,046 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:01:51" (1/1) ... [2021-11-25 19:01:52,048 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:01:51" (1/1) ... [2021-11-25 19:01:52,052 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-25 19:01:52,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-25 19:01:52,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-25 19:01:52,053 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-25 19:01:52,056 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:01:51" (1/1) ... [2021-11-25 19:01:52,073 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 19:01:52,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:01:52,100 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-25 19:01:52,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-25 19:01:52,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-25 19:01:52,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-25 19:01:52,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-25 19:01:52,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-25 19:01:52,152 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-11-25 19:01:52,152 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-11-25 19:01:52,152 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-11-25 19:01:52,152 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-11-25 19:01:52,153 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-11-25 19:01:52,153 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-11-25 19:01:52,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-25 19:01:52,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-11-25 19:01:52,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-11-25 19:01:52,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-25 19:01:52,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-25 19:01:52,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-25 19:01:52,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-25 19:01:52,156 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-25 19:01:52,333 INFO L236 CfgBuilder]: Building ICFG [2021-11-25 19:01:52,335 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-25 19:01:52,664 INFO L277 CfgBuilder]: Performing block encoding [2021-11-25 19:01:52,803 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-25 19:01:52,804 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-11-25 19:01:52,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 07:01:52 BoogieIcfgContainer [2021-11-25 19:01:52,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-25 19:01:52,811 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-25 19:01:52,811 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-25 19:01:52,815 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-25 19:01:52,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 07:01:51" (1/3) ... [2021-11-25 19:01:52,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48889b1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 07:01:52, skipping insertion in model container [2021-11-25 19:01:52,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:01:51" (2/3) ... [2021-11-25 19:01:52,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48889b1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 07:01:52, skipping insertion in model container [2021-11-25 19:01:52,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 07:01:52" (3/3) ... [2021-11-25 19:01:52,822 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-queue-add-3.wvr.c [2021-11-25 19:01:52,828 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-25 19:01:52,830 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-25 19:01:52,830 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-25 19:01:52,830 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-25 19:01:52,889 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,889 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,890 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,890 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,890 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,891 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,891 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,892 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,892 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,892 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,893 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,893 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,893 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,893 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,894 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,894 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,898 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,898 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,899 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,899 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,899 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,899 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,899 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,900 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,900 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,900 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,900 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,900 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,901 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,901 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,901 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,901 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,901 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,901 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,902 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,902 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,902 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,902 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,903 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,903 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,903 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,903 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,903 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,904 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,904 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,904 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,904 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,905 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,905 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,905 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,906 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,906 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,906 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,906 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,906 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,907 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,907 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,907 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,907 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,907 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,908 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,908 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,908 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,908 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,908 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,909 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,909 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,909 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,909 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,910 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,911 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,913 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,914 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,914 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,914 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,916 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,916 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,916 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,916 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,917 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,922 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,922 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,922 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,922 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,923 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,923 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,923 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,923 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,923 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,924 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,929 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,929 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,929 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,929 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,929 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,930 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,930 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,931 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,931 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,931 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,932 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,932 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,932 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,932 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,932 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,933 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,933 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,933 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,935 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,935 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:01:52,939 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-11-25 19:01:52,993 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-25 19:01:53,004 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-25 19:01:53,004 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-11-25 19:01:53,025 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-25 19:01:53,041 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 203 places, 211 transitions, 446 flow [2021-11-25 19:01:53,047 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 203 places, 211 transitions, 446 flow [2021-11-25 19:01:53,049 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 203 places, 211 transitions, 446 flow [2021-11-25 19:01:53,168 INFO L129 PetriNetUnfolder]: 18/208 cut-off events. [2021-11-25 19:01:53,168 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-11-25 19:01:53,174 INFO L84 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 208 events. 18/208 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 111 event pairs, 0 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 170. Up to 3 conditions per place. [2021-11-25 19:01:53,178 INFO L116 LiptonReduction]: Number of co-enabled transitions 1456 [2021-11-25 19:02:01,270 INFO L131 LiptonReduction]: Checked pairs total: 2256 [2021-11-25 19:02:01,270 INFO L133 LiptonReduction]: Total number of compositions: 218 [2021-11-25 19:02:01,280 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 32 transitions, 88 flow [2021-11-25 19:02:01,300 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 138 states, 137 states have (on average 3.343065693430657) internal successors, (458), 137 states have internal predecessors, (458), 0 states have call successors, (0), 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-25 19:02:01,303 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 137 states have (on average 3.343065693430657) internal successors, (458), 137 states have internal predecessors, (458), 0 states have call successors, (0), 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-25 19:02:01,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-25 19:02:01,313 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:02:01,314 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] [2021-11-25 19:02:01,314 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 19:02:01,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:02:01,319 INFO L85 PathProgramCache]: Analyzing trace with hash 2122418462, now seen corresponding path program 1 times [2021-11-25 19:02:01,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:02:01,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173843713] [2021-11-25 19:02:01,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:02:01,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:02:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:02:01,644 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-25 19:02:01,645 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:02:01,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173843713] [2021-11-25 19:02:01,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173843713] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:02:01,647 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:02:01,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 19:02:01,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071780267] [2021-11-25 19:02:01,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:02:01,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-25 19:02:01,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:02:01,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-25 19:02:01,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-25 19:02:01,681 INFO L87 Difference]: Start difference. First operand has 138 states, 137 states have (on average 3.343065693430657) internal successors, (458), 137 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:02:01,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:02:01,755 INFO L93 Difference]: Finished difference Result 138 states and 428 transitions. [2021-11-25 19:02:01,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-25 19:02:01,757 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-25 19:02:01,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:02:01,772 INFO L225 Difference]: With dead ends: 138 [2021-11-25 19:02:01,773 INFO L226 Difference]: Without dead ends: 138 [2021-11-25 19:02:01,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-25 19:02:01,778 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:02:01,780 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 19:02:01,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-11-25 19:02:01,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2021-11-25 19:02:01,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 3.124087591240876) internal successors, (428), 137 states have internal predecessors, (428), 0 states have call successors, (0), 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-25 19:02:01,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 428 transitions. [2021-11-25 19:02:01,852 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 428 transitions. Word has length 21 [2021-11-25 19:02:01,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:02:01,853 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 428 transitions. [2021-11-25 19:02:01,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:02:01,854 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 428 transitions. [2021-11-25 19:02:01,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-25 19:02:01,862 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:02:01,862 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] [2021-11-25 19:02:01,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-25 19:02:01,863 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 19:02:01,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:02:01,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1367950956, now seen corresponding path program 1 times [2021-11-25 19:02:01,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:02:01,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643547441] [2021-11-25 19:02:01,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:02:01,867 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:02:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:02:02,029 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-25 19:02:02,029 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:02:02,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643547441] [2021-11-25 19:02:02,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643547441] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:02:02,030 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:02:02,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 19:02:02,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377194317] [2021-11-25 19:02:02,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:02:02,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:02:02,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:02:02,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:02:02,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:02:02,033 INFO L87 Difference]: Start difference. First operand 138 states and 428 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:02:02,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:02:02,145 INFO L93 Difference]: Finished difference Result 215 states and 600 transitions. [2021-11-25 19:02:02,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 19:02:02,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-25 19:02:02,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:02:02,148 INFO L225 Difference]: With dead ends: 215 [2021-11-25 19:02:02,148 INFO L226 Difference]: Without dead ends: 139 [2021-11-25 19:02:02,148 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-25 19:02:02,150 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 31 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:02:02,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 12 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:02:02,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-11-25 19:02:02,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2021-11-25 19:02:02,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 3.108695652173913) internal successors, (429), 138 states have internal predecessors, (429), 0 states have call successors, (0), 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-25 19:02:02,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 429 transitions. [2021-11-25 19:02:02,162 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 429 transitions. Word has length 22 [2021-11-25 19:02:02,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:02:02,162 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 429 transitions. [2021-11-25 19:02:02,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:02:02,163 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 429 transitions. [2021-11-25 19:02:02,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 19:02:02,164 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:02:02,164 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] [2021-11-25 19:02:02,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-25 19:02:02,165 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 19:02:02,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:02:02,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1734255192, now seen corresponding path program 1 times [2021-11-25 19:02:02,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:02:02,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847719306] [2021-11-25 19:02:02,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:02:02,166 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:02:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:02:02,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 19:02:02,262 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:02:02,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847719306] [2021-11-25 19:02:02,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847719306] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:02:02,263 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:02:02,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 19:02:02,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700483102] [2021-11-25 19:02:02,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:02:02,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:02:02,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:02:02,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:02:02,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:02:02,265 INFO L87 Difference]: Start difference. First operand 139 states and 429 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:02:02,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:02:02,340 INFO L93 Difference]: Finished difference Result 213 states and 614 transitions. [2021-11-25 19:02:02,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 19:02:02,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 19:02:02,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:02:02,343 INFO L225 Difference]: With dead ends: 213 [2021-11-25 19:02:02,343 INFO L226 Difference]: Without dead ends: 140 [2021-11-25 19:02:02,343 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-25 19:02:02,344 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 22 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:02:02,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 9 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:02:02,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-11-25 19:02:02,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2021-11-25 19:02:02,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 3.093525179856115) internal successors, (430), 139 states have internal predecessors, (430), 0 states have call successors, (0), 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-25 19:02:02,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 430 transitions. [2021-11-25 19:02:02,355 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 430 transitions. Word has length 23 [2021-11-25 19:02:02,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:02:02,355 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 430 transitions. [2021-11-25 19:02:02,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:02:02,355 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 430 transitions. [2021-11-25 19:02:02,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-25 19:02:02,356 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:02:02,356 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] [2021-11-25 19:02:02,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-25 19:02:02,357 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 19:02:02,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:02:02,357 INFO L85 PathProgramCache]: Analyzing trace with hash 934511800, now seen corresponding path program 1 times [2021-11-25 19:02:02,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:02:02,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977839295] [2021-11-25 19:02:02,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:02:02,358 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:02:02,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:02:02,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 19:02:02,640 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:02:02,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977839295] [2021-11-25 19:02:02,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977839295] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:02:02,640 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:02:02,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 19:02:02,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917616330] [2021-11-25 19:02:02,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:02:02,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-25 19:02:02,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:02:02,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-25 19:02:02,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-25 19:02:02,642 INFO L87 Difference]: Start difference. First operand 140 states and 430 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:02:02,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:02:02,778 INFO L93 Difference]: Finished difference Result 309 states and 965 transitions. [2021-11-25 19:02:02,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 19:02:02,778 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-25 19:02:02,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:02:02,781 INFO L225 Difference]: With dead ends: 309 [2021-11-25 19:02:02,781 INFO L226 Difference]: Without dead ends: 290 [2021-11-25 19:02:02,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-11-25 19:02:02,782 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 78 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:02:02,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 16 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:02:02,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-11-25 19:02:02,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 236. [2021-11-25 19:02:02,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 3.1404255319148935) internal successors, (738), 235 states have internal predecessors, (738), 0 states have call successors, (0), 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-25 19:02:02,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 738 transitions. [2021-11-25 19:02:02,798 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 738 transitions. Word has length 24 [2021-11-25 19:02:02,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:02:02,799 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 738 transitions. [2021-11-25 19:02:02,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:02:02,799 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 738 transitions. [2021-11-25 19:02:02,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:02:02,800 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:02:02,801 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] [2021-11-25 19:02:02,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-25 19:02:02,801 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 19:02:02,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:02:02,802 INFO L85 PathProgramCache]: Analyzing trace with hash 2134547335, now seen corresponding path program 1 times [2021-11-25 19:02:02,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:02:02,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660786156] [2021-11-25 19:02:02,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:02:02,802 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:02:02,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:02:02,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 19:02:02,885 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:02:02,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660786156] [2021-11-25 19:02:02,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660786156] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:02:02,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335891367] [2021-11-25 19:02:02,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:02:02,886 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:02:02,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:02:02,888 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:02:02,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-25 19:02:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:02:03,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-25 19:02:03,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:02:03,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 19:02:03,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:02:03,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 19:02:03,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335891367] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:02:03,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1397449156] [2021-11-25 19:02:03,341 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-25 19:02:03,344 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:02:03,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2021-11-25 19:02:03,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911915827] [2021-11-25 19:02:03,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:02:03,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-25 19:02:03,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:02:03,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-25 19:02:03,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-11-25 19:02:03,346 INFO L87 Difference]: Start difference. First operand 236 states and 738 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 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-25 19:02:03,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:02:03,519 INFO L93 Difference]: Finished difference Result 470 states and 1408 transitions. [2021-11-25 19:02:03,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 19:02:03,520 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 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 25 [2021-11-25 19:02:03,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:02:03,522 INFO L225 Difference]: With dead ends: 470 [2021-11-25 19:02:03,523 INFO L226 Difference]: Without dead ends: 368 [2021-11-25 19:02:03,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-11-25 19:02:03,524 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 82 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:02:03,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 30 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:02:03,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2021-11-25 19:02:03,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 284. [2021-11-25 19:02:03,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 3.067137809187279) internal successors, (868), 283 states have internal predecessors, (868), 0 states have call successors, (0), 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-25 19:02:03,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 868 transitions. [2021-11-25 19:02:03,540 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 868 transitions. Word has length 25 [2021-11-25 19:02:03,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:02:03,540 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 868 transitions. [2021-11-25 19:02:03,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 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-25 19:02:03,540 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 868 transitions. [2021-11-25 19:02:03,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:02:03,542 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:02:03,542 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] [2021-11-25 19:02:03,582 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-25 19:02:03,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:02:03,763 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 19:02:03,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:02:03,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1117050351, now seen corresponding path program 1 times [2021-11-25 19:02:03,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:02:03,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397405277] [2021-11-25 19:02:03,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:02:03,764 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:02:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:02:03,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 19:02:03,900 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:02:03,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397405277] [2021-11-25 19:02:03,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397405277] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:02:03,902 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:02:03,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 19:02:03,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609426280] [2021-11-25 19:02:03,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:02:03,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 19:02:03,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:02:03,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 19:02:03,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:02:03,908 INFO L87 Difference]: Start difference. First operand 284 states and 868 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:02:03,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:02:03,978 INFO L93 Difference]: Finished difference Result 552 states and 1662 transitions. [2021-11-25 19:02:03,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 19:02:03,979 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-25 19:02:03,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:02:03,984 INFO L225 Difference]: With dead ends: 552 [2021-11-25 19:02:03,984 INFO L226 Difference]: Without dead ends: 528 [2021-11-25 19:02:03,984 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:02:03,987 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 40 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:02:03,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 9 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:02:03,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2021-11-25 19:02:04,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 448. [2021-11-25 19:02:04,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 3.161073825503356) internal successors, (1413), 447 states have internal predecessors, (1413), 0 states have call successors, (0), 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-25 19:02:04,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 1413 transitions. [2021-11-25 19:02:04,009 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 1413 transitions. Word has length 25 [2021-11-25 19:02:04,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:02:04,010 INFO L470 AbstractCegarLoop]: Abstraction has 448 states and 1413 transitions. [2021-11-25 19:02:04,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:02:04,010 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 1413 transitions. [2021-11-25 19:02:04,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-25 19:02:04,013 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:02:04,013 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] [2021-11-25 19:02:04,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-25 19:02:04,014 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 19:02:04,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:02:04,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1218015501, now seen corresponding path program 2 times [2021-11-25 19:02:04,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:02:04,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387863385] [2021-11-25 19:02:04,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:02:04,015 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:02:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:02:04,569 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 19:02:04,573 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:02:04,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387863385] [2021-11-25 19:02:04,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387863385] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:02:04,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108344244] [2021-11-25 19:02:04,573 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:02:04,574 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:02:04,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:02:04,574 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:02:04,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-25 19:02:04,711 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 19:02:04,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:02:04,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-25 19:02:04,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:02:05,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:02:05,014 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 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 19:02:05,067 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 23 treesize of output 7 [2021-11-25 19:02:05,098 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 19:02:05,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:02:05,166 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_229 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_229) c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) 0))) is different from false [2021-11-25 19:02:05,252 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:02:05,252 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 45 treesize of output 45 [2021-11-25 19:02:05,259 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 24 treesize of output 18 [2021-11-25 19:02:05,551 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 19:02:05,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108344244] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:02:05,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [447690050] [2021-11-25 19:02:05,551 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-25 19:02:05,552 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:02:05,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2021-11-25 19:02:05,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509636579] [2021-11-25 19:02:05,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:02:05,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-25 19:02:05,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:02:05,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-25 19:02:05,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=510, Unknown=1, NotChecked=46, Total=650 [2021-11-25 19:02:05,554 INFO L87 Difference]: Start difference. First operand 448 states and 1413 transitions. Second operand has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:02:07,372 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_229 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_229) c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) 0))) (not (= |c_thread2Thread1of1ForFork2_~j~0#1| 0))) is different from false [2021-11-25 19:02:07,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:02:07,638 INFO L93 Difference]: Finished difference Result 1300 states and 4105 transitions. [2021-11-25 19:02:07,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-25 19:02:07,639 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-25 19:02:07,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:02:07,652 INFO L225 Difference]: With dead ends: 1300 [2021-11-25 19:02:07,652 INFO L226 Difference]: Without dead ends: 1300 [2021-11-25 19:02:07,653 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=313, Invalid=1664, Unknown=11, NotChecked=174, Total=2162 [2021-11-25 19:02:07,654 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 219 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 468 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-25 19:02:07,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 204 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1024 Invalid, 0 Unknown, 468 Unchecked, 0.8s Time] [2021-11-25 19:02:07,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2021-11-25 19:02:07,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 561. [2021-11-25 19:02:07,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 560 states have (on average 3.1160714285714284) internal successors, (1745), 560 states have internal predecessors, (1745), 0 states have call successors, (0), 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-25 19:02:07,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 1745 transitions. [2021-11-25 19:02:07,688 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 1745 transitions. Word has length 26 [2021-11-25 19:02:07,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:02:07,690 INFO L470 AbstractCegarLoop]: Abstraction has 561 states and 1745 transitions. [2021-11-25 19:02:07,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:02:07,690 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 1745 transitions. [2021-11-25 19:02:07,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-25 19:02:07,693 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:02:07,694 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] [2021-11-25 19:02:07,730 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-25 19:02:07,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:02:07,915 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 19:02:07,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:02:07,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1055685383, now seen corresponding path program 3 times [2021-11-25 19:02:07,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:02:07,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536859008] [2021-11-25 19:02:07,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:02:07,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:02:07,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:02:08,390 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 19:02:08,390 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:02:08,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536859008] [2021-11-25 19:02:08,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536859008] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:02:08,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350595923] [2021-11-25 19:02:08,391 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 19:02:08,391 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:02:08,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:02:08,392 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:02:08,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-25 19:02:08,520 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 19:02:08,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:02:08,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 40 conjunts are in the unsatisfiable core [2021-11-25 19:02:08,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:02:08,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:02:08,813 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 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 19:02:08,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:02:08,868 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 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 19:02:08,900 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 23 treesize of output 7 [2021-11-25 19:02:08,936 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 19:02:08,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:02:09,200 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:02:09,200 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 85 treesize of output 85 [2021-11-25 19:02:09,207 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 64 treesize of output 52 [2021-11-25 19:02:09,211 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 52 treesize of output 46 [2021-11-25 19:02:09,571 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-25 19:02:09,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350595923] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:02:09,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1573168025] [2021-11-25 19:02:09,572 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-25 19:02:09,578 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:02:09,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 26 [2021-11-25 19:02:09,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091648467] [2021-11-25 19:02:09,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:02:09,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-25 19:02:09,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:02:09,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-25 19:02:09,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=609, Unknown=3, NotChecked=0, Total=702 [2021-11-25 19:02:09,581 INFO L87 Difference]: Start difference. First operand 561 states and 1745 transitions. Second operand has 27 states, 27 states have (on average 2.111111111111111) internal successors, (57), 26 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-25 19:02:12,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:02:12,719 INFO L93 Difference]: Finished difference Result 1867 states and 5526 transitions. [2021-11-25 19:02:12,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-11-25 19:02:12,719 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.111111111111111) internal successors, (57), 26 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 26 [2021-11-25 19:02:12,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:02:12,732 INFO L225 Difference]: With dead ends: 1867 [2021-11-25 19:02:12,732 INFO L226 Difference]: Without dead ends: 1542 [2021-11-25 19:02:12,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 38 SyntacticMatches, 15 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 1201 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=477, Invalid=3269, Unknown=36, NotChecked=0, Total=3782 [2021-11-25 19:02:12,735 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 381 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 1675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 365 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:02:12,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [381 Valid, 233 Invalid, 1675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1216 Invalid, 0 Unknown, 365 Unchecked, 1.0s Time] [2021-11-25 19:02:12,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2021-11-25 19:02:12,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 815. [2021-11-25 19:02:12,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 814 states have (on average 3.0343980343980346) internal successors, (2470), 814 states have internal predecessors, (2470), 0 states have call successors, (0), 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-25 19:02:12,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 2470 transitions. [2021-11-25 19:02:12,777 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 2470 transitions. Word has length 26 [2021-11-25 19:02:12,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:02:12,777 INFO L470 AbstractCegarLoop]: Abstraction has 815 states and 2470 transitions. [2021-11-25 19:02:12,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.111111111111111) internal successors, (57), 26 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-25 19:02:12,778 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 2470 transitions. [2021-11-25 19:02:12,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:02:12,780 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:02:12,781 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] [2021-11-25 19:02:12,815 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-25 19:02:12,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:02:12,999 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 19:02:12,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:02:12,999 INFO L85 PathProgramCache]: Analyzing trace with hash 872768513, now seen corresponding path program 4 times [2021-11-25 19:02:12,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:02:12,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522893663] [2021-11-25 19:02:13,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:02:13,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:02:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:02:13,622 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 19:02:13,623 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:02:13,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522893663] [2021-11-25 19:02:13,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522893663] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:02:13,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458839733] [2021-11-25 19:02:13,623 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 19:02:13,623 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:02:13,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:02:13,624 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:02:13,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-25 19:02:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:02:13,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 32 conjunts are in the unsatisfiable core [2021-11-25 19:02:13,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:02:14,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:02:14,026 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 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 19:02:14,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:02:14,077 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 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 19:02:14,101 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 23 treesize of output 7 [2021-11-25 19:02:14,127 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-25 19:02:14,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:02:14,179 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_349 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_349) c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) 0))) is different from false [2021-11-25 19:02:14,210 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_348 (Array Int Int)) (v_ArrVal_349 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_348) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_349) c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) 0))) is different from false [2021-11-25 19:02:14,227 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:02:14,228 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 167 treesize of output 159 [2021-11-25 19:02:14,233 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 138 treesize of output 126 [2021-11-25 19:02:14,238 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 126 treesize of output 102 [2021-11-25 19:02:14,469 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 1 not checked. [2021-11-25 19:02:14,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458839733] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:02:14,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [677209452] [2021-11-25 19:02:14,470 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-25 19:02:14,471 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:02:14,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 28 [2021-11-25 19:02:14,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930195400] [2021-11-25 19:02:14,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:02:14,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-25 19:02:14,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:02:14,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-25 19:02:14,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=619, Unknown=2, NotChecked=102, Total=812 [2021-11-25 19:02:14,473 INFO L87 Difference]: Start difference. First operand 815 states and 2470 transitions. Second operand has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 28 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-25 19:02:15,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:02:15,949 INFO L93 Difference]: Finished difference Result 965 states and 2850 transitions. [2021-11-25 19:02:15,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-25 19:02:15,950 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 28 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 27 [2021-11-25 19:02:15,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:02:15,959 INFO L225 Difference]: With dead ends: 965 [2021-11-25 19:02:15,959 INFO L226 Difference]: Without dead ends: 965 [2021-11-25 19:02:15,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 37 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=228, Invalid=1500, Unknown=2, NotChecked=162, Total=1892 [2021-11-25 19:02:15,962 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 196 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 1394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 195 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-25 19:02:15,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 179 Invalid, 1394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1136 Invalid, 0 Unknown, 195 Unchecked, 0.7s Time] [2021-11-25 19:02:15,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2021-11-25 19:02:15,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 569. [2021-11-25 19:02:15,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 568 states have (on average 2.9559859154929575) internal successors, (1679), 568 states have internal predecessors, (1679), 0 states have call successors, (0), 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-25 19:02:15,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 1679 transitions. [2021-11-25 19:02:15,995 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 1679 transitions. Word has length 27 [2021-11-25 19:02:15,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:02:15,996 INFO L470 AbstractCegarLoop]: Abstraction has 569 states and 1679 transitions. [2021-11-25 19:02:15,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 28 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-25 19:02:15,996 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 1679 transitions. [2021-11-25 19:02:15,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:02:15,998 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:02:15,998 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] [2021-11-25 19:02:16,035 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-25 19:02:16,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-11-25 19:02:16,215 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 19:02:16,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:02:16,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1528672945, now seen corresponding path program 1 times [2021-11-25 19:02:16,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:02:16,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112655224] [2021-11-25 19:02:16,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:02:16,215 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:02:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:02:16,271 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 19:02:16,271 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:02:16,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112655224] [2021-11-25 19:02:16,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112655224] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:02:16,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276481816] [2021-11-25 19:02:16,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:02:16,272 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:02:16,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:02:16,275 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:02:16,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-25 19:02:16,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:02:16,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-25 19:02:16,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:02:16,500 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 19:02:16,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:02:16,587 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 19:02:16,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276481816] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:02:16,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [146094719] [2021-11-25 19:02:16,587 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-25 19:02:16,588 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:02:16,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2021-11-25 19:02:16,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703063096] [2021-11-25 19:02:16,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:02:16,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-25 19:02:16,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:02:16,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-25 19:02:16,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-11-25 19:02:16,589 INFO L87 Difference]: Start difference. First operand 569 states and 1679 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:02:16,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:02:16,705 INFO L93 Difference]: Finished difference Result 695 states and 1874 transitions. [2021-11-25 19:02:16,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 19:02:16,705 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-25 19:02:16,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:02:16,707 INFO L225 Difference]: With dead ends: 695 [2021-11-25 19:02:16,707 INFO L226 Difference]: Without dead ends: 335 [2021-11-25 19:02:16,708 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-11-25 19:02:16,708 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 71 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:02:16,708 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 14 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:02:16,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2021-11-25 19:02:16,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 332. [2021-11-25 19:02:16,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 2.8459214501510575) internal successors, (942), 331 states have internal predecessors, (942), 0 states have call successors, (0), 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-25 19:02:16,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 942 transitions. [2021-11-25 19:02:16,716 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 942 transitions. Word has length 27 [2021-11-25 19:02:16,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:02:16,717 INFO L470 AbstractCegarLoop]: Abstraction has 332 states and 942 transitions. [2021-11-25 19:02:16,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:02:16,717 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 942 transitions. [2021-11-25 19:02:16,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-25 19:02:16,718 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:02:16,718 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] [2021-11-25 19:02:16,747 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-11-25 19:02:16,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-25 19:02:16,947 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 19:02:16,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:02:16,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1202049473, now seen corresponding path program 2 times [2021-11-25 19:02:16,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:02:16,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286778792] [2021-11-25 19:02:16,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:02:16,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:02:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:02:17,044 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-25 19:02:17,044 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:02:17,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286778792] [2021-11-25 19:02:17,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286778792] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:02:17,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467771249] [2021-11-25 19:02:17,045 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:02:17,045 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:02:17,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:02:17,046 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:02:17,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-25 19:02:17,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 19:02:17,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:02:17,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-25 19:02:17,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:02:17,240 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-25 19:02:17,241 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:02:17,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467771249] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:02:17,241 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 19:02:17,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2021-11-25 19:02:17,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80375081] [2021-11-25 19:02:17,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:02:17,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:02:17,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:02:17,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:02:17,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-25 19:02:17,247 INFO L87 Difference]: Start difference. First operand 332 states and 942 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:02:17,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:02:17,321 INFO L93 Difference]: Finished difference Result 570 states and 1709 transitions. [2021-11-25 19:02:17,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 19:02:17,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-25 19:02:17,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:02:17,326 INFO L225 Difference]: With dead ends: 570 [2021-11-25 19:02:17,326 INFO L226 Difference]: Without dead ends: 474 [2021-11-25 19:02:17,327 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-25 19:02:17,327 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 48 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:02:17,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 7 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:02:17,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-11-25 19:02:17,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 398. [2021-11-25 19:02:17,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 397 states have (on average 3.2947103274559195) internal successors, (1308), 397 states have internal predecessors, (1308), 0 states have call successors, (0), 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-25 19:02:17,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1308 transitions. [2021-11-25 19:02:17,347 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1308 transitions. Word has length 28 [2021-11-25 19:02:17,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:02:17,347 INFO L470 AbstractCegarLoop]: Abstraction has 398 states and 1308 transitions. [2021-11-25 19:02:17,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:02:17,348 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1308 transitions. [2021-11-25 19:02:17,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-25 19:02:17,349 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:02:17,349 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] [2021-11-25 19:02:17,386 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-25 19:02:17,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:02:17,563 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 19:02:17,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:02:17,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1014917963, now seen corresponding path program 1 times [2021-11-25 19:02:17,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:02:17,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963355700] [2021-11-25 19:02:17,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:02:17,563 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:02:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:02:18,118 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-25 19:02:18,118 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:02:18,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963355700] [2021-11-25 19:02:18,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963355700] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:02:18,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975228994] [2021-11-25 19:02:18,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:02:18,118 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:02:18,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:02:18,120 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:02:18,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-25 19:02:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:02:18,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 35 conjunts are in the unsatisfiable core [2021-11-25 19:02:18,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:02:18,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:02:18,646 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 0 case distinctions, treesize of input 19 treesize of output 21 [2021-11-25 19:02:18,739 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-25 19:02:18,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:02:18,782 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_518 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_518) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4)))))) is different from false [2021-11-25 19:02:18,854 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:02:18,854 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 44 treesize of output 44 [2021-11-25 19:02:18,859 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 24 treesize of output 18 [2021-11-25 19:02:19,266 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-25 19:02:19,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975228994] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:02:19,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1621127098] [2021-11-25 19:02:19,267 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java: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-25 19:02:19,267 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:02:19,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25 [2021-11-25 19:02:19,268 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632880560] [2021-11-25 19:02:19,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:02:19,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-25 19:02:19,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:02:19,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-25 19:02:19,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=506, Unknown=2, NotChecked=46, Total=650 [2021-11-25 19:02:19,269 INFO L87 Difference]: Start difference. First operand 398 states and 1308 transitions. Second operand has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 25 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-25 19:02:21,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:02:21,060 INFO L93 Difference]: Finished difference Result 1711 states and 5698 transitions. [2021-11-25 19:02:21,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-25 19:02:21,060 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 25 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 29 [2021-11-25 19:02:21,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:02:21,074 INFO L225 Difference]: With dead ends: 1711 [2021-11-25 19:02:21,075 INFO L226 Difference]: Without dead ends: 1711 [2021-11-25 19:02:21,076 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=319, Invalid=1488, Unknown=3, NotChecked=82, Total=1892 [2021-11-25 19:02:21,076 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 454 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 1536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 481 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-25 19:02:21,077 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [454 Valid, 85 Invalid, 1536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 905 Invalid, 0 Unknown, 481 Unchecked, 0.8s Time] [2021-11-25 19:02:21,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2021-11-25 19:02:21,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 1087. [2021-11-25 19:02:21,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1087 states, 1086 states have (on average 3.440147329650092) internal successors, (3736), 1086 states have internal predecessors, (3736), 0 states have call successors, (0), 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-25 19:02:21,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 3736 transitions. [2021-11-25 19:02:21,134 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 3736 transitions. Word has length 29 [2021-11-25 19:02:21,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:02:21,135 INFO L470 AbstractCegarLoop]: Abstraction has 1087 states and 3736 transitions. [2021-11-25 19:02:21,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 25 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-25 19:02:21,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 3736 transitions. [2021-11-25 19:02:21,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 19:02:21,139 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:02:21,139 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] [2021-11-25 19:02:21,178 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-25 19:02:21,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:02:21,353 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 19:02:21,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:02:21,353 INFO L85 PathProgramCache]: Analyzing trace with hash 994433039, now seen corresponding path program 2 times [2021-11-25 19:02:21,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:02:21,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235646075] [2021-11-25 19:02:21,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:02:21,354 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:02:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:02:23,086 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:02:23,086 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:02:23,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235646075] [2021-11-25 19:02:23,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235646075] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:02:23,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840565375] [2021-11-25 19:02:23,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:02:23,087 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:02:23,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:02:23,087 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:02:23,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-25 19:02:23,222 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 19:02:23,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:02:23,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-25 19:02:23,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:02:23,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:02:23,422 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 0 case distinctions, treesize of input 19 treesize of output 21 [2021-11-25 19:02:23,462 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-25 19:02:23,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:02:23,485 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_583 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_583) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4)))))) is different from false [2021-11-25 19:02:23,505 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:02:23,506 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 44 treesize of output 44 [2021-11-25 19:02:23,520 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 24 treesize of output 18 [2021-11-25 19:02:23,748 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 1 not checked. [2021-11-25 19:02:23,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840565375] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:02:23,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1437287450] [2021-11-25 19:02:23,749 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-25 19:02:23,750 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:02:23,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6, 6] total 26 [2021-11-25 19:02:23,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348154177] [2021-11-25 19:02:23,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:02:23,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-25 19:02:23,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:02:23,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-25 19:02:23,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=573, Unknown=1, NotChecked=48, Total=702 [2021-11-25 19:02:23,752 INFO L87 Difference]: Start difference. First operand 1087 states and 3736 transitions. Second operand has 27 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 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-25 19:02:25,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:02:25,456 INFO L93 Difference]: Finished difference Result 1711 states and 5818 transitions. [2021-11-25 19:02:25,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-25 19:02:25,456 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 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 30 [2021-11-25 19:02:25,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:02:25,472 INFO L225 Difference]: With dead ends: 1711 [2021-11-25 19:02:25,473 INFO L226 Difference]: Without dead ends: 1711 [2021-11-25 19:02:25,473 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=252, Invalid=1391, Unknown=1, NotChecked=78, Total=1722 [2021-11-25 19:02:25,474 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 189 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-25 19:02:25,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 127 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 909 Invalid, 0 Unknown, 104 Unchecked, 0.7s Time] [2021-11-25 19:02:25,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2021-11-25 19:02:25,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 790. [2021-11-25 19:02:25,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 789 states have (on average 3.510773130544994) internal successors, (2770), 789 states have internal predecessors, (2770), 0 states have call successors, (0), 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-25 19:02:25,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 2770 transitions. [2021-11-25 19:02:25,513 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 2770 transitions. Word has length 30 [2021-11-25 19:02:25,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:02:25,514 INFO L470 AbstractCegarLoop]: Abstraction has 790 states and 2770 transitions. [2021-11-25 19:02:25,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 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-25 19:02:25,514 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 2770 transitions. [2021-11-25 19:02:25,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 19:02:25,517 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:02:25,517 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] [2021-11-25 19:02:25,551 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-11-25 19:02:25,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-25 19:02:25,743 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 19:02:25,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:02:25,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1375540702, now seen corresponding path program 1 times [2021-11-25 19:02:25,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:02:25,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551473109] [2021-11-25 19:02:25,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:02:25,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:02:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:02:27,211 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:02:27,211 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:02:27,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551473109] [2021-11-25 19:02:27,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551473109] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:02:27,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846005375] [2021-11-25 19:02:27,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:02:27,212 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:02:27,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:02:27,212 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:02:27,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-25 19:02:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:02:27,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 65 conjunts are in the unsatisfiable core [2021-11-25 19:02:27,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:02:27,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:02:27,996 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 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 19:02:28,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:02:28,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:02:28,400 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-25 19:02:28,401 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 40 [2021-11-25 19:02:29,326 INFO L354 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2021-11-25 19:02:29,327 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 44 treesize of output 10 [2021-11-25 19:02:29,391 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 19:02:29,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:02:29,512 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_645 (Array Int Int))) (< (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_645) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (+ c_~N~0 1))) (forall ((v_ArrVal_645 (Array Int Int))) (<= c_~N~0 (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_645) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))))))) is different from false [2021-11-25 19:02:29,526 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_645 (Array Int Int))) (< (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_645) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (+ c_~N~0 1))) (forall ((v_ArrVal_645 (Array Int Int))) (<= c_~N~0 (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_645) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))))))) (<= c_~n2~0 c_~q2_back~0) (< c_~q2_back~0 0)) is different from false [2021-11-25 19:02:30,092 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:02:30,092 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 276 treesize of output 328 [2021-11-25 19:02:30,115 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:02:30,116 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 328 treesize of output 340 [2021-11-25 19:02:30,134 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 133 treesize of output 121 [2021-11-25 19:02:30,143 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 121 treesize of output 109 [2021-11-25 19:02:32,343 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2021-11-25 19:02:32,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846005375] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:02:32,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [737892012] [2021-11-25 19:02:32,344 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-25 19:02:32,345 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:02:32,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 14] total 45 [2021-11-25 19:02:32,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633034628] [2021-11-25 19:02:32,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:02:32,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-11-25 19:02:32,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:02:32,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-11-25 19:02:32,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1820, Unknown=5, NotChecked=174, Total=2162 [2021-11-25 19:02:32,347 INFO L87 Difference]: Start difference. First operand 790 states and 2770 transitions. Second operand has 47 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 46 states have internal predecessors, (85), 0 states have call successors, (0), 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-25 19:02:35,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:02:35,374 INFO L93 Difference]: Finished difference Result 1334 states and 4117 transitions. [2021-11-25 19:02:35,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-11-25 19:02:35,374 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 46 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-25 19:02:35,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:02:35,384 INFO L225 Difference]: With dead ends: 1334 [2021-11-25 19:02:35,384 INFO L226 Difference]: Without dead ends: 1326 [2021-11-25 19:02:35,386 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 37 SyntacticMatches, 8 SemanticMatches, 69 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 1015 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=380, Invalid=4315, Unknown=5, NotChecked=270, Total=4970 [2021-11-25 19:02:35,387 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 173 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 1625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 672 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-25 19:02:35,387 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 410 Invalid, 1625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 933 Invalid, 0 Unknown, 672 Unchecked, 0.7s Time] [2021-11-25 19:02:35,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2021-11-25 19:02:35,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 993. [2021-11-25 19:02:35,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 993 states, 992 states have (on average 3.3316532258064515) internal successors, (3305), 992 states have internal predecessors, (3305), 0 states have call successors, (0), 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-25 19:02:35,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 3305 transitions. [2021-11-25 19:02:35,427 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 3305 transitions. Word has length 30 [2021-11-25 19:02:35,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:02:35,427 INFO L470 AbstractCegarLoop]: Abstraction has 993 states and 3305 transitions. [2021-11-25 19:02:35,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 46 states have internal predecessors, (85), 0 states have call successors, (0), 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-25 19:02:35,428 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 3305 transitions. [2021-11-25 19:02:35,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 19:02:35,431 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:02:35,431 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] [2021-11-25 19:02:35,470 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-25 19:02:35,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-25 19:02:35,651 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 19:02:35,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:02:35,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1287090262, now seen corresponding path program 2 times [2021-11-25 19:02:35,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:02:35,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966416154] [2021-11-25 19:02:35,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:02:35,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:02:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:02:37,297 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:02:37,297 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:02:37,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966416154] [2021-11-25 19:02:37,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966416154] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:02:37,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891867984] [2021-11-25 19:02:37,298 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:02:37,298 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:02:37,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:02:37,299 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:02:37,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-25 19:02:37,424 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 19:02:37,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:02:37,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 68 conjunts are in the unsatisfiable core [2021-11-25 19:02:37,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:02:37,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:02:37,474 INFO L354 Elim1Store]: treesize reduction 63, result has 32.3 percent of original size [2021-11-25 19:02:37,474 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 3 case distinctions, treesize of input 15 treesize of output 35 [2021-11-25 19:02:37,659 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-25 19:02:37,659 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 16 treesize of output 18 [2021-11-25 19:02:38,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:02:38,204 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 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 19:02:38,538 INFO L354 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2021-11-25 19:02:38,538 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 37 treesize of output 44 [2021-11-25 19:02:38,558 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 27 treesize of output 15 [2021-11-25 19:02:38,699 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 23 treesize of output 7 [2021-11-25 19:02:38,758 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 19:02:38,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:02:38,839 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_711 (Array Int Int))) (= (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_711) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4)))) c_~N~0)) is different from false [2021-11-25 19:02:38,863 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_711 (Array Int Int)) (~q2~0.offset Int)) (or (not (= (select (select |c_#memory_int| c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_back~0 4))) |c_thread2Thread1of1ForFork2_~j~0#1|)) (= (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_711) c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_front~0 4)))) c_~N~0))) (= |c_thread2Thread1of1ForFork2_~j~0#1| 0)) is different from false [2021-11-25 19:02:38,877 WARN L838 $PredicateComparison]: unable to prove that (or (= 0 (select (select |c_#memory_int| c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4)))) (forall ((v_ArrVal_711 (Array Int Int)) (~q2~0.offset Int)) (or (not (= (select (select |c_#memory_int| c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_back~0 4))) (select (select |c_#memory_int| c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))))) (= (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_711) c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_front~0 4)))) c_~N~0)))) is different from false [2021-11-25 19:02:38,920 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_711 (Array Int Int)) (v_ArrVal_710 (Array Int Int)) (~q2~0.offset Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_710))) (let ((.cse0 (select (select .cse1 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))))) (or (= .cse0 0) (not (= .cse0 (select (select .cse1 c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_back~0 4))))) (= (+ c_~t~0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_711) c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_front~0 4)))) c_~N~0))))) is different from false [2021-11-25 19:02:39,107 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:02:39,108 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 313 treesize of output 357 [2021-11-25 19:02:39,122 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 153 treesize of output 129 [2021-11-25 19:02:39,153 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:02:39,154 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 213 treesize of output 219 [2021-11-25 19:02:43,957 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2021-11-25 19:02:43,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891867984] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:02:43,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1804876071] [2021-11-25 19:02:43,958 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-25 19:02:43,959 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:02:43,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 13] total 43 [2021-11-25 19:02:43,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528682545] [2021-11-25 19:02:43,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:02:43,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-11-25 19:02:43,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:02:43,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-11-25 19:02:43,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1519, Unknown=4, NotChecked=324, Total=1980 [2021-11-25 19:02:43,962 INFO L87 Difference]: Start difference. First operand 993 states and 3305 transitions. Second operand has 45 states, 44 states have (on average 1.9545454545454546) internal successors, (86), 44 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:02:47,216 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_711 (Array Int Int)) (v_ArrVal_710 (Array Int Int)) (~q2~0.offset Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_710))) (let ((.cse0 (select (select .cse1 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))))) (or (= .cse0 0) (not (= .cse0 (select (select .cse1 c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_back~0 4))))) (= (+ c_~t~0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_711) c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_front~0 4)))) c_~N~0))))) (or (<= c_~n2~0 2) (<= c_~q2_front~0 0)) (or (not (= (+ (* 4 c_~q2_front~0) c_~q2~0.offset) 0)) (and (not (= c_~q2~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|)) (= c_~q1~0.offset 0) (let ((.cse2 (select (select |c_#memory_int| c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))))) (or (and (<= c_~N~0 .cse2) (= c_~t~0 0) (<= .cse2 c_~N~0)) (and (= (+ (* 4 c_~q1_front~0) c_~q1~0.offset) 0) (not (= .cse2 (select (select |c_#memory_int| c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))))) (not (= c_~q1~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|))))) (not (= c_~q2~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|)))) (= c_~q2~0.offset 0) (= c_~q2_back~0 c_~q2_front~0)) is different from false [2021-11-25 19:02:51,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:02:51,022 INFO L93 Difference]: Finished difference Result 2128 states and 6438 transitions. [2021-11-25 19:02:51,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-11-25 19:02:51,023 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.9545454545454546) internal successors, (86), 44 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-25 19:02:51,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:02:51,037 INFO L225 Difference]: With dead ends: 2128 [2021-11-25 19:02:51,037 INFO L226 Difference]: Without dead ends: 2072 [2021-11-25 19:02:51,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 39 SyntacticMatches, 10 SemanticMatches, 76 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1247 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=464, Invalid=4792, Unknown=20, NotChecked=730, Total=6006 [2021-11-25 19:02:51,040 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 359 mSDsluCounter, 1502 mSDsCounter, 0 mSdLazyCounter, 2143 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 4991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 2143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2768 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-25 19:02:51,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [359 Valid, 519 Invalid, 4991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 2143 Invalid, 0 Unknown, 2768 Unchecked, 1.6s Time] [2021-11-25 19:02:51,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2021-11-25 19:02:51,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 1359. [2021-11-25 19:02:51,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1359 states, 1358 states have (on average 3.1973490427098676) internal successors, (4342), 1358 states have internal predecessors, (4342), 0 states have call successors, (0), 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-25 19:02:51,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 4342 transitions. [2021-11-25 19:02:51,093 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 4342 transitions. Word has length 30 [2021-11-25 19:02:51,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:02:51,094 INFO L470 AbstractCegarLoop]: Abstraction has 1359 states and 4342 transitions. [2021-11-25 19:02:51,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.9545454545454546) internal successors, (86), 44 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:02:51,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 4342 transitions. [2021-11-25 19:02:51,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 19:02:51,098 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:02:51,098 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] [2021-11-25 19:02:51,138 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-25 19:02:51,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:02:51,314 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 19:02:51,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:02:51,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1438453218, now seen corresponding path program 3 times [2021-11-25 19:02:51,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:02:51,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159055340] [2021-11-25 19:02:51,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:02:51,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:02:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:02:53,554 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:02:53,554 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:02:53,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159055340] [2021-11-25 19:02:53,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159055340] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:02:53,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52828729] [2021-11-25 19:02:53,555 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 19:02:53,555 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:02:53,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:02:53,562 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:02:53,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-25 19:02:53,714 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 19:02:53,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:02:53,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 68 conjunts are in the unsatisfiable core [2021-11-25 19:02:53,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:02:54,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:02:54,326 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 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 19:02:54,429 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 19 treesize of output 7 [2021-11-25 19:02:54,707 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 23 treesize of output 7 [2021-11-25 19:02:54,760 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:02:54,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:02:54,889 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:02:54,890 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 26 [2021-11-25 19:02:55,119 WARN L838 $PredicateComparison]: unable to prove that (or (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0) (and (= (* 4 c_~q2_front~0) (* 4 c_~q2_back~0)) (forall ((v_ArrVal_772 (Array Int Int))) (= c_~N~0 (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_772) c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))))))) (<= c_~n1~0 c_~q1_back~0) (<= c_~n2~0 (+ c_~q2_back~0 1)) (< c_~q1_back~0 0) (< c_~q2_back~0 0)) is different from false [2021-11-25 19:02:55,155 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:02:55,156 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 55 treesize of output 55 [2021-11-25 19:02:55,162 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 34 treesize of output 28 [2021-11-25 19:02:56,023 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-25 19:02:56,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52828729] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:02:56,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1334106992] [2021-11-25 19:02:56,024 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-25 19:02:56,026 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:02:56,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 15] total 47 [2021-11-25 19:02:56,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822549883] [2021-11-25 19:02:56,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:02:56,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2021-11-25 19:02:56,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:02:56,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-11-25 19:02:56,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2051, Unknown=4, NotChecked=92, Total=2352 [2021-11-25 19:02:56,031 INFO L87 Difference]: Start difference. First operand 1359 states and 4342 transitions. Second operand has 49 states, 48 states have (on average 1.8125) internal successors, (87), 48 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:03:05,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:03:05,506 INFO L93 Difference]: Finished difference Result 3400 states and 10419 transitions. [2021-11-25 19:03:05,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-11-25 19:03:05,506 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.8125) internal successors, (87), 48 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-25 19:03:05,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:03:05,531 INFO L225 Difference]: With dead ends: 3400 [2021-11-25 19:03:05,531 INFO L226 Difference]: Without dead ends: 3260 [2021-11-25 19:03:05,534 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1811 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=1117, Invalid=8187, Unknown=12, NotChecked=190, Total=9506 [2021-11-25 19:03:05,535 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 574 mSDsluCounter, 1673 mSDsCounter, 0 mSdLazyCounter, 3643 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 4813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 3643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 892 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2021-11-25 19:03:05,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [574 Valid, 511 Invalid, 4813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 3643 Invalid, 0 Unknown, 892 Unchecked, 2.5s Time] [2021-11-25 19:03:05,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3260 states. [2021-11-25 19:03:05,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3260 to 1555. [2021-11-25 19:03:05,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 1554 states have (on average 3.151222651222651) internal successors, (4897), 1554 states have internal predecessors, (4897), 0 states have call successors, (0), 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-25 19:03:05,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 4897 transitions. [2021-11-25 19:03:05,628 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 4897 transitions. Word has length 30 [2021-11-25 19:03:05,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:03:05,628 INFO L470 AbstractCegarLoop]: Abstraction has 1555 states and 4897 transitions. [2021-11-25 19:03:05,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 1.8125) internal successors, (87), 48 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:03:05,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 4897 transitions. [2021-11-25 19:03:05,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 19:03:05,634 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:03:05,634 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] [2021-11-25 19:03:05,670 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-25 19:03:05,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-25 19:03:05,863 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 19:03:05,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:03:05,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1457143696, now seen corresponding path program 4 times [2021-11-25 19:03:05,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:03:05,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689734690] [2021-11-25 19:03:05,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:03:05,863 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:03:05,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:03:07,115 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:03:07,116 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:03:07,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689734690] [2021-11-25 19:03:07,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689734690] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:03:07,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008583380] [2021-11-25 19:03:07,116 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 19:03:07,116 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:03:07,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:03:07,117 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:03:07,117 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-25 19:03:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:03:07,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 80 conjunts are in the unsatisfiable core [2021-11-25 19:03:07,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:03:07,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:03:07,916 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 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 19:03:08,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:03:08,044 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 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 19:03:08,565 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:03:08,567 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-25 19:03:08,567 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 42 treesize of output 10 [2021-11-25 19:03:08,606 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:03:08,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:03:09,280 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:03:09,280 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 1028 treesize of output 984 [2021-11-25 19:03:09,322 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:03:09,322 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 872 treesize of output 812 [2021-11-25 19:03:09,381 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:03:09,382 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 764 treesize of output 596 [2021-11-25 19:03:20,548 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:03:20,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008583380] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:03:20,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [199506834] [2021-11-25 19:03:20,549 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java: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-25 19:03:20,574 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:03:20,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 48 [2021-11-25 19:03:20,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238224492] [2021-11-25 19:03:20,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:03:20,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-11-25 19:03:20,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:03:20,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-11-25 19:03:20,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=2183, Unknown=8, NotChecked=0, Total=2450 [2021-11-25 19:03:20,577 INFO L87 Difference]: Start difference. First operand 1555 states and 4897 transitions. Second operand has 50 states, 49 states have (on average 1.7959183673469388) internal successors, (88), 49 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-25 19:03:24,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:03:24,797 INFO L93 Difference]: Finished difference Result 2828 states and 8776 transitions. [2021-11-25 19:03:24,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-11-25 19:03:24,798 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 1.7959183673469388) internal successors, (88), 49 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 30 [2021-11-25 19:03:24,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:03:24,816 INFO L225 Difference]: With dead ends: 2828 [2021-11-25 19:03:24,816 INFO L226 Difference]: Without dead ends: 2807 [2021-11-25 19:03:24,819 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1758 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=698, Invalid=5455, Unknown=9, NotChecked=0, Total=6162 [2021-11-25 19:03:24,819 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 305 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 3426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2008 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-25 19:03:24,820 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [305 Valid, 404 Invalid, 3426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1341 Invalid, 0 Unknown, 2008 Unchecked, 0.9s Time] [2021-11-25 19:03:24,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2807 states. [2021-11-25 19:03:24,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2807 to 1621. [2021-11-25 19:03:24,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1621 states, 1620 states have (on average 3.132716049382716) internal successors, (5075), 1620 states have internal predecessors, (5075), 0 states have call successors, (0), 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-25 19:03:24,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 1621 states and 5075 transitions. [2021-11-25 19:03:24,885 INFO L78 Accepts]: Start accepts. Automaton has 1621 states and 5075 transitions. Word has length 30 [2021-11-25 19:03:24,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:03:24,885 INFO L470 AbstractCegarLoop]: Abstraction has 1621 states and 5075 transitions. [2021-11-25 19:03:24,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 1.7959183673469388) internal successors, (88), 49 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-25 19:03:24,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1621 states and 5075 transitions. [2021-11-25 19:03:24,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 19:03:24,891 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:03:24,891 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] [2021-11-25 19:03:24,918 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-25 19:03:25,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-25 19:03:25,111 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 19:03:25,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:03:25,111 INFO L85 PathProgramCache]: Analyzing trace with hash 812829216, now seen corresponding path program 5 times [2021-11-25 19:03:25,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:03:25,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809312702] [2021-11-25 19:03:25,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:03:25,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:03:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:03:26,625 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:03:26,626 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:03:26,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809312702] [2021-11-25 19:03:26,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809312702] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:03:26,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732854011] [2021-11-25 19:03:26,626 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:03:26,627 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:03:26,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:03:26,627 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:03:26,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-25 19:03:26,754 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 19:03:26,754 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:03:26,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 57 conjunts are in the unsatisfiable core [2021-11-25 19:03:26,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:03:26,772 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 66 treesize of output 62 [2021-11-25 19:03:27,094 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 19:03:27,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 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 19:03:27,449 INFO L354 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2021-11-25 19:03:27,449 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 44 treesize of output 10 [2021-11-25 19:03:27,517 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-25 19:03:27,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:03:29,652 WARN L838 $PredicateComparison]: unable to prove that (forall ((~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse0 (select |c_#memory_int| ~q2~0.base))) (or (not (= (select .cse0 (+ ~q2~0.offset (* c_~q2_back~0 4))) (select (select |c_#memory_int| c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))))) (= c_~N~0 (+ (select .cse0 (+ ~q2~0.offset (* c_~q2_front~0 4))) c_~t~0))))) is different from false [2021-11-25 19:03:29,664 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_899 (Array Int Int)) (~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_899))) (let ((.cse1 (select .cse0 ~q2~0.base))) (or (not (= (select (select .cse0 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) (select .cse1 (+ ~q2~0.offset (* c_~q2_back~0 4))))) (= (+ (select .cse1 (+ ~q2~0.offset (* c_~q2_front~0 4))) c_~t~0) c_~N~0))))) is different from false [2021-11-25 19:03:29,689 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_898 (Array Int Int)) (v_ArrVal_899 (Array Int Int)) (~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_898) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_899))) (let ((.cse0 (select .cse1 ~q2~0.base))) (or (= (+ (select .cse0 (+ ~q2~0.offset (* c_~q2_front~0 4))) c_~t~0) c_~N~0) (not (= (select .cse0 (+ ~q2~0.offset (* c_~q2_back~0 4))) (select (select .cse1 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))))))))) is different from false [2021-11-25 19:03:29,798 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:03:29,799 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 2088 treesize of output 1900 [2021-11-25 19:03:29,837 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:03:29,837 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 1788 treesize of output 1620 [2021-11-25 19:03:29,903 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:03:29,903 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 1572 treesize of output 1188 [2021-11-25 19:03:35,355 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 1 not checked. [2021-11-25 19:03:35,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732854011] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:03:35,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1199503950] [2021-11-25 19:03:35,356 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-25 19:03:35,357 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:03:35,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 10] total 35 [2021-11-25 19:03:35,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757036635] [2021-11-25 19:03:35,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:03:35,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-11-25 19:03:35,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:03:35,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-11-25 19:03:35,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1038, Unknown=3, NotChecked=198, Total=1332 [2021-11-25 19:03:35,360 INFO L87 Difference]: Start difference. First operand 1621 states and 5075 transitions. Second operand has 37 states, 36 states have (on average 2.1944444444444446) internal successors, (79), 36 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:03:37,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:03:37,219 INFO L93 Difference]: Finished difference Result 2017 states and 6111 transitions. [2021-11-25 19:03:37,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-25 19:03:37,220 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.1944444444444446) internal successors, (79), 36 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-25 19:03:37,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:03:37,227 INFO L225 Difference]: With dead ends: 2017 [2021-11-25 19:03:37,227 INFO L226 Difference]: Without dead ends: 1983 [2021-11-25 19:03:37,229 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=209, Invalid=2350, Unknown=3, NotChecked=300, Total=2862 [2021-11-25 19:03:37,229 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 146 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 1073 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 1670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 563 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 19:03:37,230 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 239 Invalid, 1670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1073 Invalid, 0 Unknown, 563 Unchecked, 0.6s Time] [2021-11-25 19:03:37,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983 states. [2021-11-25 19:03:37,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983 to 1749. [2021-11-25 19:03:37,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1749 states, 1748 states have (on average 3.0909610983981692) internal successors, (5403), 1748 states have internal predecessors, (5403), 0 states have call successors, (0), 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-25 19:03:37,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1749 states to 1749 states and 5403 transitions. [2021-11-25 19:03:37,283 INFO L78 Accepts]: Start accepts. Automaton has 1749 states and 5403 transitions. Word has length 30 [2021-11-25 19:03:37,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:03:37,284 INFO L470 AbstractCegarLoop]: Abstraction has 1749 states and 5403 transitions. [2021-11-25 19:03:37,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.1944444444444446) internal successors, (79), 36 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:03:37,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1749 states and 5403 transitions. [2021-11-25 19:03:37,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 19:03:37,289 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:03:37,290 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] [2021-11-25 19:03:37,327 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-25 19:03:37,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-25 19:03:37,515 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 19:03:37,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:03:37,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1609515332, now seen corresponding path program 6 times [2021-11-25 19:03:37,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:03:37,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3397480] [2021-11-25 19:03:37,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:03:37,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:03:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:03:39,072 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:03:39,072 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:03:39,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3397480] [2021-11-25 19:03:39,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3397480] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:03:39,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993684249] [2021-11-25 19:03:39,073 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 19:03:39,073 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:03:39,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:03:39,074 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:03:39,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-25 19:03:39,275 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 19:03:39,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:03:39,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 67 conjunts are in the unsatisfiable core [2021-11-25 19:03:39,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:03:39,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:03:39,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:03:39,314 INFO L354 Elim1Store]: treesize reduction 49, result has 33.8 percent of original size [2021-11-25 19:03:39,314 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 2 case distinctions, treesize of input 15 treesize of output 35 [2021-11-25 19:03:39,410 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 19:03:39,411 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-25 19:03:39,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:03:39,715 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 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 19:03:39,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:03:39,936 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-25 19:03:39,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 40 [2021-11-25 19:03:40,149 INFO L354 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2021-11-25 19:03:40,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 42 treesize of output 10 [2021-11-25 19:03:40,198 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-25 19:03:40,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:03:40,847 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:03:40,847 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 276 treesize of output 328 [2021-11-25 19:03:40,866 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:03:40,866 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 328 treesize of output 340 [2021-11-25 19:03:40,878 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 133 treesize of output 121 [2021-11-25 19:03:40,886 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 121 treesize of output 109 [2021-11-25 19:03:43,023 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 19:03:43,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993684249] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:03:43,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [192163424] [2021-11-25 19:03:43,024 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-25 19:03:43,026 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:03:43,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 11] total 40 [2021-11-25 19:03:43,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925325216] [2021-11-25 19:03:43,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:03:43,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-11-25 19:03:43,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:03:43,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-11-25 19:03:43,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1601, Unknown=5, NotChecked=0, Total=1722 [2021-11-25 19:03:43,028 INFO L87 Difference]: Start difference. First operand 1749 states and 5403 transitions. Second operand has 42 states, 41 states have (on average 2.048780487804878) internal successors, (84), 41 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:03:46,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:03:46,198 INFO L93 Difference]: Finished difference Result 2355 states and 6934 transitions. [2021-11-25 19:03:46,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-25 19:03:46,199 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.048780487804878) internal successors, (84), 41 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-25 19:03:46,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:03:46,204 INFO L225 Difference]: With dead ends: 2355 [2021-11-25 19:03:46,204 INFO L226 Difference]: Without dead ends: 2320 [2021-11-25 19:03:46,206 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 46 SyntacticMatches, 9 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=368, Invalid=4183, Unknown=5, NotChecked=0, Total=4556 [2021-11-25 19:03:46,206 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 206 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 1515 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 3339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1780 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-25 19:03:46,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [206 Valid, 488 Invalid, 3339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1515 Invalid, 0 Unknown, 1780 Unchecked, 0.9s Time] [2021-11-25 19:03:46,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2320 states. [2021-11-25 19:03:46,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2320 to 1816. [2021-11-25 19:03:46,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1816 states, 1815 states have (on average 3.087052341597796) internal successors, (5603), 1815 states have internal predecessors, (5603), 0 states have call successors, (0), 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-25 19:03:46,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1816 states and 5603 transitions. [2021-11-25 19:03:46,267 INFO L78 Accepts]: Start accepts. Automaton has 1816 states and 5603 transitions. Word has length 30 [2021-11-25 19:03:46,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:03:46,267 INFO L470 AbstractCegarLoop]: Abstraction has 1816 states and 5603 transitions. [2021-11-25 19:03:46,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.048780487804878) internal successors, (84), 41 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:03:46,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 5603 transitions. [2021-11-25 19:03:46,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 19:03:46,273 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:03:46,274 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] [2021-11-25 19:03:46,308 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-25 19:03:46,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:03:46,487 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 19:03:46,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:03:46,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1521064892, now seen corresponding path program 7 times [2021-11-25 19:03:46,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:03:46,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95596367] [2021-11-25 19:03:46,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:03:46,487 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:03:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:03:48,083 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:03:48,084 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:03:48,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95596367] [2021-11-25 19:03:48,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95596367] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:03:48,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258030746] [2021-11-25 19:03:48,084 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 19:03:48,084 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:03:48,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:03:48,085 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:03:48,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-25 19:03:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:03:48,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 66 conjunts are in the unsatisfiable core [2021-11-25 19:03:48,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:03:48,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:03:48,251 INFO L354 Elim1Store]: treesize reduction 63, result has 32.3 percent of original size [2021-11-25 19:03:48,251 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 3 case distinctions, treesize of input 15 treesize of output 35 [2021-11-25 19:03:48,377 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-25 19:03:48,377 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 16 treesize of output 18 [2021-11-25 19:03:48,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:03:48,630 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 19:03:48,868 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-25 19:03:48,869 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 46 [2021-11-25 19:03:48,880 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 29 treesize of output 15 [2021-11-25 19:03:49,049 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 23 treesize of output 7 [2021-11-25 19:03:49,095 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-25 19:03:49,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:03:49,891 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:03:49,891 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 343 treesize of output 387 [2021-11-25 19:03:49,903 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 205 treesize of output 169 [2021-11-25 19:03:49,927 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:03:49,927 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 218 treesize of output 224 [2021-11-25 19:03:51,557 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 19:03:51,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258030746] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:03:51,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [414021978] [2021-11-25 19:03:51,559 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-25 19:03:51,559 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:03:51,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 11] total 40 [2021-11-25 19:03:51,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557590886] [2021-11-25 19:03:51,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:03:51,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-11-25 19:03:51,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:03:51,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-11-25 19:03:51,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1602, Unknown=5, NotChecked=0, Total=1722 [2021-11-25 19:03:51,561 INFO L87 Difference]: Start difference. First operand 1816 states and 5603 transitions. Second operand has 42 states, 41 states have (on average 2.073170731707317) internal successors, (85), 41 states have internal predecessors, (85), 0 states have call successors, (0), 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-25 19:03:55,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:03:55,476 INFO L93 Difference]: Finished difference Result 2408 states and 7065 transitions. [2021-11-25 19:03:55,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-11-25 19:03:55,476 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.073170731707317) internal successors, (85), 41 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-25 19:03:55,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:03:55,482 INFO L225 Difference]: With dead ends: 2408 [2021-11-25 19:03:55,482 INFO L226 Difference]: Without dead ends: 2397 [2021-11-25 19:03:55,483 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=371, Invalid=4316, Unknown=5, NotChecked=0, Total=4692 [2021-11-25 19:03:55,483 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 253 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 2580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 740 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-25 19:03:55,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [253 Valid, 462 Invalid, 2580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1791 Invalid, 0 Unknown, 740 Unchecked, 1.3s Time] [2021-11-25 19:03:55,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2397 states. [2021-11-25 19:03:55,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2397 to 1920. [2021-11-25 19:03:55,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1920 states, 1919 states have (on average 3.1010943199583116) internal successors, (5951), 1919 states have internal predecessors, (5951), 0 states have call successors, (0), 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-25 19:03:55,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1920 states to 1920 states and 5951 transitions. [2021-11-25 19:03:55,548 INFO L78 Accepts]: Start accepts. Automaton has 1920 states and 5951 transitions. Word has length 30 [2021-11-25 19:03:55,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:03:55,549 INFO L470 AbstractCegarLoop]: Abstraction has 1920 states and 5951 transitions. [2021-11-25 19:03:55,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.073170731707317) internal successors, (85), 41 states have internal predecessors, (85), 0 states have call successors, (0), 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-25 19:03:55,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1920 states and 5951 transitions. [2021-11-25 19:03:55,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 19:03:55,555 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:03:55,555 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] [2021-11-25 19:03:55,592 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-25 19:03:55,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:03:55,783 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 19:03:55,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:03:55,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1110661956, now seen corresponding path program 8 times [2021-11-25 19:03:55,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:03:55,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763292491] [2021-11-25 19:03:55,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:03:55,783 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:03:55,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:03:57,219 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:03:57,219 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:03:57,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763292491] [2021-11-25 19:03:57,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763292491] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:03:57,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863227314] [2021-11-25 19:03:57,220 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:03:57,220 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:03:57,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:03:57,220 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:03:57,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-25 19:03:57,382 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 19:03:57,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:03:57,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 61 conjunts are in the unsatisfiable core [2021-11-25 19:03:57,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:03:57,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:03:57,772 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 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 19:03:58,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:03:58,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:03:58,004 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-25 19:03:58,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 40 [2021-11-25 19:03:58,191 INFO L354 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2021-11-25 19:03:58,191 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 44 treesize of output 10 [2021-11-25 19:03:58,249 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-25 19:03:58,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:03:58,778 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:03:58,779 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 351 treesize of output 395 [2021-11-25 19:03:58,805 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:03:58,805 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 256 treesize of output 262 [2021-11-25 19:03:58,814 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 195 treesize of output 159 [2021-11-25 19:04:00,836 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 19:04:00,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863227314] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:04:00,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1862931377] [2021-11-25 19:04:00,837 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-25 19:04:00,837 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:04:00,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 11] total 40 [2021-11-25 19:04:00,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178445071] [2021-11-25 19:04:00,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:04:00,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-11-25 19:04:00,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:04:00,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-11-25 19:04:00,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1603, Unknown=5, NotChecked=0, Total=1722 [2021-11-25 19:04:00,839 INFO L87 Difference]: Start difference. First operand 1920 states and 5951 transitions. Second operand has 42 states, 41 states have (on average 2.048780487804878) internal successors, (84), 41 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:04:03,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:04:03,617 INFO L93 Difference]: Finished difference Result 2715 states and 7942 transitions. [2021-11-25 19:04:03,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-25 19:04:03,617 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.048780487804878) internal successors, (84), 41 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-25 19:04:03,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:04:03,630 INFO L225 Difference]: With dead ends: 2715 [2021-11-25 19:04:03,630 INFO L226 Difference]: Without dead ends: 2656 [2021-11-25 19:04:03,631 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=336, Invalid=3691, Unknown=5, NotChecked=0, Total=4032 [2021-11-25 19:04:03,632 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 260 mSDsluCounter, 1195 mSDsCounter, 0 mSdLazyCounter, 1374 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 2614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1167 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-25 19:04:03,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 421 Invalid, 2614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1374 Invalid, 0 Unknown, 1167 Unchecked, 0.9s Time] [2021-11-25 19:04:03,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2656 states. [2021-11-25 19:04:03,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2656 to 1954. [2021-11-25 19:04:03,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1954 states, 1953 states have (on average 3.0972862263184844) internal successors, (6049), 1953 states have internal predecessors, (6049), 0 states have call successors, (0), 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-25 19:04:03,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 6049 transitions. [2021-11-25 19:04:03,722 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 6049 transitions. Word has length 30 [2021-11-25 19:04:03,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:04:03,723 INFO L470 AbstractCegarLoop]: Abstraction has 1954 states and 6049 transitions. [2021-11-25 19:04:03,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.048780487804878) internal successors, (84), 41 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:04:03,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 6049 transitions. [2021-11-25 19:04:03,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 19:04:03,735 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:04:03,735 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] [2021-11-25 19:04:03,773 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-25 19:04:03,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:04:03,958 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 19:04:03,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:04:03,959 INFO L85 PathProgramCache]: Analyzing trace with hash 140869004, now seen corresponding path program 9 times [2021-11-25 19:04:03,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:04:03,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639361782] [2021-11-25 19:04:03,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:04:03,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:04:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:04:05,177 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:04:05,177 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:04:05,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639361782] [2021-11-25 19:04:05,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639361782] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:04:05,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192932307] [2021-11-25 19:04:05,178 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 19:04:05,178 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:04:05,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:04:05,178 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:04:05,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-25 19:04:05,310 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 19:04:05,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:04:05,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 63 conjunts are in the unsatisfiable core [2021-11-25 19:04:05,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:04:05,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:04:05,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:04:05,347 INFO L354 Elim1Store]: treesize reduction 49, result has 33.8 percent of original size [2021-11-25 19:04:05,347 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 2 case distinctions, treesize of input 15 treesize of output 35 [2021-11-25 19:04:05,434 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 19:04:05,434 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-25 19:04:05,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:04:05,693 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 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 19:04:06,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:04:06,200 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-25 19:04:06,200 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 40 [2021-11-25 19:04:07,424 INFO L354 Elim1Store]: treesize reduction 54, result has 5.3 percent of original size [2021-11-25 19:04:07,424 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 13 [2021-11-25 19:04:07,532 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 19:04:07,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:04:08,316 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:04:08,317 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 485 treesize of output 513 [2021-11-25 19:04:08,340 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:04:08,340 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 513 treesize of output 507 [2021-11-25 19:04:08,356 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 285 treesize of output 261 [2021-11-25 19:04:08,367 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 261 treesize of output 237 [2021-11-25 19:04:10,219 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 19:04:10,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192932307] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:04:10,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1585727571] [2021-11-25 19:04:10,220 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-25 19:04:10,220 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:04:10,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 38 [2021-11-25 19:04:10,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124377397] [2021-11-25 19:04:10,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:04:10,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-25 19:04:10,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:04:10,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-25 19:04:10,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1430, Unknown=3, NotChecked=0, Total=1560 [2021-11-25 19:04:10,223 INFO L87 Difference]: Start difference. First operand 1954 states and 6049 transitions. Second operand has 40 states, 39 states have (on average 2.128205128205128) internal successors, (83), 39 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-25 19:04:13,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:04:13,215 INFO L93 Difference]: Finished difference Result 2104 states and 6444 transitions. [2021-11-25 19:04:13,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-25 19:04:13,215 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.128205128205128) internal successors, (83), 39 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 30 [2021-11-25 19:04:13,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:04:13,221 INFO L225 Difference]: With dead ends: 2104 [2021-11-25 19:04:13,221 INFO L226 Difference]: Without dead ends: 2041 [2021-11-25 19:04:13,222 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=318, Invalid=3100, Unknown=4, NotChecked=0, Total=3422 [2021-11-25 19:04:13,222 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 130 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 600 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 19:04:13,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 269 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 672 Invalid, 0 Unknown, 600 Unchecked, 0.4s Time] [2021-11-25 19:04:13,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2041 states. [2021-11-25 19:04:13,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2041 to 2002. [2021-11-25 19:04:13,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2002 states, 2001 states have (on average 3.106946526736632) internal successors, (6217), 2001 states have internal predecessors, (6217), 0 states have call successors, (0), 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-25 19:04:13,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 6217 transitions. [2021-11-25 19:04:13,273 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 6217 transitions. Word has length 30 [2021-11-25 19:04:13,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:04:13,273 INFO L470 AbstractCegarLoop]: Abstraction has 2002 states and 6217 transitions. [2021-11-25 19:04:13,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.128205128205128) internal successors, (83), 39 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-25 19:04:13,274 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 6217 transitions. [2021-11-25 19:04:13,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 19:04:13,279 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:04:13,279 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] [2021-11-25 19:04:13,318 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-25 19:04:13,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:04:13,493 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 19:04:13,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:04:13,494 INFO L85 PathProgramCache]: Analyzing trace with hash -517342388, now seen corresponding path program 10 times [2021-11-25 19:04:13,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:04:13,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570353411] [2021-11-25 19:04:13,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:04:13,494 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:04:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:04:15,465 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:04:15,466 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:04:15,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570353411] [2021-11-25 19:04:15,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570353411] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:04:15,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286349275] [2021-11-25 19:04:15,466 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 19:04:15,466 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:04:15,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:04:15,467 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:04:15,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-25 19:04:15,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:04:15,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 73 conjunts are in the unsatisfiable core [2021-11-25 19:04:15,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:04:16,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:04:16,334 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 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 19:04:16,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:04:16,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:04:16,742 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-25 19:04:16,742 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 36 [2021-11-25 19:04:17,164 INFO L354 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2021-11-25 19:04:17,164 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 50 treesize of output 14 [2021-11-25 19:04:17,275 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:04:17,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:04:18,254 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:04:18,254 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 601 treesize of output 621 [2021-11-25 19:04:18,270 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 439 treesize of output 367 [2021-11-25 19:04:18,297 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:04:18,298 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 437 treesize of output 425 [2021-11-25 19:04:37,034 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:04:37,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286349275] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:04:37,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [307161146] [2021-11-25 19:04:37,035 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java: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-25 19:04:37,036 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:04:37,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 49 [2021-11-25 19:04:37,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032275676] [2021-11-25 19:04:37,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:04:37,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2021-11-25 19:04:37,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:04:37,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-11-25 19:04:37,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=2289, Unknown=5, NotChecked=0, Total=2550 [2021-11-25 19:04:37,037 INFO L87 Difference]: Start difference. First operand 2002 states and 6217 transitions. Second operand has 51 states, 50 states have (on average 1.74) internal successors, (87), 50 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:04:47,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:04:47,121 INFO L93 Difference]: Finished difference Result 2983 states and 9233 transitions. [2021-11-25 19:04:47,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-11-25 19:04:47,121 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.74) internal successors, (87), 50 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-25 19:04:47,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:04:47,126 INFO L225 Difference]: With dead ends: 2983 [2021-11-25 19:04:47,126 INFO L226 Difference]: Without dead ends: 2943 [2021-11-25 19:04:47,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 34 SyntacticMatches, 9 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1684 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=1049, Invalid=6945, Unknown=16, NotChecked=0, Total=8010 [2021-11-25 19:04:47,127 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 423 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 1368 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 2713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1224 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:04:47,128 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [423 Valid, 419 Invalid, 2713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1368 Invalid, 0 Unknown, 1224 Unchecked, 1.1s Time] [2021-11-25 19:04:47,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2021-11-25 19:04:47,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 2123. [2021-11-25 19:04:47,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2123 states, 2122 states have (on average 3.1413760603204524) internal successors, (6666), 2122 states have internal predecessors, (6666), 0 states have call successors, (0), 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-25 19:04:47,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2123 states to 2123 states and 6666 transitions. [2021-11-25 19:04:47,226 INFO L78 Accepts]: Start accepts. Automaton has 2123 states and 6666 transitions. Word has length 30 [2021-11-25 19:04:47,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:04:47,227 INFO L470 AbstractCegarLoop]: Abstraction has 2123 states and 6666 transitions. [2021-11-25 19:04:47,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.74) internal successors, (87), 50 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:04:47,227 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 6666 transitions. [2021-11-25 19:04:47,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 19:04:47,232 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:04:47,232 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] [2021-11-25 19:04:47,264 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-11-25 19:04:47,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-11-25 19:04:47,450 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 19:04:47,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:04:47,451 INFO L85 PathProgramCache]: Analyzing trace with hash 608478094, now seen corresponding path program 11 times [2021-11-25 19:04:47,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:04:47,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961866650] [2021-11-25 19:04:47,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:04:47,451 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:04:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:04:49,134 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:04:49,134 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:04:49,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961866650] [2021-11-25 19:04:49,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961866650] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:04:49,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921999054] [2021-11-25 19:04:49,134 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:04:49,135 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:04:49,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:04:49,135 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:04:49,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-25 19:04:49,281 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 19:04:49,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:04:49,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 71 conjunts are in the unsatisfiable core [2021-11-25 19:04:49,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:04:49,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:04:49,856 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 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 19:04:50,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:04:50,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:04:50,411 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-25 19:04:50,411 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 42 [2021-11-25 19:04:50,594 INFO L354 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2021-11-25 19:04:50,594 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 50 treesize of output 14 [2021-11-25 19:04:50,674 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 19:04:50,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:04:50,831 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1283 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1283) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))))) (or (= .cse0 0) (let ((.cse1 (+ .cse0 c_~t~0))) (and (<= c_~N~0 .cse1) (< .cse1 (+ c_~N~0 1))))))) is different from false [2021-11-25 19:04:51,511 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:04:51,511 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 343 treesize of output 387 [2021-11-25 19:04:51,523 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 205 treesize of output 169 [2021-11-25 19:04:51,547 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:04:51,547 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 218 treesize of output 224 [2021-11-25 19:04:54,877 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 19:04:54,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921999054] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:04:54,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [378074586] [2021-11-25 19:04:54,877 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java: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-25 19:04:54,878 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:04:54,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 14] total 46 [2021-11-25 19:04:54,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378157908] [2021-11-25 19:04:54,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:04:54,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-11-25 19:04:54,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:04:54,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-11-25 19:04:54,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1956, Unknown=11, NotChecked=90, Total=2256 [2021-11-25 19:04:54,880 INFO L87 Difference]: Start difference. First operand 2123 states and 6666 transitions. Second operand has 48 states, 47 states have (on average 1.8297872340425532) internal successors, (86), 47 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:04:58,554 WARN L838 $PredicateComparison]: unable to prove that (and (or (and (<= 0 c_~t~0) (= (* 4 c_~q2_front~0) (* 4 c_~q2_back~0)) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (= (* 4 c_~q1_front~0) (* 4 c_~q1_back~0)) (<= c_~t~0 0) (not (= |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|))) (<= 1 c_~q2_back~0) (< c_~q2_back~0 0)) (forall ((v_ArrVal_1283 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1283) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))))) (or (= .cse0 0) (let ((.cse1 (+ .cse0 c_~t~0))) (and (<= c_~N~0 .cse1) (< .cse1 (+ c_~N~0 1)))))))) is different from false [2021-11-25 19:05:00,926 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* 4 c_~q1_back~0)) (.cse0 (* 4 c_~q2_front~0)) (.cse2 (not (= |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)))) (and (or (and (<= 0 c_~t~0) (= .cse0 (* 4 c_~q2_back~0)) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (= (* 4 c_~q1_front~0) .cse1) (<= c_~t~0 0) .cse2) (<= 1 c_~q2_back~0) (< c_~q2_back~0 0)) (= c_~t~0 0) (or (<= c_~n2~0 c_~q2_back~0) (and (or (let ((.cse3 (select (select |c_#memory_int| c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))))) (and (<= |c_thread1Thread1of1ForFork1_~i~0#1| .cse3) (<= .cse3 c_~N~0))) (<= (* 4 c_~n1~0) (+ .cse1 3 c_~q1~0.offset))) (not (= c_~q2~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|)) (= c_~q1~0.offset 0) (= c_~q2~0.offset 0) (<= c_~q2_front~0 0) (< 0 (+ .cse0 c_~q2~0.offset 1)))) (forall ((v_ArrVal_1283 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1283) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))))) (or (= .cse4 0) (let ((.cse5 (+ .cse4 c_~t~0))) (and (<= c_~N~0 .cse5) (< .cse5 (+ c_~N~0 1))))))) (or (not (= c_~q2_back~0 0)) (let ((.cse6 (+ |c_#StackHeapBarrier| 1))) (and (<= c_~q1_back~0 c_~q1_front~0) (<= .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= .cse6 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= (+ c_~q1_front~0 c_~n1~0) (+ |c_ULTIMATE.start_create_fresh_int_array_~size#1| c_~q1_back~0)) (= c_~q2_back~0 c_~q2_front~0) .cse2 (= |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)))))) is different from false [2021-11-25 19:05:01,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:05:01,512 INFO L93 Difference]: Finished difference Result 3168 states and 9420 transitions. [2021-11-25 19:05:01,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-11-25 19:05:01,513 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.8297872340425532) internal successors, (86), 47 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-25 19:05:01,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:05:01,519 INFO L225 Difference]: With dead ends: 3168 [2021-11-25 19:05:01,520 INFO L226 Difference]: Without dead ends: 3158 [2021-11-25 19:05:01,521 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 37 SyntacticMatches, 13 SemanticMatches, 91 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2318 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=768, Invalid=7239, Unknown=15, NotChecked=534, Total=8556 [2021-11-25 19:05:01,521 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 389 mSDsluCounter, 1118 mSDsCounter, 0 mSdLazyCounter, 1449 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 2877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1322 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:05:01,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [389 Valid, 471 Invalid, 2877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1449 Invalid, 0 Unknown, 1322 Unchecked, 1.2s Time] [2021-11-25 19:05:01,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3158 states. [2021-11-25 19:05:01,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3158 to 2156. [2021-11-25 19:05:01,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2155 states have (on average 3.1359628770301624) internal successors, (6758), 2155 states have internal predecessors, (6758), 0 states have call successors, (0), 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-25 19:05:01,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 6758 transitions. [2021-11-25 19:05:01,592 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 6758 transitions. Word has length 30 [2021-11-25 19:05:01,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:05:01,592 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 6758 transitions. [2021-11-25 19:05:01,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.8297872340425532) internal successors, (86), 47 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:05:01,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 6758 transitions. [2021-11-25 19:05:01,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 19:05:01,598 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:05:01,598 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] [2021-11-25 19:05:01,638 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-11-25 19:05:01,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-11-25 19:05:01,815 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 19:05:01,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:05:01,815 INFO L85 PathProgramCache]: Analyzing trace with hash 520027654, now seen corresponding path program 12 times [2021-11-25 19:05:01,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:05:01,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372099370] [2021-11-25 19:05:01,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:05:01,815 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:05:01,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:05:03,212 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:05:03,212 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:05:03,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372099370] [2021-11-25 19:05:03,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372099370] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:05:03,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582840979] [2021-11-25 19:05:03,212 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 19:05:03,213 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:05:03,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:05:03,213 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:05:03,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-25 19:05:03,390 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 19:05:03,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:05:03,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 58 conjunts are in the unsatisfiable core [2021-11-25 19:05:03,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:05:03,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:05:03,802 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 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 19:05:04,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:05:04,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:05:04,164 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-25 19:05:04,164 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 40 [2021-11-25 19:05:04,306 INFO L354 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2021-11-25 19:05:04,306 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 54 treesize of output 14 [2021-11-25 19:05:04,349 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-25 19:05:04,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:05:04,493 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1345) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))))) (or (let ((.cse0 (+ .cse1 c_~t~0))) (and (<= c_~N~0 .cse0) (< .cse0 (+ c_~N~0 1)))) (= .cse1 0)))) is different from false [2021-11-25 19:05:05,174 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:05:05,174 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 601 treesize of output 621 [2021-11-25 19:05:05,199 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 439 treesize of output 367 [2021-11-25 19:05:05,236 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:05:05,237 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 391 treesize of output 379 [2021-11-25 19:05:09,000 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2021-11-25 19:05:09,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582840979] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:05:09,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [47960615] [2021-11-25 19:05:09,001 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-25 19:05:09,001 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:05:09,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 11] total 40 [2021-11-25 19:05:09,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334739359] [2021-11-25 19:05:09,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:05:09,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-11-25 19:05:09,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:05:09,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-11-25 19:05:09,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1525, Unknown=4, NotChecked=78, Total=1722 [2021-11-25 19:05:09,003 INFO L87 Difference]: Start difference. First operand 2156 states and 6758 transitions. Second operand has 42 states, 41 states have (on average 2.073170731707317) internal successors, (85), 41 states have internal predecessors, (85), 0 states have call successors, (0), 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-25 19:05:12,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:05:12,049 INFO L93 Difference]: Finished difference Result 2639 states and 7883 transitions. [2021-11-25 19:05:12,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-25 19:05:12,050 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.073170731707317) internal successors, (85), 41 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-25 19:05:12,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:05:12,054 INFO L225 Difference]: With dead ends: 2639 [2021-11-25 19:05:12,054 INFO L226 Difference]: Without dead ends: 2605 [2021-11-25 19:05:12,054 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=343, Invalid=3689, Unknown=4, NotChecked=124, Total=4160 [2021-11-25 19:05:12,055 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 223 mSDsluCounter, 1455 mSDsCounter, 0 mSdLazyCounter, 1740 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 2711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 922 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:05:12,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 532 Invalid, 2711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1740 Invalid, 0 Unknown, 922 Unchecked, 1.1s Time] [2021-11-25 19:05:12,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2605 states. [2021-11-25 19:05:12,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2605 to 2180. [2021-11-25 19:05:12,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2180 states, 2179 states have (on average 3.1381367599816428) internal successors, (6838), 2179 states have internal predecessors, (6838), 0 states have call successors, (0), 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-25 19:05:12,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 6838 transitions. [2021-11-25 19:05:12,104 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 6838 transitions. Word has length 30 [2021-11-25 19:05:12,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:05:12,105 INFO L470 AbstractCegarLoop]: Abstraction has 2180 states and 6838 transitions. [2021-11-25 19:05:12,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.073170731707317) internal successors, (85), 41 states have internal predecessors, (85), 0 states have call successors, (0), 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-25 19:05:12,105 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 6838 transitions. [2021-11-25 19:05:12,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 19:05:12,111 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:05:12,111 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] [2021-11-25 19:05:12,134 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-11-25 19:05:12,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-11-25 19:05:12,323 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 19:05:12,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:05:12,323 INFO L85 PathProgramCache]: Analyzing trace with hash 612979536, now seen corresponding path program 13 times [2021-11-25 19:05:12,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:05:12,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650288374] [2021-11-25 19:05:12,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:05:12,323 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:05:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:05:13,565 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:05:13,566 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:05:13,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650288374] [2021-11-25 19:05:13,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650288374] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:05:13,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412662593] [2021-11-25 19:05:13,566 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 19:05:13,566 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:05:13,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:05:13,568 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:05:13,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-25 19:05:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:05:13,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 67 conjunts are in the unsatisfiable core [2021-11-25 19:05:13,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:05:14,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:05:14,313 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 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 19:05:14,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:05:14,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:05:14,806 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-25 19:05:14,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 42 [2021-11-25 19:05:15,016 INFO L354 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2021-11-25 19:05:15,016 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 44 treesize of output 10 [2021-11-25 19:05:15,079 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 19:05:15,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:05:15,247 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1407 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))))) (or (= .cse0 0) (let ((.cse1 (+ .cse0 c_~t~0))) (and (<= c_~N~0 .cse1) (< .cse1 (+ c_~N~0 1))))))) is different from false [2021-11-25 19:05:15,868 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:05:15,868 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 601 treesize of output 621 [2021-11-25 19:05:15,902 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:05:15,902 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 445 treesize of output 433 [2021-11-25 19:05:15,917 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 403 treesize of output 331 [2021-11-25 19:05:20,527 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 19:05:20,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412662593] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:05:20,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [531317574] [2021-11-25 19:05:20,528 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-25 19:05:20,528 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:05:20,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 13] total 44 [2021-11-25 19:05:20,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666871133] [2021-11-25 19:05:20,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:05:20,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-11-25 19:05:20,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:05:20,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-11-25 19:05:20,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1818, Unknown=4, NotChecked=86, Total=2070 [2021-11-25 19:05:20,531 INFO L87 Difference]: Start difference. First operand 2180 states and 6838 transitions. Second operand has 46 states, 45 states have (on average 1.9111111111111112) internal successors, (86), 45 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:05:27,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:05:27,805 INFO L93 Difference]: Finished difference Result 2976 states and 9107 transitions. [2021-11-25 19:05:27,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-11-25 19:05:27,806 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.9111111111111112) internal successors, (86), 45 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-25 19:05:27,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:05:27,810 INFO L225 Difference]: With dead ends: 2976 [2021-11-25 19:05:27,810 INFO L226 Difference]: Without dead ends: 2922 [2021-11-25 19:05:27,811 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 38 SyntacticMatches, 12 SemanticMatches, 83 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1700 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=732, Invalid=6238, Unknown=6, NotChecked=164, Total=7140 [2021-11-25 19:05:27,812 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 467 mSDsluCounter, 1539 mSDsCounter, 0 mSdLazyCounter, 1923 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 3720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1660 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-25 19:05:27,812 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [467 Valid, 513 Invalid, 3720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1923 Invalid, 0 Unknown, 1660 Unchecked, 1.4s Time] [2021-11-25 19:05:27,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2021-11-25 19:05:27,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2227. [2021-11-25 19:05:27,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2227 states, 2226 states have (on average 3.138814016172507) internal successors, (6987), 2226 states have internal predecessors, (6987), 0 states have call successors, (0), 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-25 19:05:27,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2227 states to 2227 states and 6987 transitions. [2021-11-25 19:05:27,864 INFO L78 Accepts]: Start accepts. Automaton has 2227 states and 6987 transitions. Word has length 30 [2021-11-25 19:05:27,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:05:27,865 INFO L470 AbstractCegarLoop]: Abstraction has 2227 states and 6987 transitions. [2021-11-25 19:05:27,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.9111111111111112) internal successors, (86), 45 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:05:27,865 INFO L276 IsEmpty]: Start isEmpty. Operand 2227 states and 6987 transitions. [2021-11-25 19:05:27,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 19:05:27,871 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:05:27,871 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] [2021-11-25 19:05:27,907 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-11-25 19:05:28,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:05:28,087 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 19:05:28,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:05:28,087 INFO L85 PathProgramCache]: Analyzing trace with hash -2115584710, now seen corresponding path program 14 times [2021-11-25 19:05:28,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:05:28,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401346450] [2021-11-25 19:05:28,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:05:28,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:05:28,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:05:29,192 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:05:29,193 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:05:29,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401346450] [2021-11-25 19:05:29,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401346450] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:05:29,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411559211] [2021-11-25 19:05:29,193 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:05:29,193 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:05:29,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:05:29,197 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:05:29,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-11-25 19:05:29,345 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 19:05:29,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:05:29,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 65 conjunts are in the unsatisfiable core [2021-11-25 19:05:29,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:05:29,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:05:29,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 19:05:29,818 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 25 treesize of output 7 [2021-11-25 19:05:30,070 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 25 treesize of output 7 [2021-11-25 19:05:30,115 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 19:05:30,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:05:30,284 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:05:30,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 42 treesize of output 34 [2021-11-25 19:05:30,591 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:05:30,591 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 106 [2021-11-25 19:05:30,596 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 78 treesize of output 60 [2021-11-25 19:05:31,168 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 19:05:31,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411559211] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:05:31,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1684366940] [2021-11-25 19:05:31,169 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-25 19:05:31,170 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:05:31,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 11] total 39 [2021-11-25 19:05:31,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210021201] [2021-11-25 19:05:31,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:05:31,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-11-25 19:05:31,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:05:31,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-11-25 19:05:31,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1485, Unknown=3, NotChecked=0, Total=1640 [2021-11-25 19:05:31,171 INFO L87 Difference]: Start difference. First operand 2227 states and 6987 transitions. Second operand has 41 states, 40 states have (on average 2.15) internal successors, (86), 40 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:05:41,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:05:41,662 INFO L93 Difference]: Finished difference Result 5593 states and 16753 transitions. [2021-11-25 19:05:41,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2021-11-25 19:05:41,662 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.15) internal successors, (86), 40 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-25 19:05:41,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:05:41,670 INFO L225 Difference]: With dead ends: 5593 [2021-11-25 19:05:41,670 INFO L226 Difference]: Without dead ends: 5457 [2021-11-25 19:05:41,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3004 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=1331, Invalid=11093, Unknown=8, NotChecked=0, Total=12432 [2021-11-25 19:05:41,671 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 468 mSDsluCounter, 2122 mSDsCounter, 0 mSdLazyCounter, 4439 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 5544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 4439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 860 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2021-11-25 19:05:41,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [468 Valid, 625 Invalid, 5544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 4439 Invalid, 0 Unknown, 860 Unchecked, 2.9s Time] [2021-11-25 19:05:41,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5457 states. [2021-11-25 19:05:41,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5457 to 2753. [2021-11-25 19:05:41,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2753 states, 2752 states have (on average 3.271075581395349) internal successors, (9002), 2752 states have internal predecessors, (9002), 0 states have call successors, (0), 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-25 19:05:41,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2753 states to 2753 states and 9002 transitions. [2021-11-25 19:05:41,766 INFO L78 Accepts]: Start accepts. Automaton has 2753 states and 9002 transitions. Word has length 30 [2021-11-25 19:05:41,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:05:41,766 INFO L470 AbstractCegarLoop]: Abstraction has 2753 states and 9002 transitions. [2021-11-25 19:05:41,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.15) internal successors, (86), 40 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:05:41,766 INFO L276 IsEmpty]: Start isEmpty. Operand 2753 states and 9002 transitions. [2021-11-25 19:05:41,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 19:05:41,773 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:05:41,774 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] [2021-11-25 19:05:41,806 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-11-25 19:05:41,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-25 19:05:41,999 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 19:05:41,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:05:41,999 INFO L85 PathProgramCache]: Analyzing trace with hash 710736258, now seen corresponding path program 15 times [2021-11-25 19:05:41,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:05:41,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947049542] [2021-11-25 19:05:41,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:05:41,999 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:05:42,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:05:43,685 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:05:43,685 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:05:43,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947049542] [2021-11-25 19:05:43,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947049542] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:05:43,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219629036] [2021-11-25 19:05:43,686 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 19:05:43,686 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:05:43,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:05:43,686 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:05:43,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-11-25 19:05:43,838 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 19:05:43,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:05:43,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 60 conjunts are in the unsatisfiable core [2021-11-25 19:05:43,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:05:44,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:05:44,242 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 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 19:05:44,362 INFO L354 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2021-11-25 19:05:44,362 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 23 treesize of output 10 [2021-11-25 19:05:44,562 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 23 treesize of output 7 [2021-11-25 19:05:44,735 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 19:05:44,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:05:45,025 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:05:45,025 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 53 treesize of output 37 [2021-11-25 19:05:45,384 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:05:45,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, 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 106 [2021-11-25 19:05:45,389 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 78 treesize of output 60 [2021-11-25 19:05:46,209 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 19:05:46,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219629036] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:05:46,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [531463036] [2021-11-25 19:05:46,209 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java: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-25 19:05:46,210 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:05:46,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 13] total 43 [2021-11-25 19:05:46,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194497184] [2021-11-25 19:05:46,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:05:46,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-11-25 19:05:46,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:05:46,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-11-25 19:05:46,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1774, Unknown=1, NotChecked=0, Total=1980 [2021-11-25 19:05:46,211 INFO L87 Difference]: Start difference. First operand 2753 states and 9002 transitions. Second operand has 45 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 44 states have internal predecessors, (85), 0 states have call successors, (0), 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-25 19:05:52,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:05:52,275 INFO L93 Difference]: Finished difference Result 3940 states and 12606 transitions. [2021-11-25 19:05:52,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2021-11-25 19:05:52,275 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 44 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-25 19:05:52,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:05:52,281 INFO L225 Difference]: With dead ends: 3940 [2021-11-25 19:05:52,281 INFO L226 Difference]: Without dead ends: 3798 [2021-11-25 19:05:52,282 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1977 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=982, Invalid=7758, Unknown=2, NotChecked=0, Total=8742 [2021-11-25 19:05:52,282 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 531 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 2094 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 2846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 2094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 575 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-25 19:05:52,282 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [531 Valid, 329 Invalid, 2846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 2094 Invalid, 0 Unknown, 575 Unchecked, 1.5s Time] [2021-11-25 19:05:52,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3798 states. [2021-11-25 19:05:52,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3798 to 2940. [2021-11-25 19:05:52,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2940 states, 2939 states have (on average 3.2834297380061246) internal successors, (9650), 2939 states have internal predecessors, (9650), 0 states have call successors, (0), 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-25 19:05:52,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2940 states to 2940 states and 9650 transitions. [2021-11-25 19:05:52,360 INFO L78 Accepts]: Start accepts. Automaton has 2940 states and 9650 transitions. Word has length 30 [2021-11-25 19:05:52,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:05:52,361 INFO L470 AbstractCegarLoop]: Abstraction has 2940 states and 9650 transitions. [2021-11-25 19:05:52,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 44 states have internal predecessors, (85), 0 states have call successors, (0), 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-25 19:05:52,361 INFO L276 IsEmpty]: Start isEmpty. Operand 2940 states and 9650 transitions. [2021-11-25 19:05:52,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 19:05:52,369 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:05:52,369 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] [2021-11-25 19:05:52,397 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-11-25 19:05:52,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-11-25 19:05:52,587 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 19:05:52,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:05:52,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1241257864, now seen corresponding path program 16 times [2021-11-25 19:05:52,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:05:52,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019535989] [2021-11-25 19:05:52,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:05:52,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:05:52,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:05:54,344 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:05:54,344 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:05:54,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019535989] [2021-11-25 19:05:54,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019535989] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:05:54,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922615702] [2021-11-25 19:05:54,345 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 19:05:54,345 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:05:54,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:05:54,350 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:05:54,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-11-25 19:05:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:05:54,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 76 conjunts are in the unsatisfiable core [2021-11-25 19:05:54,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:05:55,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:05:55,072 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 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 19:05:55,230 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 23 treesize of output 7 [2021-11-25 19:05:55,621 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 19 treesize of output 7 [2021-11-25 19:05:55,675 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:05:55,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:05:55,860 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:05:55,860 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 42 treesize of output 34 [2021-11-25 19:05:56,313 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:05:56,314 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 106 [2021-11-25 19:05:56,319 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 78 treesize of output 60 [2021-11-25 19:05:57,323 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:05:57,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922615702] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:05:57,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1512521648] [2021-11-25 19:05:57,324 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-25 19:05:57,324 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:05:57,324 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 15] total 47 [2021-11-25 19:05:57,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175672579] [2021-11-25 19:05:57,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:05:57,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2021-11-25 19:05:57,325 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:05:57,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-11-25 19:05:57,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=2128, Unknown=2, NotChecked=0, Total=2352 [2021-11-25 19:05:57,326 INFO L87 Difference]: Start difference. First operand 2940 states and 9650 transitions. Second operand has 49 states, 48 states have (on average 1.8125) internal successors, (87), 48 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:06:21,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:06:21,153 INFO L93 Difference]: Finished difference Result 5958 states and 18485 transitions. [2021-11-25 19:06:21,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2021-11-25 19:06:21,153 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.8125) internal successors, (87), 48 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-25 19:06:21,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:06:21,162 INFO L225 Difference]: With dead ends: 5958 [2021-11-25 19:06:21,162 INFO L226 Difference]: Without dead ends: 5881 [2021-11-25 19:06:21,163 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 31 SyntacticMatches, 18 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5762 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=2548, Invalid=16354, Unknown=4, NotChecked=0, Total=18906 [2021-11-25 19:06:21,164 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 1018 mSDsluCounter, 2136 mSDsCounter, 0 mSdLazyCounter, 4930 mSolverCounterSat, 519 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1018 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 5947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 519 IncrementalHoareTripleChecker+Valid, 4930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 498 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:06:21,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1018 Valid, 697 Invalid, 5947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [519 Valid, 4930 Invalid, 0 Unknown, 498 Unchecked, 4.1s Time] [2021-11-25 19:06:21,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5881 states. [2021-11-25 19:06:21,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5881 to 3331. [2021-11-25 19:06:21,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3331 states, 3330 states have (on average 3.304804804804805) internal successors, (11005), 3330 states have internal predecessors, (11005), 0 states have call successors, (0), 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-25 19:06:21,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3331 states to 3331 states and 11005 transitions. [2021-11-25 19:06:21,255 INFO L78 Accepts]: Start accepts. Automaton has 3331 states and 11005 transitions. Word has length 30 [2021-11-25 19:06:21,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:06:21,256 INFO L470 AbstractCegarLoop]: Abstraction has 3331 states and 11005 transitions. [2021-11-25 19:06:21,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 1.8125) internal successors, (87), 48 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:06:21,256 INFO L276 IsEmpty]: Start isEmpty. Operand 3331 states and 11005 transitions. [2021-11-25 19:06:21,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 19:06:21,265 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:06:21,265 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] [2021-11-25 19:06:21,302 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2021-11-25 19:06:21,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-11-25 19:06:21,478 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 19:06:21,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:06:21,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1306936548, now seen corresponding path program 17 times [2021-11-25 19:06:21,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:06:21,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966362191] [2021-11-25 19:06:21,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:06:21,479 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:06:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:06:22,814 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:06:22,814 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:06:22,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966362191] [2021-11-25 19:06:22,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966362191] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:06:22,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694450959] [2021-11-25 19:06:22,815 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:06:22,815 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:06:22,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:06:22,815 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:06:22,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-11-25 19:06:22,971 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 19:06:22,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:06:22,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 70 conjunts are in the unsatisfiable core [2021-11-25 19:06:22,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:06:22,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:06:22,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:06:23,025 INFO L354 Elim1Store]: treesize reduction 43, result has 41.9 percent of original size [2021-11-25 19:06:23,026 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 3 case distinctions, treesize of input 15 treesize of output 36 [2021-11-25 19:06:23,108 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 15 treesize of output 11 [2021-11-25 19:06:23,160 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 15 treesize of output 11 [2021-11-25 19:06:23,220 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 19:06:23,221 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-25 19:06:23,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 19:06:23,293 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 19:06:23,352 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 6 treesize of output 5 [2021-11-25 19:06:23,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:06:23,533 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 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 19:06:23,632 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 23 treesize of output 7 [2021-11-25 19:06:23,841 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 23 treesize of output 7 [2021-11-25 19:06:23,897 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 19:06:23,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:06:24,007 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:06:24,010 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 42 treesize of output 34 [2021-11-25 19:06:25,875 INFO L354 Elim1Store]: treesize reduction 28, result has 54.8 percent of original size [2021-11-25 19:06:25,876 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 167 treesize of output 124 [2021-11-25 19:06:25,910 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:06:25,910 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4105 treesize of output 3937 [2021-11-25 19:06:25,969 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:06:25,970 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 3876 treesize of output 3736 [2021-11-25 19:06:26,028 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:06:26,030 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 3720 treesize of output 3424 [2021-11-25 19:06:26,082 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 3306 treesize of output 2730 [2021-11-25 19:09:18,825 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 2 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 19:09:18,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694450959] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:09:18,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [810253684] [2021-11-25 19:09:18,825 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-25 19:09:18,826 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:09:18,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 42 [2021-11-25 19:09:18,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368617323] [2021-11-25 19:09:18,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:09:18,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-11-25 19:09:18,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:09:18,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-11-25 19:09:18,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1706, Unknown=13, NotChecked=0, Total=1892 [2021-11-25 19:09:18,828 INFO L87 Difference]: Start difference. First operand 3331 states and 11005 transitions. Second operand has 44 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 43 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:09:24,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:09:24,925 INFO L93 Difference]: Finished difference Result 4506 states and 14081 transitions. [2021-11-25 19:09:24,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-11-25 19:09:24,926 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 43 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-25 19:09:24,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:09:24,933 INFO L225 Difference]: With dead ends: 4506 [2021-11-25 19:09:24,933 INFO L226 Difference]: Without dead ends: 4431 [2021-11-25 19:09:24,934 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1373 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=705, Invalid=6232, Unknown=35, NotChecked=0, Total=6972 [2021-11-25 19:09:24,934 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 337 mSDsluCounter, 1805 mSDsCounter, 0 mSdLazyCounter, 2610 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 4119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 2610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1430 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-25 19:09:24,935 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [337 Valid, 571 Invalid, 4119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 2610 Invalid, 0 Unknown, 1430 Unchecked, 1.7s Time] [2021-11-25 19:09:24,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4431 states. [2021-11-25 19:09:24,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4431 to 3303. [2021-11-25 19:09:25,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3303 states, 3302 states have (on average 3.313143549364022) internal successors, (10940), 3302 states have internal predecessors, (10940), 0 states have call successors, (0), 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-25 19:09:25,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3303 states to 3303 states and 10940 transitions. [2021-11-25 19:09:25,011 INFO L78 Accepts]: Start accepts. Automaton has 3303 states and 10940 transitions. Word has length 30 [2021-11-25 19:09:25,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:09:25,012 INFO L470 AbstractCegarLoop]: Abstraction has 3303 states and 10940 transitions. [2021-11-25 19:09:25,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 43 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:09:25,012 INFO L276 IsEmpty]: Start isEmpty. Operand 3303 states and 10940 transitions. [2021-11-25 19:09:25,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 19:09:25,022 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:09:25,022 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] [2021-11-25 19:09:25,056 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2021-11-25 19:09:25,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:09:25,250 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 19:09:25,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:09:25,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1591382784, now seen corresponding path program 18 times [2021-11-25 19:09:25,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:09:25,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656017103] [2021-11-25 19:09:25,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:09:25,251 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:09:25,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:09:26,512 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:09:26,512 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:09:26,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656017103] [2021-11-25 19:09:26,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656017103] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:09:26,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679849650] [2021-11-25 19:09:26,512 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 19:09:26,513 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:09:26,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:09:26,514 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:09:26,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-11-25 19:09:26,681 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 19:09:26,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:09:26,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 66 conjunts are in the unsatisfiable core [2021-11-25 19:09:26,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:09:27,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:09:27,229 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 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 19:09:27,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:09:27,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:09:27,783 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-25 19:09:27,784 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 42 [2021-11-25 19:09:28,810 INFO L354 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2021-11-25 19:09:28,811 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 44 treesize of output 10 [2021-11-25 19:09:28,864 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 19:09:28,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:09:28,978 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1724 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1724) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) c_~t~0) (+ c_~N~0 1))) (forall ((v_ArrVal_1724 (Array Int Int))) (<= c_~N~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1724) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) c_~t~0)))) is different from false [2021-11-25 19:09:28,990 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_1724 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1724) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) c_~t~0) (+ c_~N~0 1))) (forall ((v_ArrVal_1724 (Array Int Int))) (<= c_~N~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1724) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) c_~t~0)))) (<= c_~n2~0 c_~q2_back~0) (< c_~q2_back~0 0)) is different from false [2021-11-25 19:09:29,480 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:09:29,480 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 276 treesize of output 328 [2021-11-25 19:09:29,518 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:09:29,519 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 328 treesize of output 340 [2021-11-25 19:09:29,538 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 133 treesize of output 121 [2021-11-25 19:09:29,551 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 121 treesize of output 109 [2021-11-25 19:09:31,992 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2021-11-25 19:09:31,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679849650] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:09:31,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1663234039] [2021-11-25 19:09:31,993 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java: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-25 19:09:31,994 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:09:31,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 14] total 45 [2021-11-25 19:09:31,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389634072] [2021-11-25 19:09:31,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:09:31,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-11-25 19:09:31,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:09:31,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-11-25 19:09:31,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1818, Unknown=5, NotChecked=174, Total=2162 [2021-11-25 19:09:31,996 INFO L87 Difference]: Start difference. First operand 3303 states and 10940 transitions. Second operand has 47 states, 46 states have (on average 1.8695652173913044) internal successors, (86), 46 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:09:36,035 WARN L838 $PredicateComparison]: unable to prove that (and (or (and (<= 0 c_~t~0) (= (* 4 c_~q2_front~0) (* 4 c_~q2_back~0)) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (= (* 4 c_~q1_front~0) (* 4 c_~q1_back~0)) (<= c_~t~0 0) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (<= 1 c_~q2_back~0) (< c_~q2_back~0 0)) (forall ((v_ArrVal_1724 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1724) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) c_~t~0) (+ c_~N~0 1))) (forall ((v_ArrVal_1724 (Array Int Int))) (<= c_~N~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1724) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) c_~t~0)))) is different from false [2021-11-25 19:09:47,672 WARN L227 SmtUtils]: Spent 8.05s on a formula simplification. DAG size of input: 57 DAG size of output: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 19:09:49,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:09:49,307 INFO L93 Difference]: Finished difference Result 4213 states and 13332 transitions. [2021-11-25 19:09:49,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-11-25 19:09:49,307 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.8695652173913044) internal successors, (86), 46 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-25 19:09:49,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:09:49,313 INFO L225 Difference]: With dead ends: 4213 [2021-11-25 19:09:49,314 INFO L226 Difference]: Without dead ends: 4193 [2021-11-25 19:09:49,314 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 32 SyntacticMatches, 8 SemanticMatches, 83 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1457 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=585, Invalid=6053, Unknown=16, NotChecked=486, Total=7140 [2021-11-25 19:09:49,315 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 280 mSDsluCounter, 1225 mSDsCounter, 0 mSdLazyCounter, 1392 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 2850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1387 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:09:49,315 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 453 Invalid, 2850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1392 Invalid, 0 Unknown, 1387 Unchecked, 1.0s Time] [2021-11-25 19:09:49,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4193 states. [2021-11-25 19:09:49,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4193 to 3357. [2021-11-25 19:09:49,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3357 states, 3356 states have (on average 3.3045292014302743) internal successors, (11090), 3356 states have internal predecessors, (11090), 0 states have call successors, (0), 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-25 19:09:49,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3357 states to 3357 states and 11090 transitions. [2021-11-25 19:09:49,384 INFO L78 Accepts]: Start accepts. Automaton has 3357 states and 11090 transitions. Word has length 30 [2021-11-25 19:09:49,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:09:49,385 INFO L470 AbstractCegarLoop]: Abstraction has 3357 states and 11090 transitions. [2021-11-25 19:09:49,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.8695652173913044) internal successors, (86), 46 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:09:49,385 INFO L276 IsEmpty]: Start isEmpty. Operand 3357 states and 11090 transitions. [2021-11-25 19:09:49,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 19:09:49,394 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:09:49,394 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] [2021-11-25 19:09:49,421 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2021-11-25 19:09:49,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:09:49,615 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 19:09:49,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:09:49,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1502932344, now seen corresponding path program 19 times [2021-11-25 19:09:49,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:09:49,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423512784] [2021-11-25 19:09:49,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:09:49,615 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:09:49,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:09:51,108 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:09:51,108 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:09:51,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423512784] [2021-11-25 19:09:51,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423512784] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:09:51,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368929015] [2021-11-25 19:09:51,108 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 19:09:51,108 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:09:51,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:09:51,109 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:09:51,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-11-25 19:09:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:09:51,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 79 conjunts are in the unsatisfiable core [2021-11-25 19:09:51,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:09:52,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:09:52,009 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 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 19:09:52,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:09:52,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:09:52,900 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-25 19:09:52,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 42 [2021-11-25 19:09:53,340 INFO L354 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2021-11-25 19:09:53,340 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 14 [2021-11-25 19:09:53,392 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:09:53,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:09:53,557 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1786 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1786) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))))) (or (= .cse0 0) (let ((.cse1 (+ c_~t~0 .cse0))) (and (< .cse1 (+ c_~N~0 1)) (<= c_~N~0 .cse1)))))) is different from false [2021-11-25 19:09:54,373 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:09:54,373 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 343 treesize of output 387 [2021-11-25 19:09:54,405 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:09:54,405 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 248 treesize of output 254 [2021-11-25 19:09:54,417 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 187 treesize of output 151 [2021-11-25 19:10:03,352 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:10:03,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368929015] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:10:03,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [660339721] [2021-11-25 19:10:03,352 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-25 19:10:03,354 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:10:03,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 49 [2021-11-25 19:10:03,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595961453] [2021-11-25 19:10:03,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:10:03,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2021-11-25 19:10:03,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:10:03,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-11-25 19:10:03,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=2207, Unknown=9, NotChecked=96, Total=2550 [2021-11-25 19:10:03,355 INFO L87 Difference]: Start difference. First operand 3357 states and 11090 transitions. Second operand has 51 states, 50 states have (on average 1.76) internal successors, (88), 50 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-25 19:10:16,074 WARN L838 $PredicateComparison]: unable to prove that (and (or (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (and (<= 0 c_~t~0) (= (* 4 c_~q2_front~0) (* 4 c_~q2_back~0)) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (= (* 4 c_~q1_front~0) (* 4 c_~q1_back~0)) (<= c_~t~0 0) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (<= c_~n1~0 (+ c_~q1_back~0 1)) (< c_~q1_back~0 0) (<= 1 c_~q2_back~0) (< c_~q2_back~0 0)) (forall ((v_ArrVal_1786 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1786) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))))) (or (= .cse0 0) (let ((.cse1 (+ c_~t~0 .cse0))) (and (< .cse1 (+ c_~N~0 1)) (<= c_~N~0 .cse1))))))) is different from false [2021-11-25 19:10:18,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:10:18,740 INFO L93 Difference]: Finished difference Result 5351 states and 16498 transitions. [2021-11-25 19:10:18,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2021-11-25 19:10:18,741 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.76) internal successors, (88), 50 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 30 [2021-11-25 19:10:18,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:10:18,749 INFO L225 Difference]: With dead ends: 5351 [2021-11-25 19:10:18,749 INFO L226 Difference]: Without dead ends: 5312 [2021-11-25 19:10:18,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 37 SyntacticMatches, 13 SemanticMatches, 122 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4218 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=1439, Invalid=13319, Unknown=12, NotChecked=482, Total=15252 [2021-11-25 19:10:18,751 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 489 mSDsluCounter, 1845 mSDsCounter, 0 mSdLazyCounter, 2015 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 4267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 2015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2107 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-25 19:10:18,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [489 Valid, 691 Invalid, 4267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 2015 Invalid, 0 Unknown, 2107 Unchecked, 1.8s Time] [2021-11-25 19:10:18,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5312 states. [2021-11-25 19:10:18,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5312 to 3456. [2021-11-25 19:10:18,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3456 states, 3455 states have (on average 3.314037626628075) internal successors, (11450), 3455 states have internal predecessors, (11450), 0 states have call successors, (0), 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-25 19:10:18,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3456 states to 3456 states and 11450 transitions. [2021-11-25 19:10:18,827 INFO L78 Accepts]: Start accepts. Automaton has 3456 states and 11450 transitions. Word has length 30 [2021-11-25 19:10:18,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:10:18,828 INFO L470 AbstractCegarLoop]: Abstraction has 3456 states and 11450 transitions. [2021-11-25 19:10:18,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.76) internal successors, (88), 50 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-25 19:10:18,828 INFO L276 IsEmpty]: Start isEmpty. Operand 3456 states and 11450 transitions. [2021-11-25 19:10:18,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 19:10:18,834 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:10:18,834 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] [2021-11-25 19:10:18,854 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2021-11-25 19:10:19,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:10:19,034 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 19:10:19,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:10:19,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1381052676, now seen corresponding path program 20 times [2021-11-25 19:10:19,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:10:19,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824280147] [2021-11-25 19:10:19,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:10:19,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:10:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:10:20,507 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:10:20,507 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:10:20,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824280147] [2021-11-25 19:10:20,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824280147] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:10:20,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442919484] [2021-11-25 19:10:20,507 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:10:20,507 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:10:20,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:10:20,508 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:10:20,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-11-25 19:10:20,665 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 19:10:20,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:10:20,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 69 conjunts are in the unsatisfiable core [2021-11-25 19:10:20,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:10:21,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:10:21,254 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 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 19:10:21,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:10:21,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:10:21,812 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-25 19:10:21,812 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 42 [2021-11-25 19:10:24,077 INFO L354 Elim1Store]: treesize reduction 21, result has 4.5 percent of original size [2021-11-25 19:10:24,077 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 46 treesize of output 10 [2021-11-25 19:10:24,133 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 19:10:24,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:10:24,261 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1848 (Array Int Int))) (<= c_~N~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1848) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) c_~t~0))) (forall ((v_ArrVal_1848 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1848) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) c_~t~0) (+ c_~N~0 1)))) is different from false [2021-11-25 19:10:24,295 WARN L838 $PredicateComparison]: unable to prove that (forall ((~q2~0.offset Int)) (or (not (= (select (select |c_#memory_int| c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_back~0 4))) |c_thread2Thread1of1ForFork2_~j~0#1|)) (and (forall ((v_ArrVal_1848 (Array Int Int))) (<= c_~N~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1848) c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_front~0 4))) c_~t~0))) (forall ((v_ArrVal_1848 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1848) c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_front~0 4))) c_~t~0) (+ c_~N~0 1)))))) is different from false [2021-11-25 19:10:24,784 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:10:24,784 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 362 treesize of output 406 [2021-11-25 19:10:24,806 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:10:24,807 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 406 treesize of output 412 [2021-11-25 19:10:24,821 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 205 treesize of output 193 [2021-11-25 19:10:24,832 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 193 treesize of output 169 [2021-11-25 19:10:28,420 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2021-11-25 19:10:28,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442919484] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:10:28,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [116878332] [2021-11-25 19:10:28,421 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-25 19:10:28,421 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:10:28,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 13] total 44 [2021-11-25 19:10:28,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108335457] [2021-11-25 19:10:28,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:10:28,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-11-25 19:10:28,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:10:28,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-11-25 19:10:28,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1740, Unknown=5, NotChecked=170, Total=2070 [2021-11-25 19:10:28,423 INFO L87 Difference]: Start difference. First operand 3456 states and 11450 transitions. Second operand has 46 states, 45 states have (on average 1.9111111111111112) internal successors, (86), 45 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:10:36,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:10:36,545 INFO L93 Difference]: Finished difference Result 4324 states and 13695 transitions. [2021-11-25 19:10:36,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-11-25 19:10:36,546 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.9111111111111112) internal successors, (86), 45 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-25 19:10:36,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:10:36,552 INFO L225 Difference]: With dead ends: 4324 [2021-11-25 19:10:36,553 INFO L226 Difference]: Without dead ends: 4268 [2021-11-25 19:10:36,553 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 37 SyntacticMatches, 6 SemanticMatches, 82 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1436 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=659, Invalid=5963, Unknown=28, NotChecked=322, Total=6972 [2021-11-25 19:10:36,554 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 449 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 1580 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 3330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1590 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:10:36,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [449 Valid, 571 Invalid, 3330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1580 Invalid, 0 Unknown, 1590 Unchecked, 1.2s Time] [2021-11-25 19:10:36,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4268 states. [2021-11-25 19:10:36,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4268 to 3523. [2021-11-25 19:10:36,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3523 states, 3522 states have (on average 3.302952867688813) internal successors, (11633), 3522 states have internal predecessors, (11633), 0 states have call successors, (0), 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-25 19:10:36,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3523 states to 3523 states and 11633 transitions. [2021-11-25 19:10:36,620 INFO L78 Accepts]: Start accepts. Automaton has 3523 states and 11633 transitions. Word has length 30 [2021-11-25 19:10:36,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:10:36,621 INFO L470 AbstractCegarLoop]: Abstraction has 3523 states and 11633 transitions. [2021-11-25 19:10:36,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.9111111111111112) internal successors, (86), 45 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:10:36,621 INFO L276 IsEmpty]: Start isEmpty. Operand 3523 states and 11633 transitions. [2021-11-25 19:10:36,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 19:10:36,630 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:10:36,630 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] [2021-11-25 19:10:36,659 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2021-11-25 19:10:36,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:10:36,847 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 19:10:36,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:10:36,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1595884226, now seen corresponding path program 21 times [2021-11-25 19:10:36,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:10:36,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600665179] [2021-11-25 19:10:36,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:10:36,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:10:36,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:10:38,161 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:10:38,161 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:10:38,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600665179] [2021-11-25 19:10:38,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600665179] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:10:38,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431910550] [2021-11-25 19:10:38,161 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 19:10:38,162 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:10:38,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:10:38,162 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:10:38,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2021-11-25 19:10:38,361 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 19:10:38,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:10:38,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 69 conjunts are in the unsatisfiable core [2021-11-25 19:10:38,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:10:38,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:10:38,422 INFO L354 Elim1Store]: treesize reduction 63, result has 32.3 percent of original size [2021-11-25 19:10:38,422 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 3 case distinctions, treesize of input 15 treesize of output 35 [2021-11-25 19:10:38,524 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-25 19:10:38,525 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 16 treesize of output 18 [2021-11-25 19:10:39,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:10:39,020 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 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 19:10:39,340 INFO L354 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2021-11-25 19:10:39,341 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 37 treesize of output 44 [2021-11-25 19:10:39,351 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 27 treesize of output 15 [2021-11-25 19:10:39,567 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:10:39,568 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 23 treesize of output 23 [2021-11-25 19:10:39,751 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 19:10:39,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:10:40,649 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:10:40,649 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 351 treesize of output 395 [2021-11-25 19:10:40,694 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:10:40,694 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 256 treesize of output 262 [2021-11-25 19:10:40,711 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 195 treesize of output 159 [2021-11-25 19:10:45,084 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 19:10:45,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431910550] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:10:45,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1586939044] [2021-11-25 19:10:45,085 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-25 19:10:45,086 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:10:45,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 14] total 45 [2021-11-25 19:10:45,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701804848] [2021-11-25 19:10:45,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:10:45,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-11-25 19:10:45,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:10:45,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-11-25 19:10:45,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=2003, Unknown=17, NotChecked=0, Total=2162 [2021-11-25 19:10:45,087 INFO L87 Difference]: Start difference. First operand 3523 states and 11633 transitions. Second operand has 47 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 46 states have internal predecessors, (85), 0 states have call successors, (0), 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-25 19:10:47,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:10:47,504 INFO L93 Difference]: Finished difference Result 3820 states and 12384 transitions. [2021-11-25 19:10:47,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-11-25 19:10:47,504 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 46 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-25 19:10:47,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:10:47,511 INFO L225 Difference]: With dead ends: 3820 [2021-11-25 19:10:47,511 INFO L226 Difference]: Without dead ends: 3782 [2021-11-25 19:10:47,511 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=307, Invalid=4095, Unknown=20, NotChecked=0, Total=4422 [2021-11-25 19:10:47,512 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 266 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 2335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1355 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 19:10:47,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [266 Valid, 310 Invalid, 2335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 953 Invalid, 0 Unknown, 1355 Unchecked, 0.6s Time] [2021-11-25 19:10:47,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3782 states. [2021-11-25 19:10:47,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3782 to 3567. [2021-11-25 19:10:47,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3567 states, 3566 states have (on average 3.3017386427369604) internal successors, (11774), 3566 states have internal predecessors, (11774), 0 states have call successors, (0), 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-25 19:10:47,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3567 states to 3567 states and 11774 transitions. [2021-11-25 19:10:47,569 INFO L78 Accepts]: Start accepts. Automaton has 3567 states and 11774 transitions. Word has length 30 [2021-11-25 19:10:47,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:10:47,569 INFO L470 AbstractCegarLoop]: Abstraction has 3567 states and 11774 transitions. [2021-11-25 19:10:47,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 46 states have internal predecessors, (85), 0 states have call successors, (0), 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-25 19:10:47,570 INFO L276 IsEmpty]: Start isEmpty. Operand 3567 states and 11774 transitions. [2021-11-25 19:10:47,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 19:10:47,575 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:10:47,576 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] [2021-11-25 19:10:47,599 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2021-11-25 19:10:47,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:10:47,776 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 19:10:47,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:10:47,777 INFO L85 PathProgramCache]: Analyzing trace with hash -262862580, now seen corresponding path program 22 times [2021-11-25 19:10:47,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:10:47,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663707517] [2021-11-25 19:10:47,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:10:47,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:10:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:10:49,572 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:10:49,572 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:10:49,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663707517] [2021-11-25 19:10:49,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663707517] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:10:49,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748134609] [2021-11-25 19:10:49,572 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 19:10:49,572 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:10:49,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:10:49,573 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:10:49,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2021-11-25 19:10:49,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:10:49,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 65 conjunts are in the unsatisfiable core [2021-11-25 19:10:49,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:10:50,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:10:50,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 19:10:50,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:10:50,394 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 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 19:10:50,702 INFO L354 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2021-11-25 19:10:50,703 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 42 treesize of output 10 [2021-11-25 19:10:50,917 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 19:10:50,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:10:51,765 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:10:51,765 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 2072 treesize of output 1884 [2021-11-25 19:10:51,807 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:10:51,808 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 1772 treesize of output 1604 [2021-11-25 19:10:51,843 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:10:51,844 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 1556 treesize of output 1172 [2021-11-25 19:11:00,184 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 19:11:00,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748134609] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:11:00,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [835766168] [2021-11-25 19:11:00,184 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-25 19:11:00,186 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:11:00,186 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 14] total 45 [2021-11-25 19:11:00,186 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227153905] [2021-11-25 19:11:00,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:11:00,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-11-25 19:11:00,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:11:00,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-11-25 19:11:00,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1959, Unknown=9, NotChecked=0, Total=2162 [2021-11-25 19:11:00,188 INFO L87 Difference]: Start difference. First operand 3567 states and 11774 transitions. Second operand has 47 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 46 states have internal predecessors, (85), 0 states have call successors, (0), 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-25 19:11:07,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:11:07,321 INFO L93 Difference]: Finished difference Result 5244 states and 16074 transitions. [2021-11-25 19:11:07,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-11-25 19:11:07,322 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 46 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-25 19:11:07,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:11:07,330 INFO L225 Difference]: With dead ends: 5244 [2021-11-25 19:11:07,330 INFO L226 Difference]: Without dead ends: 5144 [2021-11-25 19:11:07,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1738 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=776, Invalid=7389, Unknown=25, NotChecked=0, Total=8190 [2021-11-25 19:11:07,331 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 486 mSDsluCounter, 1979 mSDsCounter, 0 mSdLazyCounter, 3067 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 4952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 3067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1760 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:11:07,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [486 Valid, 488 Invalid, 4952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 3067 Invalid, 0 Unknown, 1760 Unchecked, 2.2s Time] [2021-11-25 19:11:07,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5144 states. [2021-11-25 19:11:07,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5144 to 3648. [2021-11-25 19:11:07,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3648 states, 3647 states have (on average 3.315601864546202) internal successors, (12092), 3647 states have internal predecessors, (12092), 0 states have call successors, (0), 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-25 19:11:07,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3648 states to 3648 states and 12092 transitions. [2021-11-25 19:11:07,422 INFO L78 Accepts]: Start accepts. Automaton has 3648 states and 12092 transitions. Word has length 30 [2021-11-25 19:11:07,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:11:07,422 INFO L470 AbstractCegarLoop]: Abstraction has 3648 states and 12092 transitions. [2021-11-25 19:11:07,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 46 states have internal predecessors, (85), 0 states have call successors, (0), 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-25 19:11:07,422 INFO L276 IsEmpty]: Start isEmpty. Operand 3648 states and 12092 transitions. [2021-11-25 19:11:07,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 19:11:07,428 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:11:07,429 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] [2021-11-25 19:11:07,448 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2021-11-25 19:11:07,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-11-25 19:11:07,629 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 19:11:07,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:11:07,630 INFO L85 PathProgramCache]: Analyzing trace with hash 333337710, now seen corresponding path program 23 times [2021-11-25 19:11:07,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:11:07,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217506353] [2021-11-25 19:11:07,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:11:07,630 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:11:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:11:09,139 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:11:09,140 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:11:09,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217506353] [2021-11-25 19:11:09,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217506353] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:11:09,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800800299] [2021-11-25 19:11:09,140 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:11:09,140 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:11:09,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:11:09,141 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:11:09,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2021-11-25 19:11:09,316 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 19:11:09,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:11:09,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 62 conjunts are in the unsatisfiable core [2021-11-25 19:11:09,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:11:09,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:11:09,777 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 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 19:11:09,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:11:09,913 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 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 19:11:10,371 INFO L354 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2021-11-25 19:11:10,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 44 treesize of output 10 [2021-11-25 19:11:10,434 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 19:11:10,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:11:11,384 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:11:11,384 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 663 treesize of output 675 [2021-11-25 19:11:11,416 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:11:11,416 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 563 treesize of output 479 [2021-11-25 19:11:11,447 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:11:11,447 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 410 treesize of output 392 [2021-11-25 19:12:20,261 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 19:12:20,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800800299] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:12:20,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [5727185] [2021-11-25 19:12:20,262 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-25 19:12:20,262 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:12:20,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 12] total 41 [2021-11-25 19:12:20,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309066322] [2021-11-25 19:12:20,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:12:20,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-11-25 19:12:20,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:12:20,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-11-25 19:12:20,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1645, Unknown=5, NotChecked=0, Total=1806 [2021-11-25 19:12:20,264 INFO L87 Difference]: Start difference. First operand 3648 states and 12092 transitions. Second operand has 43 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 42 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:46,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:12:46,789 INFO L93 Difference]: Finished difference Result 4716 states and 15062 transitions. [2021-11-25 19:12:46,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-11-25 19:12:46,790 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 42 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-25 19:12:46,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:12:46,798 INFO L225 Difference]: With dead ends: 4716 [2021-11-25 19:12:46,798 INFO L226 Difference]: Without dead ends: 4640 [2021-11-25 19:12:46,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 27.2s TimeCoverageRelationStatistics Valid=587, Invalid=5978, Unknown=77, NotChecked=0, Total=6642 [2021-11-25 19:12:46,799 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 288 mSDsluCounter, 1334 mSDsCounter, 0 mSdLazyCounter, 1512 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 3097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1501 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:12:46,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [288 Valid, 536 Invalid, 3097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1512 Invalid, 0 Unknown, 1501 Unchecked, 1.2s Time] [2021-11-25 19:12:46,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4640 states. [2021-11-25 19:12:46,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4640 to 3888. [2021-11-25 19:12:46,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3888 states, 3887 states have (on average 3.325958322613841) internal successors, (12928), 3887 states have internal predecessors, (12928), 0 states have call successors, (0), 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-25 19:12:46,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3888 states to 3888 states and 12928 transitions. [2021-11-25 19:12:46,889 INFO L78 Accepts]: Start accepts. Automaton has 3888 states and 12928 transitions. Word has length 30 [2021-11-25 19:12:46,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:12:46,889 INFO L470 AbstractCegarLoop]: Abstraction has 3888 states and 12928 transitions. [2021-11-25 19:12:46,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 42 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:46,889 INFO L276 IsEmpty]: Start isEmpty. Operand 3888 states and 12928 transitions. [2021-11-25 19:12:46,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 19:12:46,898 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:12:46,898 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] [2021-11-25 19:12:46,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2021-11-25 19:12:47,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-11-25 19:12:47,099 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 19:12:47,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:12:47,099 INFO L85 PathProgramCache]: Analyzing trace with hash -246371714, now seen corresponding path program 24 times [2021-11-25 19:12:47,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:12:47,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375686738] [2021-11-25 19:12:47,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:12:47,100 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:12:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:12:49,349 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:12:49,350 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:12:49,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375686738] [2021-11-25 19:12:49,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375686738] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:12:49,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106311481] [2021-11-25 19:12:49,350 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 19:12:49,350 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:12:49,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:12:49,351 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:12:49,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2021-11-25 19:12:49,526 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 19:12:49,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:12:49,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 60 conjunts are in the unsatisfiable core [2021-11-25 19:12:49,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:12:50,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:12:50,029 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 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 19:12:50,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:12:50,222 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 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 19:12:50,695 INFO L354 Elim1Store]: treesize reduction 54, result has 5.3 percent of original size [2021-11-25 19:12:50,695 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 13 [2021-11-25 19:12:50,896 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 19:12:50,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:12:51,821 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:12:51,822 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 1208 treesize of output 1148 [2021-11-25 19:12:51,860 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:12:51,861 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 1036 treesize of output 844 [2021-11-25 19:12:51,893 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:12:51,894 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 796 treesize of output 724 [2021-11-25 19:13:03,845 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 19:13:03,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106311481] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:13:03,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1897981042] [2021-11-25 19:13:03,845 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-25 19:13:03,846 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:13:03,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 14] total 46 [2021-11-25 19:13:03,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737352857] [2021-11-25 19:13:03,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:13:03,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-11-25 19:13:03,847 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:13:03,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-11-25 19:13:03,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=2022, Unknown=3, NotChecked=0, Total=2256 [2021-11-25 19:13:03,848 INFO L87 Difference]: Start difference. First operand 3888 states and 12928 transitions. Second operand has 48 states, 47 states have (on average 1.8085106382978724) internal successors, (85), 47 states have internal predecessors, (85), 0 states have call successors, (0), 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-25 19:13:09,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:13:09,641 INFO L93 Difference]: Finished difference Result 4512 states and 14862 transitions. [2021-11-25 19:13:09,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-11-25 19:13:09,641 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.8085106382978724) internal successors, (85), 47 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-25 19:13:09,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:13:09,649 INFO L225 Difference]: With dead ends: 4512 [2021-11-25 19:13:09,649 INFO L226 Difference]: Without dead ends: 4449 [2021-11-25 19:13:09,650 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1366 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=825, Invalid=5974, Unknown=7, NotChecked=0, Total=6806 [2021-11-25 19:13:09,650 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 437 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 1797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 599 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:13:09,650 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [437 Valid, 343 Invalid, 1797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1124 Invalid, 0 Unknown, 599 Unchecked, 1.0s Time] [2021-11-25 19:13:09,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4449 states. [2021-11-25 19:13:09,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4449 to 3913. [2021-11-25 19:13:09,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3913 states, 3912 states have (on average 3.3274539877300615) internal successors, (13017), 3912 states have internal predecessors, (13017), 0 states have call successors, (0), 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-25 19:13:09,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3913 states to 3913 states and 13017 transitions. [2021-11-25 19:13:09,720 INFO L78 Accepts]: Start accepts. Automaton has 3913 states and 13017 transitions. Word has length 30 [2021-11-25 19:13:09,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:13:09,721 INFO L470 AbstractCegarLoop]: Abstraction has 3913 states and 13017 transitions. [2021-11-25 19:13:09,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.8085106382978724) internal successors, (85), 47 states have internal predecessors, (85), 0 states have call successors, (0), 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-25 19:13:09,721 INFO L276 IsEmpty]: Start isEmpty. Operand 3913 states and 13017 transitions. [2021-11-25 19:13:09,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 19:13:09,729 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:13:09,729 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] [2021-11-25 19:13:09,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2021-11-25 19:13:09,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:13:09,944 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 19:13:09,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:13:09,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1574852418, now seen corresponding path program 25 times [2021-11-25 19:13:09,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:13:09,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565629858] [2021-11-25 19:13:09,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:13:09,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:13:10,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:13:11,750 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:13:11,750 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:13:11,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565629858] [2021-11-25 19:13:11,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565629858] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:13:11,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711184460] [2021-11-25 19:13:11,751 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 19:13:11,751 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:13:11,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:13:11,752 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:13:11,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82ae31f-31d0-4845-8e3f-5212fcdb4428/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2021-11-25 19:13:11,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:13:11,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 56 conjunts are in the unsatisfiable core [2021-11-25 19:13:11,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:13:12,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:13:12,254 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 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 19:13:12,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:13:12,344 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 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 19:13:12,702 INFO L354 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2021-11-25 19:13:12,702 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 44 treesize of output 10 [2021-11-25 19:13:12,768 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-25 19:13:12,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:13:13,554 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:13:13,554 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 1353 treesize of output 1277 [2021-11-25 19:13:13,594 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:13:13,595 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 1165 treesize of output 949 [2021-11-25 19:13:13,629 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:13:13,630 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 855 treesize of output 771