./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba --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 675e4a71573eb5ca191c78078c954ea41743d39a46f0fa586376ee48e7dc4190 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-22 00:16:49,107 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 00:16:49,109 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 00:16:49,142 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 00:16:49,143 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 00:16:49,144 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 00:16:49,145 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 00:16:49,148 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 00:16:49,153 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 00:16:49,158 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 00:16:49,160 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 00:16:49,163 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 00:16:49,163 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 00:16:49,168 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 00:16:49,170 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 00:16:49,172 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 00:16:49,174 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 00:16:49,175 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 00:16:49,176 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 00:16:49,182 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 00:16:49,183 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 00:16:49,185 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 00:16:49,187 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 00:16:49,188 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 00:16:49,198 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 00:16:49,199 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 00:16:49,199 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 00:16:49,201 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 00:16:49,201 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 00:16:49,202 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 00:16:49,202 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 00:16:49,203 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 00:16:49,205 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 00:16:49,206 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 00:16:49,207 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 00:16:49,207 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 00:16:49,208 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 00:16:49,208 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 00:16:49,208 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 00:16:49,209 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 00:16:49,210 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 00:16:49,211 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-22 00:16:49,250 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 00:16:49,250 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 00:16:49,250 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 00:16:49,251 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 00:16:49,251 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 00:16:49,252 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 00:16:49,252 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 00:16:49,252 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 00:16:49,252 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 00:16:49,252 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 00:16:49,253 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 00:16:49,254 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 00:16:49,254 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 00:16:49,254 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 00:16:49,254 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 00:16:49,254 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 00:16:49,255 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 00:16:49,255 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 00:16:49,256 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 00:16:49,256 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 00:16:49,256 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 00:16:49,257 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 00:16:49,257 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 00:16:49,257 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 00:16:49,257 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 00:16:49,257 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 00:16:49,258 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 00:16:49,258 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 00:16:49,258 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 00:16:49,258 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 00:16:49,259 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 00:16:49,259 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 00:16:49,259 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:16:49,259 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 00:16:49,260 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 00:16:49,260 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 00:16:49,260 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 00:16:49,260 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 00:16:49,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 00:16:49,260 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 00:16:49,261 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 00:16:49,261 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/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_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba 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 -> 675e4a71573eb5ca191c78078c954ea41743d39a46f0fa586376ee48e7dc4190 [2022-11-22 00:16:49,502 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 00:16:49,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 00:16:49,526 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 00:16:49,527 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 00:16:49,528 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 00:16:49,529 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c [2022-11-22 00:16:52,526 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 00:16:52,803 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 00:16:52,804 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c [2022-11-22 00:16:52,811 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/data/0214ab9c8/28eadb1ee73a42bcab2e6b9e8d941875/FLAGe413bea5b [2022-11-22 00:16:52,826 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/data/0214ab9c8/28eadb1ee73a42bcab2e6b9e8d941875 [2022-11-22 00:16:52,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 00:16:52,831 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 00:16:52,832 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 00:16:52,832 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 00:16:52,839 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 00:16:52,840 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:16:52" (1/1) ... [2022-11-22 00:16:52,842 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37ec18f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:52, skipping insertion in model container [2022-11-22 00:16:52,843 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:16:52" (1/1) ... [2022-11-22 00:16:52,851 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 00:16:52,894 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 00:16:53,078 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c[4351,4364] [2022-11-22 00:16:53,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:16:53,097 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 00:16:53,143 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c[4351,4364] [2022-11-22 00:16:53,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:16:53,169 INFO L208 MainTranslator]: Completed translation [2022-11-22 00:16:53,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:53 WrapperNode [2022-11-22 00:16:53,170 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 00:16:53,171 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 00:16:53,171 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 00:16:53,171 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 00:16:53,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:53" (1/1) ... [2022-11-22 00:16:53,189 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:53" (1/1) ... [2022-11-22 00:16:53,219 INFO L138 Inliner]: procedures = 27, calls = 87, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 350 [2022-11-22 00:16:53,220 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 00:16:53,220 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 00:16:53,221 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 00:16:53,221 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 00:16:53,230 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:53" (1/1) ... [2022-11-22 00:16:53,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:53" (1/1) ... [2022-11-22 00:16:53,235 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:53" (1/1) ... [2022-11-22 00:16:53,236 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:53" (1/1) ... [2022-11-22 00:16:53,246 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:53" (1/1) ... [2022-11-22 00:16:53,251 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:53" (1/1) ... [2022-11-22 00:16:53,254 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:53" (1/1) ... [2022-11-22 00:16:53,255 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:53" (1/1) ... [2022-11-22 00:16:53,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 00:16:53,260 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 00:16:53,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 00:16:53,261 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 00:16:53,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:53" (1/1) ... [2022-11-22 00:16:53,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:16:53,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:16:53,304 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 00:16:53,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 00:16:53,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 00:16:53,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 00:16:53,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 00:16:53,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-22 00:16:53,362 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-22 00:16:53,362 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-22 00:16:53,362 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-22 00:16:53,362 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-22 00:16:53,362 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-22 00:16:53,363 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-22 00:16:53,363 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-11-22 00:16:53,363 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-11-22 00:16:53,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 00:16:53,363 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-22 00:16:53,363 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-22 00:16:53,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-22 00:16:53,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 00:16:53,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 00:16:53,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 00:16:53,366 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-22 00:16:53,492 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 00:16:53,495 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 00:16:54,100 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 00:16:54,496 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 00:16:54,497 INFO L300 CfgBuilder]: Removed 7 assume(true) statements. [2022-11-22 00:16:54,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:16:54 BoogieIcfgContainer [2022-11-22 00:16:54,501 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 00:16:54,505 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 00:16:54,506 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 00:16:54,509 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 00:16:54,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:16:52" (1/3) ... [2022-11-22 00:16:54,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fcf6b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:16:54, skipping insertion in model container [2022-11-22 00:16:54,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:53" (2/3) ... [2022-11-22 00:16:54,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fcf6b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:16:54, skipping insertion in model container [2022-11-22 00:16:54,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:16:54" (3/3) ... [2022-11-22 00:16:54,520 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series.wvr.c [2022-11-22 00:16:54,530 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-22 00:16:54,541 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 00:16:54,542 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-22 00:16:54,542 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-22 00:16:54,678 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-11-22 00:16:54,732 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-22 00:16:54,768 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 258 places, 267 transitions, 566 flow [2022-11-22 00:16:54,773 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 258 places, 267 transitions, 566 flow [2022-11-22 00:16:54,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 258 places, 267 transitions, 566 flow [2022-11-22 00:16:54,959 INFO L130 PetriNetUnfolder]: 22/263 cut-off events. [2022-11-22 00:16:54,959 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-22 00:16:54,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 263 events. 22/263 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 132 event pairs, 0 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 224. Up to 2 conditions per place. [2022-11-22 00:16:54,969 INFO L119 LiptonReduction]: Number of co-enabled transitions 2000 [2022-11-22 00:17:08,177 INFO L134 LiptonReduction]: Checked pairs total: 4324 [2022-11-22 00:17:08,178 INFO L136 LiptonReduction]: Total number of compositions: 262 [2022-11-22 00:17:08,186 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 50 places, 44 transitions, 120 flow [2022-11-22 00:17:08,275 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 855 states, 854 states have (on average 4.17096018735363) internal successors, (3562), 854 states have internal predecessors, (3562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:08,295 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 00:17:08,303 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@69a0e841, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 00:17:08,303 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-22 00:17:08,309 INFO L276 IsEmpty]: Start isEmpty. Operand has 855 states, 854 states have (on average 4.17096018735363) internal successors, (3562), 854 states have internal predecessors, (3562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:08,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-22 00:17:08,339 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:17:08,340 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:17:08,341 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-22 00:17:08,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:17:08,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1071246443, now seen corresponding path program 1 times [2022-11-22 00:17:08,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:17:08,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729891292] [2022-11-22 00:17:08,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:17:08,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:17:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:17:09,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:17:09,018 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:17:09,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729891292] [2022-11-22 00:17:09,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729891292] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:17:09,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:17:09,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 00:17:09,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857271454] [2022-11-22 00:17:09,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:17:09,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:17:09,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:17:09,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:17:09,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:17:09,065 INFO L87 Difference]: Start difference. First operand has 855 states, 854 states have (on average 4.17096018735363) internal successors, (3562), 854 states have internal predecessors, (3562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:09,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:17:09,232 INFO L93 Difference]: Finished difference Result 1262 states and 5287 transitions. [2022-11-22 00:17:09,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:17:09,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-22 00:17:09,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:17:09,271 INFO L225 Difference]: With dead ends: 1262 [2022-11-22 00:17:09,271 INFO L226 Difference]: Without dead ends: 1217 [2022-11-22 00:17:09,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:17:09,275 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 7 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:17:09,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 12 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:17:09,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2022-11-22 00:17:09,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1217. [2022-11-22 00:17:09,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1217 states, 1216 states have (on average 4.194078947368421) internal successors, (5100), 1216 states have internal predecessors, (5100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:09,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 5100 transitions. [2022-11-22 00:17:09,450 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 5100 transitions. Word has length 28 [2022-11-22 00:17:09,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:17:09,452 INFO L495 AbstractCegarLoop]: Abstraction has 1217 states and 5100 transitions. [2022-11-22 00:17:09,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:09,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 5100 transitions. [2022-11-22 00:17:09,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-22 00:17:09,458 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:17:09,459 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:17:09,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 00:17:09,459 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-22 00:17:09,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:17:09,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1039468936, now seen corresponding path program 1 times [2022-11-22 00:17:09,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:17:09,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022881797] [2022-11-22 00:17:09,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:17:09,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:17:09,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:17:09,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:17:09,702 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:17:09,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022881797] [2022-11-22 00:17:09,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022881797] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:17:09,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:17:09,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:17:09,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010375128] [2022-11-22 00:17:09,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:17:09,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:17:09,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:17:09,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:17:09,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:17:09,713 INFO L87 Difference]: Start difference. First operand 1217 states and 5100 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:09,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:17:09,851 INFO L93 Difference]: Finished difference Result 1655 states and 6692 transitions. [2022-11-22 00:17:09,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:17:09,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-22 00:17:09,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:17:09,865 INFO L225 Difference]: With dead ends: 1655 [2022-11-22 00:17:09,866 INFO L226 Difference]: Without dead ends: 1619 [2022-11-22 00:17:09,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:17:09,868 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:17:09,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 8 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:17:09,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2022-11-22 00:17:09,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1505. [2022-11-22 00:17:09,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1504 states have (on average 4.1236702127659575) internal successors, (6202), 1504 states have internal predecessors, (6202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:09,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 6202 transitions. [2022-11-22 00:17:09,949 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 6202 transitions. Word has length 30 [2022-11-22 00:17:09,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:17:09,950 INFO L495 AbstractCegarLoop]: Abstraction has 1505 states and 6202 transitions. [2022-11-22 00:17:09,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:09,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 6202 transitions. [2022-11-22 00:17:09,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-22 00:17:09,957 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:17:09,957 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:17:09,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 00:17:09,959 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-22 00:17:09,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:17:09,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1657376030, now seen corresponding path program 1 times [2022-11-22 00:17:09,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:17:09,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131045670] [2022-11-22 00:17:09,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:17:09,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:17:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:17:10,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:17:10,133 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:17:10,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131045670] [2022-11-22 00:17:10,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131045670] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:17:10,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:17:10,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:17:10,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833905973] [2022-11-22 00:17:10,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:17:10,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:17:10,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:17:10,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:17:10,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:17:10,138 INFO L87 Difference]: Start difference. First operand 1505 states and 6202 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:10,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:17:10,266 INFO L93 Difference]: Finished difference Result 1955 states and 7731 transitions. [2022-11-22 00:17:10,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:17:10,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-22 00:17:10,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:17:10,280 INFO L225 Difference]: With dead ends: 1955 [2022-11-22 00:17:10,280 INFO L226 Difference]: Without dead ends: 1889 [2022-11-22 00:17:10,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:17:10,284 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:17:10,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 8 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:17:10,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2022-11-22 00:17:10,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1733. [2022-11-22 00:17:10,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1732 states have (on average 4.054849884526559) internal successors, (7023), 1732 states have internal predecessors, (7023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:10,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 7023 transitions. [2022-11-22 00:17:10,400 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 7023 transitions. Word has length 30 [2022-11-22 00:17:10,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:17:10,400 INFO L495 AbstractCegarLoop]: Abstraction has 1733 states and 7023 transitions. [2022-11-22 00:17:10,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:10,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 7023 transitions. [2022-11-22 00:17:10,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-22 00:17:10,407 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:17:10,407 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:17:10,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 00:17:10,408 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-22 00:17:10,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:17:10,409 INFO L85 PathProgramCache]: Analyzing trace with hash 483590590, now seen corresponding path program 1 times [2022-11-22 00:17:10,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:17:10,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597788728] [2022-11-22 00:17:10,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:17:10,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:17:10,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:17:10,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 00:17:10,597 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:17:10,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597788728] [2022-11-22 00:17:10,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597788728] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:17:10,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:17:10,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 00:17:10,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475043799] [2022-11-22 00:17:10,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:17:10,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:17:10,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:17:10,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:17:10,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:17:10,600 INFO L87 Difference]: Start difference. First operand 1733 states and 7023 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:10,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:17:10,741 INFO L93 Difference]: Finished difference Result 2462 states and 9551 transitions. [2022-11-22 00:17:10,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:17:10,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-22 00:17:10,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:17:10,758 INFO L225 Difference]: With dead ends: 2462 [2022-11-22 00:17:10,759 INFO L226 Difference]: Without dead ends: 2360 [2022-11-22 00:17:10,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:17:10,760 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 25 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:17:10,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 18 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:17:10,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2360 states. [2022-11-22 00:17:10,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2360 to 2130. [2022-11-22 00:17:10,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2130 states, 2129 states have (on average 4.015969938938468) internal successors, (8550), 2129 states have internal predecessors, (8550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:10,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 8550 transitions. [2022-11-22 00:17:10,896 INFO L78 Accepts]: Start accepts. Automaton has 2130 states and 8550 transitions. Word has length 32 [2022-11-22 00:17:10,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:17:10,896 INFO L495 AbstractCegarLoop]: Abstraction has 2130 states and 8550 transitions. [2022-11-22 00:17:10,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:10,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 8550 transitions. [2022-11-22 00:17:10,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-22 00:17:10,904 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:17:10,904 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:17:10,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 00:17:10,905 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-22 00:17:10,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:17:10,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1677574197, now seen corresponding path program 1 times [2022-11-22 00:17:10,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:17:10,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47257720] [2022-11-22 00:17:10,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:17:10,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:17:10,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:17:11,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 00:17:11,078 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:17:11,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47257720] [2022-11-22 00:17:11,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47257720] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:17:11,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:17:11,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:17:11,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68359158] [2022-11-22 00:17:11,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:17:11,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:17:11,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:17:11,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:17:11,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:17:11,081 INFO L87 Difference]: Start difference. First operand 2130 states and 8550 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:11,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:17:11,282 INFO L93 Difference]: Finished difference Result 3661 states and 13786 transitions. [2022-11-22 00:17:11,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:17:11,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-22 00:17:11,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:17:11,307 INFO L225 Difference]: With dead ends: 3661 [2022-11-22 00:17:11,307 INFO L226 Difference]: Without dead ends: 3385 [2022-11-22 00:17:11,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:17:11,308 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 77 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:17:11,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 23 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:17:11,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3385 states. [2022-11-22 00:17:11,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3385 to 2447. [2022-11-22 00:17:11,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2447 states, 2446 states have (on average 3.9950940310711367) internal successors, (9772), 2446 states have internal predecessors, (9772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:11,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 9772 transitions. [2022-11-22 00:17:11,470 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 9772 transitions. Word has length 32 [2022-11-22 00:17:11,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:17:11,471 INFO L495 AbstractCegarLoop]: Abstraction has 2447 states and 9772 transitions. [2022-11-22 00:17:11,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:11,471 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 9772 transitions. [2022-11-22 00:17:11,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-22 00:17:11,482 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:17:11,482 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:17:11,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 00:17:11,483 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-22 00:17:11,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:17:11,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1080223795, now seen corresponding path program 1 times [2022-11-22 00:17:11,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:17:11,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255794726] [2022-11-22 00:17:11,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:17:11,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:17:11,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:17:12,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 00:17:12,058 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:17:12,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255794726] [2022-11-22 00:17:12,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255794726] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:17:12,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:17:12,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 00:17:12,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959137842] [2022-11-22 00:17:12,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:17:12,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 00:17:12,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:17:12,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 00:17:12,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:17:12,061 INFO L87 Difference]: Start difference. First operand 2447 states and 9772 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:12,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:17:12,359 INFO L93 Difference]: Finished difference Result 4067 states and 15698 transitions. [2022-11-22 00:17:12,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 00:17:12,360 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-22 00:17:12,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:17:12,387 INFO L225 Difference]: With dead ends: 4067 [2022-11-22 00:17:12,388 INFO L226 Difference]: Without dead ends: 3930 [2022-11-22 00:17:12,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-22 00:17:12,389 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 143 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:17:12,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 3 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:17:12,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3930 states. [2022-11-22 00:17:12,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3930 to 2449. [2022-11-22 00:17:12,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2449 states, 2448 states have (on average 3.9930555555555554) internal successors, (9775), 2448 states have internal predecessors, (9775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:12,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2449 states to 2449 states and 9775 transitions. [2022-11-22 00:17:12,559 INFO L78 Accepts]: Start accepts. Automaton has 2449 states and 9775 transitions. Word has length 33 [2022-11-22 00:17:12,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:17:12,561 INFO L495 AbstractCegarLoop]: Abstraction has 2449 states and 9775 transitions. [2022-11-22 00:17:12,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:12,562 INFO L276 IsEmpty]: Start isEmpty. Operand 2449 states and 9775 transitions. [2022-11-22 00:17:12,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-22 00:17:12,570 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:17:12,571 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:17:12,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 00:17:12,571 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-22 00:17:12,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:17:12,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1170867020, now seen corresponding path program 1 times [2022-11-22 00:17:12,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:17:12,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563597961] [2022-11-22 00:17:12,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:17:12,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:17:12,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:17:12,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 00:17:12,998 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:17:12,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563597961] [2022-11-22 00:17:12,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563597961] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:17:12,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:17:12,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 00:17:12,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546011555] [2022-11-22 00:17:13,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:17:13,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 00:17:13,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:17:13,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 00:17:13,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:17:13,001 INFO L87 Difference]: Start difference. First operand 2449 states and 9775 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:13,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:17:13,274 INFO L93 Difference]: Finished difference Result 3131 states and 12288 transitions. [2022-11-22 00:17:13,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 00:17:13,275 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-22 00:17:13,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:17:13,290 INFO L225 Difference]: With dead ends: 3131 [2022-11-22 00:17:13,290 INFO L226 Difference]: Without dead ends: 2980 [2022-11-22 00:17:13,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-22 00:17:13,292 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 82 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:17:13,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 4 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:17:13,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2980 states. [2022-11-22 00:17:13,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2980 to 2450. [2022-11-22 00:17:13,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2450 states, 2449 states have (on average 3.991425071457738) internal successors, (9775), 2449 states have internal predecessors, (9775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:13,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 9775 transitions. [2022-11-22 00:17:13,396 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 9775 transitions. Word has length 33 [2022-11-22 00:17:13,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:17:13,396 INFO L495 AbstractCegarLoop]: Abstraction has 2450 states and 9775 transitions. [2022-11-22 00:17:13,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:13,397 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 9775 transitions. [2022-11-22 00:17:13,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-22 00:17:13,406 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:17:13,406 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:17:13,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 00:17:13,407 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-22 00:17:13,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:17:13,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1406594124, now seen corresponding path program 1 times [2022-11-22 00:17:13,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:17:13,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621975575] [2022-11-22 00:17:13,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:17:13,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:17:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:17:13,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 00:17:13,831 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:17:13,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621975575] [2022-11-22 00:17:13,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621975575] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:17:13,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:17:13,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 00:17:13,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436166220] [2022-11-22 00:17:13,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:17:13,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 00:17:13,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:17:13,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 00:17:13,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:17:13,833 INFO L87 Difference]: Start difference. First operand 2450 states and 9775 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:14,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:17:14,079 INFO L93 Difference]: Finished difference Result 2994 states and 11918 transitions. [2022-11-22 00:17:14,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 00:17:14,080 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-22 00:17:14,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:17:14,093 INFO L225 Difference]: With dead ends: 2994 [2022-11-22 00:17:14,093 INFO L226 Difference]: Without dead ends: 2525 [2022-11-22 00:17:14,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:17:14,094 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 92 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:17:14,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 1 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:17:14,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2525 states. [2022-11-22 00:17:14,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2525 to 2003. [2022-11-22 00:17:14,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2003 states, 2002 states have (on average 4.056443556443557) internal successors, (8121), 2002 states have internal predecessors, (8121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:14,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2003 states to 2003 states and 8121 transitions. [2022-11-22 00:17:14,177 INFO L78 Accepts]: Start accepts. Automaton has 2003 states and 8121 transitions. Word has length 34 [2022-11-22 00:17:14,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:17:14,177 INFO L495 AbstractCegarLoop]: Abstraction has 2003 states and 8121 transitions. [2022-11-22 00:17:14,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:14,178 INFO L276 IsEmpty]: Start isEmpty. Operand 2003 states and 8121 transitions. [2022-11-22 00:17:14,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-22 00:17:14,186 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:17:14,186 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:17:14,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-22 00:17:14,187 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-22 00:17:14,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:17:14,188 INFO L85 PathProgramCache]: Analyzing trace with hash -332000973, now seen corresponding path program 1 times [2022-11-22 00:17:14,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:17:14,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527425735] [2022-11-22 00:17:14,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:17:14,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:17:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:17:14,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 00:17:14,575 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:17:14,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527425735] [2022-11-22 00:17:14,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527425735] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:17:14,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:17:14,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 00:17:14,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095668713] [2022-11-22 00:17:14,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:17:14,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 00:17:14,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:17:14,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 00:17:14,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:17:14,578 INFO L87 Difference]: Start difference. First operand 2003 states and 8121 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:14,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:17:14,758 INFO L93 Difference]: Finished difference Result 2137 states and 8539 transitions. [2022-11-22 00:17:14,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 00:17:14,758 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-22 00:17:14,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:17:14,768 INFO L225 Difference]: With dead ends: 2137 [2022-11-22 00:17:14,768 INFO L226 Difference]: Without dead ends: 1820 [2022-11-22 00:17:14,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:17:14,769 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:17:14,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 0 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:17:14,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states. [2022-11-22 00:17:14,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 1530. [2022-11-22 00:17:14,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1530 states, 1529 states have (on average 4.0758665794637015) internal successors, (6232), 1529 states have internal predecessors, (6232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:14,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 6232 transitions. [2022-11-22 00:17:14,826 INFO L78 Accepts]: Start accepts. Automaton has 1530 states and 6232 transitions. Word has length 34 [2022-11-22 00:17:14,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:17:14,826 INFO L495 AbstractCegarLoop]: Abstraction has 1530 states and 6232 transitions. [2022-11-22 00:17:14,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:14,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 6232 transitions. [2022-11-22 00:17:14,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-22 00:17:14,832 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:17:14,832 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:17:14,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-22 00:17:14,832 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-22 00:17:14,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:17:14,833 INFO L85 PathProgramCache]: Analyzing trace with hash 157918814, now seen corresponding path program 1 times [2022-11-22 00:17:14,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:17:14,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022457780] [2022-11-22 00:17:14,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:17:14,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:17:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:17:15,118 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-22 00:17:15,119 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:17:15,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022457780] [2022-11-22 00:17:15,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022457780] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:17:15,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618598240] [2022-11-22 00:17:15,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:17:15,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:17:15,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:17:15,125 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:17:15,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 00:17:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:17:15,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-22 00:17:15,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:17:15,463 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-22 00:17:15,463 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:17:15,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618598240] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:17:15,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 00:17:15,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-11-22 00:17:15,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136157422] [2022-11-22 00:17:15,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:17:15,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:17:15,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:17:15,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:17:15,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-22 00:17:15,465 INFO L87 Difference]: Start difference. First operand 1530 states and 6232 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:15,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:17:15,700 INFO L93 Difference]: Finished difference Result 2916 states and 11984 transitions. [2022-11-22 00:17:15,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 00:17:15,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-11-22 00:17:15,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:17:15,715 INFO L225 Difference]: With dead ends: 2916 [2022-11-22 00:17:15,716 INFO L226 Difference]: Without dead ends: 2916 [2022-11-22 00:17:15,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-22 00:17:15,716 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 92 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:17:15,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 24 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:17:15,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2916 states. [2022-11-22 00:17:15,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2916 to 1864. [2022-11-22 00:17:15,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1864 states, 1863 states have (on average 4.101449275362318) internal successors, (7641), 1863 states have internal predecessors, (7641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:15,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 1864 states and 7641 transitions. [2022-11-22 00:17:15,796 INFO L78 Accepts]: Start accepts. Automaton has 1864 states and 7641 transitions. Word has length 37 [2022-11-22 00:17:15,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:17:15,797 INFO L495 AbstractCegarLoop]: Abstraction has 1864 states and 7641 transitions. [2022-11-22 00:17:15,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:15,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 7641 transitions. [2022-11-22 00:17:15,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-22 00:17:15,804 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:17:15,804 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:17:15,820 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-22 00:17:16,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:17:16,021 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-22 00:17:16,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:17:16,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1756041144, now seen corresponding path program 1 times [2022-11-22 00:17:16,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:17:16,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445640170] [2022-11-22 00:17:16,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:17:16,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:17:16,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:17:16,308 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-22 00:17:16,308 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:17:16,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445640170] [2022-11-22 00:17:16,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445640170] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:17:16,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335720025] [2022-11-22 00:17:16,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:17:16,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:17:16,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:17:16,310 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:17:16,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 00:17:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:17:16,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-22 00:17:16,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:17:16,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-22 00:17:16,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:17:16,841 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-22 00:17:16,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335720025] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-22 00:17:16,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-22 00:17:16,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2022-11-22 00:17:16,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853858838] [2022-11-22 00:17:16,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:17:16,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 00:17:16,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:17:16,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 00:17:16,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-22 00:17:16,843 INFO L87 Difference]: Start difference. First operand 1864 states and 7641 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:17,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:17:17,266 INFO L93 Difference]: Finished difference Result 3006 states and 12234 transitions. [2022-11-22 00:17:17,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 00:17:17,266 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-11-22 00:17:17,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:17:17,281 INFO L225 Difference]: With dead ends: 3006 [2022-11-22 00:17:17,281 INFO L226 Difference]: Without dead ends: 3006 [2022-11-22 00:17:17,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-11-22 00:17:17,282 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 134 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:17:17,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 28 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 00:17:17,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3006 states. [2022-11-22 00:17:17,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3006 to 1714. [2022-11-22 00:17:17,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1714 states, 1713 states have (on average 4.064798598949212) internal successors, (6963), 1713 states have internal predecessors, (6963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:17,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 6963 transitions. [2022-11-22 00:17:17,385 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 6963 transitions. Word has length 37 [2022-11-22 00:17:17,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:17:17,385 INFO L495 AbstractCegarLoop]: Abstraction has 1714 states and 6963 transitions. [2022-11-22 00:17:17,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:17,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 6963 transitions. [2022-11-22 00:17:17,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-22 00:17:17,392 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:17:17,392 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:17:17,416 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-22 00:17:17,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-22 00:17:17,598 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-22 00:17:17,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:17:17,599 INFO L85 PathProgramCache]: Analyzing trace with hash -26904860, now seen corresponding path program 2 times [2022-11-22 00:17:17,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:17:17,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401493791] [2022-11-22 00:17:17,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:17:17,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:17:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:17:17,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-22 00:17:17,980 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:17:17,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401493791] [2022-11-22 00:17:17,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401493791] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:17:17,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53994471] [2022-11-22 00:17:17,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 00:17:17,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:17:17,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:17:17,984 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:17:18,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 00:17:18,210 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-22 00:17:18,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:17:18,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-22 00:17:18,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:17:18,353 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-22 00:17:18,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:17:18,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 00:17:18,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53994471] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-22 00:17:18,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-22 00:17:18,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 5] total 13 [2022-11-22 00:17:18,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735506005] [2022-11-22 00:17:18,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:17:18,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 00:17:18,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:17:18,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 00:17:18,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-11-22 00:17:18,517 INFO L87 Difference]: Start difference. First operand 1714 states and 6963 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:19,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:17:19,029 INFO L93 Difference]: Finished difference Result 2530 states and 10125 transitions. [2022-11-22 00:17:19,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-22 00:17:19,030 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-11-22 00:17:19,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:17:19,042 INFO L225 Difference]: With dead ends: 2530 [2022-11-22 00:17:19,043 INFO L226 Difference]: Without dead ends: 2530 [2022-11-22 00:17:19,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2022-11-22 00:17:19,044 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 154 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 00:17:19,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 6 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 00:17:19,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2530 states. [2022-11-22 00:17:19,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2530 to 1780. [2022-11-22 00:17:19,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1780 states, 1779 states have (on average 4.064643057897696) internal successors, (7231), 1779 states have internal predecessors, (7231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:19,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 7231 transitions. [2022-11-22 00:17:19,115 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 7231 transitions. Word has length 37 [2022-11-22 00:17:19,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:17:19,115 INFO L495 AbstractCegarLoop]: Abstraction has 1780 states and 7231 transitions. [2022-11-22 00:17:19,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:19,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 7231 transitions. [2022-11-22 00:17:19,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-22 00:17:19,123 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:17:19,123 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:17:19,130 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-22 00:17:19,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-22 00:17:19,330 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-22 00:17:19,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:17:19,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1997180309, now seen corresponding path program 1 times [2022-11-22 00:17:19,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:17:19,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27468739] [2022-11-22 00:17:19,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:17:19,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:17:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:17:23,441 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 00:17:23,442 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:17:23,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27468739] [2022-11-22 00:17:23,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27468739] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:17:23,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300144407] [2022-11-22 00:17:23,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:17:23,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:17:23,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:17:23,444 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:17:23,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 00:17:23,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:17:23,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-22 00:17:23,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:17:23,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:23,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:23,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 94 [2022-11-22 00:17:24,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:24,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:25,009 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-22 00:17:25,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 49 [2022-11-22 00:17:25,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2022-11-22 00:17:25,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:25,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:25,181 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-22 00:17:25,181 INFO L350 Elim1Store]: Elim1 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 28 treesize of output 33 [2022-11-22 00:17:25,451 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:17:25,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 29 [2022-11-22 00:17:25,476 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 00:17:25,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:17:26,344 INFO L321 Elim1Store]: treesize reduction 19, result has 92.8 percent of original size [2022-11-22 00:17:26,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 960 treesize of output 1045 [2022-11-22 00:17:26,406 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:17:26,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 790 treesize of output 614 [2022-11-22 00:17:26,449 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:17:26,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 598 treesize of output 518 [2022-11-22 00:17:32,318 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 00:17:32,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300144407] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:17:32,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1676563290] [2022-11-22 00:17:32,325 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 00:17:32,328 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:17:32,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 10] total 32 [2022-11-22 00:17:32,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34653391] [2022-11-22 00:17:32,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:17:32,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-22 00:17:32,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:17:32,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-22 00:17:32,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1009, Unknown=4, NotChecked=0, Total=1122 [2022-11-22 00:17:32,331 INFO L87 Difference]: Start difference. First operand 1780 states and 7231 transitions. Second operand has 34 states, 33 states have (on average 2.878787878787879) internal successors, (95), 33 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:49,238 WARN L233 SmtUtils]: Spent 6.37s on a formula simplification. DAG size of input: 96 DAG size of output: 81 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 00:18:01,528 WARN L233 SmtUtils]: Spent 8.10s on a formula simplification. DAG size of input: 49 DAG size of output: 46 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 00:18:40,493 WARN L233 SmtUtils]: Spent 38.40s on a formula simplification. DAG size of input: 105 DAG size of output: 82 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 00:19:22,857 WARN L233 SmtUtils]: Spent 30.69s on a formula simplification. DAG size of input: 66 DAG size of output: 49 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 00:19:56,389 WARN L233 SmtUtils]: Spent 28.88s on a formula simplification. DAG size of input: 106 DAG size of output: 83 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 00:20:53,352 WARN L233 SmtUtils]: Spent 41.41s on a formula simplification. DAG size of input: 68 DAG size of output: 51 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 00:21:14,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:21:14,866 INFO L93 Difference]: Finished difference Result 19991 states and 83170 transitions. [2022-11-22 00:21:14,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2022-11-22 00:21:14,867 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.878787878787879) internal successors, (95), 33 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-22 00:21:14,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:21:14,995 INFO L225 Difference]: With dead ends: 19991 [2022-11-22 00:21:14,995 INFO L226 Difference]: Without dead ends: 19846 [2022-11-22 00:21:14,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 69 SyntacticMatches, 7 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6303 ImplicationChecksByTransitivity, 210.9s TimeCoverageRelationStatistics Valid=2286, Invalid=15574, Unknown=230, NotChecked=0, Total=18090 [2022-11-22 00:21:15,000 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 1644 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 5248 mSolverCounterSat, 271 mSolverCounterUnsat, 476 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1644 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 5995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 5248 IncrementalHoareTripleChecker+Invalid, 476 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2022-11-22 00:21:15,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1644 Valid, 8 Invalid, 5995 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [271 Valid, 5248 Invalid, 476 Unknown, 0 Unchecked, 12.9s Time] [2022-11-22 00:21:15,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19846 states. [2022-11-22 00:21:15,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19846 to 4601. [2022-11-22 00:21:15,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4601 states, 4600 states have (on average 4.343478260869565) internal successors, (19980), 4600 states have internal predecessors, (19980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:21:15,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4601 states to 4601 states and 19980 transitions. [2022-11-22 00:21:15,383 INFO L78 Accepts]: Start accepts. Automaton has 4601 states and 19980 transitions. Word has length 39 [2022-11-22 00:21:15,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:21:15,386 INFO L495 AbstractCegarLoop]: Abstraction has 4601 states and 19980 transitions. [2022-11-22 00:21:15,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.878787878787879) internal successors, (95), 33 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:21:15,387 INFO L276 IsEmpty]: Start isEmpty. Operand 4601 states and 19980 transitions. [2022-11-22 00:21:15,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-22 00:21:15,403 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:21:15,403 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:21:15,415 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-22 00:21:15,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-22 00:21:15,615 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-22 00:21:15,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:21:15,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1609293269, now seen corresponding path program 2 times [2022-11-22 00:21:15,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:21:15,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375586232] [2022-11-22 00:21:15,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:21:15,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:21:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:21:22,833 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:21:22,833 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:21:22,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375586232] [2022-11-22 00:21:22,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375586232] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:21:22,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180374492] [2022-11-22 00:21:22,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 00:21:22,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:21:22,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:21:22,835 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:21:22,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-22 00:21:23,099 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-22 00:21:23,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:21:23,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 76 conjunts are in the unsatisfiable core [2022-11-22 00:21:23,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:21:23,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:21:23,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:21:23,219 INFO L321 Elim1Store]: treesize reduction 107, result has 28.7 percent of original size [2022-11-22 00:21:23,219 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 53 [2022-11-22 00:21:23,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:21:23,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:21:23,478 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 00:21:23,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2022-11-22 00:21:24,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:21:24,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:21:24,647 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-22 00:21:24,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 49 [2022-11-22 00:21:24,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2022-11-22 00:21:24,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:21:24,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:21:24,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 33 [2022-11-22 00:21:25,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 11 [2022-11-22 00:21:25,169 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 00:21:25,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:21:25,461 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse2 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (and (forall ((v_ArrVal_693 (Array Int Int))) (<= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_693))) (+ c_~total~0 (select (select .cse0 c_~q2~0.base) .cse1) (select (select .cse0 c_~q1~0.base) .cse2))) 0)) (forall ((v_ArrVal_693 (Array Int Int))) (< 0 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_693))) (+ c_~total~0 (select (select .cse3 c_~q2~0.base) .cse1) (select (select .cse3 c_~q1~0.base) .cse2) 1)))))) is different from false [2022-11-22 00:21:25,494 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse2 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (and (forall ((v_ArrVal_692 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (<= (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_692) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_693))) (+ (select (select .cse0 c_~q1~0.base) .cse1) (select (select .cse0 c_~q2~0.base) .cse2) c_~total~0)) 0)) (forall ((v_ArrVal_692 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (< 0 (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_692) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_693))) (+ (select (select .cse3 c_~q1~0.base) .cse1) (select (select .cse3 c_~q2~0.base) .cse2) c_~total~0 1)))))) is different from false [2022-11-22 00:21:25,549 WARN L837 $PredicateComparison]: unable to prove that (or (not (<= 0 c_~q1_back~0)) (not (< c_~q1_back~0 c_~n1~0)) (not (= (select (select |c_#memory_int| c_~q1~0.base) (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (select (select |c_#memory_int| c_~f~0.base) (+ c_~f~0.offset (* c_~i~0 4))))) (let ((.cse1 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse2 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (and (forall ((v_ArrVal_692 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (<= (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_692) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_693))) (+ (select (select .cse0 c_~q1~0.base) .cse1) (select (select .cse0 c_~q2~0.base) .cse2) c_~total~0)) 0)) (forall ((v_ArrVal_692 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (< 0 (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_692) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_693))) (+ (select (select .cse3 c_~q1~0.base) .cse1) (select (select .cse3 c_~q2~0.base) .cse2) c_~total~0 1))))))) is different from false [2022-11-22 00:21:26,000 INFO L321 Elim1Store]: treesize reduction 19, result has 92.8 percent of original size [2022-11-22 00:21:26,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 2408 treesize of output 2301 [2022-11-22 00:21:26,079 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:21:26,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2045 treesize of output 1966 [2022-11-22 00:21:26,134 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:21:26,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1949 treesize of output 1918 [2022-11-22 00:21:26,194 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:21:26,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1901 treesize of output 1534 [2022-11-22 00:21:26,252 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:21:26,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1517 treesize of output 1342 [2022-11-22 00:21:34,494 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2022-11-22 00:21:34,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180374492] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:21:34,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1246854960] [2022-11-22 00:21:34,495 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 00:21:34,500 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:21:34,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 10] total 34 [2022-11-22 00:21:34,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077074169] [2022-11-22 00:21:34,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:21:34,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-22 00:21:34,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:21:34,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-22 00:21:34,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=957, Unknown=3, NotChecked=192, Total=1260 [2022-11-22 00:21:34,502 INFO L87 Difference]: Start difference. First operand 4601 states and 19980 transitions. Second operand has 36 states, 35 states have (on average 2.6) internal successors, (91), 35 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:21:43,822 WARN L837 $PredicateComparison]: unable to prove that (and (<= c_~total~0 0) (< 0 (+ c_~total~0 1)) (or (not (<= 0 c_~q1_back~0)) (not (< c_~q1_back~0 c_~n1~0)) (not (= (select (select |c_#memory_int| c_~q1~0.base) (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (select (select |c_#memory_int| c_~f~0.base) (+ c_~f~0.offset (* c_~i~0 4))))) (let ((.cse1 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse2 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (and (forall ((v_ArrVal_692 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (<= (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_692) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_693))) (+ (select (select .cse0 c_~q1~0.base) .cse1) (select (select .cse0 c_~q2~0.base) .cse2) c_~total~0)) 0)) (forall ((v_ArrVal_692 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (< 0 (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_692) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_693))) (+ (select (select .cse3 c_~q1~0.base) .cse1) (select (select .cse3 c_~q2~0.base) .cse2) c_~total~0 1)))))))) is different from false [2022-11-22 00:21:53,258 WARN L233 SmtUtils]: Spent 5.02s on a formula simplification. DAG size of input: 153 DAG size of output: 126 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 00:22:00,854 WARN L233 SmtUtils]: Spent 5.02s on a formula simplification. DAG size of input: 171 DAG size of output: 117 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 00:22:24,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:22:24,386 INFO L93 Difference]: Finished difference Result 10794 states and 45759 transitions. [2022-11-22 00:22:24,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-11-22 00:22:24,387 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.6) internal successors, (91), 35 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-22 00:22:24,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:22:24,464 INFO L225 Difference]: With dead ends: 10794 [2022-11-22 00:22:24,465 INFO L226 Difference]: Without dead ends: 10765 [2022-11-22 00:22:24,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 56 SyntacticMatches, 13 SemanticMatches, 89 ConstructedPredicates, 4 IntricatePredicates, 7 DeprecatedPredicates, 2320 ImplicationChecksByTransitivity, 46.0s TimeCoverageRelationStatistics Valid=952, Invalid=6521, Unknown=25, NotChecked=692, Total=8190 [2022-11-22 00:22:24,467 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 1041 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2699 mSolverCounterSat, 197 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1041 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 3959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 2699 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 1059 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-11-22 00:22:24,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1041 Valid, 9 Invalid, 3959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 2699 Invalid, 4 Unknown, 1059 Unchecked, 6.7s Time] [2022-11-22 00:22:24,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10765 states. [2022-11-22 00:22:24,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10765 to 5231. [2022-11-22 00:22:24,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5231 states, 5230 states have (on average 4.338049713193117) internal successors, (22688), 5230 states have internal predecessors, (22688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:22:24,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5231 states to 5231 states and 22688 transitions. [2022-11-22 00:22:24,702 INFO L78 Accepts]: Start accepts. Automaton has 5231 states and 22688 transitions. Word has length 39 [2022-11-22 00:22:24,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:22:24,703 INFO L495 AbstractCegarLoop]: Abstraction has 5231 states and 22688 transitions. [2022-11-22 00:22:24,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.6) internal successors, (91), 35 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:22:24,704 INFO L276 IsEmpty]: Start isEmpty. Operand 5231 states and 22688 transitions. [2022-11-22 00:22:24,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-22 00:22:24,720 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:22:24,720 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:22:24,731 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-22 00:22:24,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-22 00:22:24,927 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-22 00:22:24,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:22:24,927 INFO L85 PathProgramCache]: Analyzing trace with hash -19957415, now seen corresponding path program 3 times [2022-11-22 00:22:24,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:22:24,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999106331] [2022-11-22 00:22:24,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:22:24,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:22:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:22:30,070 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:22:30,071 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:22:30,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999106331] [2022-11-22 00:22:30,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999106331] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:22:30,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547662309] [2022-11-22 00:22:30,072 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 00:22:30,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:22:30,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:22:30,075 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:22:30,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-22 00:22:30,272 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 00:22:30,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:22:30,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-22 00:22:30,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:22:31,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:22:31,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:22:31,310 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-22 00:22:31,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 49 [2022-11-22 00:22:31,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2022-11-22 00:22:31,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:22:31,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:22:31,564 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-22 00:22:31,568 INFO L350 Elim1Store]: Elim1 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 [2022-11-22 00:22:31,711 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:22:31,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 31 [2022-11-22 00:22:31,740 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 00:22:31,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:22:31,835 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_771 (Array Int Int))) (= (+ c_~total~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_771) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4)))) 0)) is different from false [2022-11-22 00:22:31,844 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_771 (Array Int Int))) (= (+ c_~total~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_771) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) (select (select |c_#memory_int| c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset))) 0)) is different from false [2022-11-22 00:22:31,873 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_771 (Array Int Int)) (v_ArrVal_770 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_770))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_771) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) c_~total~0 (select (select .cse0 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)))) 0)) is different from false [2022-11-22 00:22:32,416 INFO L321 Elim1Store]: treesize reduction 19, result has 92.8 percent of original size [2022-11-22 00:22:32,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 268 treesize of output 433 [2022-11-22 00:22:32,449 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:22:32,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 178 treesize of output 158 [2022-11-22 00:22:32,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 118 [2022-11-22 00:22:41,866 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2022-11-22 00:22:41,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547662309] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:22:41,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1906527319] [2022-11-22 00:22:41,867 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 00:22:41,868 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:22:41,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 9] total 33 [2022-11-22 00:22:41,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292495529] [2022-11-22 00:22:41,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:22:41,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-22 00:22:41,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:22:41,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-22 00:22:41,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=893, Unknown=3, NotChecked=186, Total=1190 [2022-11-22 00:22:41,870 INFO L87 Difference]: Start difference. First operand 5231 states and 22688 transitions. Second operand has 35 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 34 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:22:48,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:22:48,627 INFO L93 Difference]: Finished difference Result 10230 states and 44440 transitions. [2022-11-22 00:22:48,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-22 00:22:48,628 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 34 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-22 00:22:48,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:22:48,677 INFO L225 Difference]: With dead ends: 10230 [2022-11-22 00:22:48,677 INFO L226 Difference]: Without dead ends: 10201 [2022-11-22 00:22:48,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 59 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=269, Invalid=1902, Unknown=3, NotChecked=276, Total=2450 [2022-11-22 00:22:48,679 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 406 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 1650 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 2217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 508 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-22 00:22:48,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 23 Invalid, 2217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1650 Invalid, 0 Unknown, 508 Unchecked, 3.5s Time] [2022-11-22 00:22:48,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10201 states. [2022-11-22 00:22:48,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10201 to 5057. [2022-11-22 00:22:48,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5057 states, 5056 states have (on average 4.328322784810126) internal successors, (21884), 5056 states have internal predecessors, (21884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:22:48,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5057 states to 5057 states and 21884 transitions. [2022-11-22 00:22:48,906 INFO L78 Accepts]: Start accepts. Automaton has 5057 states and 21884 transitions. Word has length 39 [2022-11-22 00:22:48,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:22:48,906 INFO L495 AbstractCegarLoop]: Abstraction has 5057 states and 21884 transitions. [2022-11-22 00:22:48,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 34 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:22:48,906 INFO L276 IsEmpty]: Start isEmpty. Operand 5057 states and 21884 transitions. [2022-11-22 00:22:48,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-22 00:22:48,922 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:22:48,922 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:22:48,929 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-22 00:22:49,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-22 00:22:49,130 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-22 00:22:49,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:22:49,131 INFO L85 PathProgramCache]: Analyzing trace with hash -2009758245, now seen corresponding path program 4 times [2022-11-22 00:22:49,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:22:49,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869170515] [2022-11-22 00:22:49,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:22:49,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:22:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:22:53,312 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:22:53,313 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:22:53,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869170515] [2022-11-22 00:22:53,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869170515] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:22:53,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682555051] [2022-11-22 00:22:53,313 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-22 00:22:53,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:22:53,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:22:53,314 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:22:53,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f4ddfa1-a211-45ae-818b-567d6824bc97/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-22 00:22:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:22:53,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 94 conjunts are in the unsatisfiable core [2022-11-22 00:22:53,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:22:53,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:22:53,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:22:53,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:22:53,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:22:53,641 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-22 00:22:53,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 47 [2022-11-22 00:22:53,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 00:22:53,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:22:53,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:22:54,006 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-22 00:22:54,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2022-11-22 00:22:54,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 00:22:54,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:22:54,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:22:54,362 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 00:22:54,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2022-11-22 00:22:54,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 00:22:54,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 00:22:55,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 00:22:55,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:22:55,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:22:55,933 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-22 00:22:55,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-11-22 00:22:56,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:22:56,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:22:56,189 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-22 00:22:56,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-11-22 00:22:56,890 INFO L321 Elim1Store]: treesize reduction 41, result has 32.8 percent of original size [2022-11-22 00:22:56,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 33 [2022-11-22 00:22:56,923 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 00:22:56,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:22:59,443 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:22:59,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 229 treesize of output 169 [2022-11-22 00:23:02,146 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:23:02,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 26087162021858 treesize of output 25916705501246