./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 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_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh --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 0307f20ae0363cc6fed70ae0937c5000167639ab486b68a523e3313ccdd28e28 --- 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-2329fc7 [2022-12-14 03:08:54,301 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 03:08:54,303 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 03:08:54,321 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 03:08:54,321 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 03:08:54,322 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 03:08:54,323 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 03:08:54,324 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 03:08:54,326 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 03:08:54,326 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 03:08:54,327 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 03:08:54,328 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 03:08:54,329 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 03:08:54,330 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 03:08:54,331 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 03:08:54,332 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 03:08:54,332 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 03:08:54,333 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 03:08:54,335 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 03:08:54,336 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 03:08:54,337 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 03:08:54,339 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 03:08:54,340 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 03:08:54,340 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 03:08:54,343 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 03:08:54,344 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 03:08:54,344 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 03:08:54,345 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 03:08:54,345 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 03:08:54,346 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 03:08:54,346 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 03:08:54,347 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 03:08:54,347 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 03:08:54,348 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 03:08:54,349 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 03:08:54,349 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 03:08:54,350 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 03:08:54,350 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 03:08:54,350 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 03:08:54,351 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 03:08:54,351 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 03:08:54,352 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 03:08:54,374 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 03:08:54,374 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 03:08:54,374 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 03:08:54,374 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 03:08:54,375 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 03:08:54,375 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 03:08:54,375 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 03:08:54,376 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 03:08:54,376 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 03:08:54,376 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 03:08:54,376 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 03:08:54,376 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 03:08:54,376 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 03:08:54,377 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 03:08:54,377 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 03:08:54,377 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 03:08:54,377 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 03:08:54,377 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 03:08:54,378 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 03:08:54,378 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 03:08:54,378 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 03:08:54,379 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 03:08:54,379 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 03:08:54,379 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 03:08:54,379 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 03:08:54,379 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 03:08:54,379 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 03:08:54,380 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 03:08:54,380 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 03:08:54,380 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 03:08:54,380 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 03:08:54,380 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 03:08:54,381 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 03:08:54,381 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 03:08:54,381 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 03:08:54,381 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 03:08:54,381 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 03:08:54,381 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 03:08:54,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 03:08:54,382 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 03:08:54,382 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 03:08:54,382 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_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/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_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh 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 -> 0307f20ae0363cc6fed70ae0937c5000167639ab486b68a523e3313ccdd28e28 [2022-12-14 03:08:54,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 03:08:54,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 03:08:54,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 03:08:54,608 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 03:08:54,609 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 03:08:54,609 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c [2022-12-14 03:08:57,123 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 03:08:57,294 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 03:08:57,294 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c [2022-12-14 03:08:57,300 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/data/b25d96246/ab2989f7072741ea9476aedbc1a25018/FLAGdea0bf0fd [2022-12-14 03:08:57,689 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/data/b25d96246/ab2989f7072741ea9476aedbc1a25018 [2022-12-14 03:08:57,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 03:08:57,693 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 03:08:57,694 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 03:08:57,694 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 03:08:57,697 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 03:08:57,697 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:08:57" (1/1) ... [2022-12-14 03:08:57,698 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@316ea925 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:08:57, skipping insertion in model container [2022-12-14 03:08:57,698 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:08:57" (1/1) ... [2022-12-14 03:08:57,703 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 03:08:57,718 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 03:08:57,838 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_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c[2396,2409] [2022-12-14 03:08:57,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 03:08:57,853 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 03:08:57,873 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_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c[2396,2409] [2022-12-14 03:08:57,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 03:08:57,887 INFO L208 MainTranslator]: Completed translation [2022-12-14 03:08:57,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:08:57 WrapperNode [2022-12-14 03:08:57,887 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 03:08:57,888 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 03:08:57,888 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 03:08:57,888 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 03:08:57,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:08:57" (1/1) ... [2022-12-14 03:08:57,900 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:08:57" (1/1) ... [2022-12-14 03:08:57,920 INFO L138 Inliner]: procedures = 25, calls = 34, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 102 [2022-12-14 03:08:57,920 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 03:08:57,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 03:08:57,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 03:08:57,921 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 03:08:57,930 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:08:57" (1/1) ... [2022-12-14 03:08:57,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:08:57" (1/1) ... [2022-12-14 03:08:57,933 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:08:57" (1/1) ... [2022-12-14 03:08:57,934 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:08:57" (1/1) ... [2022-12-14 03:08:57,939 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:08:57" (1/1) ... [2022-12-14 03:08:57,943 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:08:57" (1/1) ... [2022-12-14 03:08:57,945 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:08:57" (1/1) ... [2022-12-14 03:08:57,946 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:08:57" (1/1) ... [2022-12-14 03:08:57,948 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 03:08:57,949 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 03:08:57,949 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 03:08:57,950 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 03:08:57,950 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:08:57" (1/1) ... [2022-12-14 03:08:57,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 03:08:57,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:08:57,978 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 03:08:57,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 03:08:58,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 03:08:58,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 03:08:58,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 03:08:58,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 03:08:58,010 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-14 03:08:58,010 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-14 03:08:58,010 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-14 03:08:58,010 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-14 03:08:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-14 03:08:58,011 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-14 03:08:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 03:08:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 03:08:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 03:08:58,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 03:08:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 03:08:58,012 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 03:08:58,104 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 03:08:58,106 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 03:08:58,317 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 03:08:58,325 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 03:08:58,325 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-14 03:08:58,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:08:58 BoogieIcfgContainer [2022-12-14 03:08:58,327 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 03:08:58,329 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 03:08:58,329 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 03:08:58,331 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 03:08:58,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 03:08:57" (1/3) ... [2022-12-14 03:08:58,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f0d1de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:08:58, skipping insertion in model container [2022-12-14 03:08:58,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:08:57" (2/3) ... [2022-12-14 03:08:58,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f0d1de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:08:58, skipping insertion in model container [2022-12-14 03:08:58,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:08:58" (3/3) ... [2022-12-14 03:08:58,333 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-sum-array-hom.wvr.c [2022-12-14 03:08:58,340 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 03:08:58,348 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 03:08:58,348 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 03:08:58,348 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 03:08:58,413 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-14 03:08:58,442 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 03:08:58,453 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 160 transitions, 344 flow [2022-12-14 03:08:58,455 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 160 transitions, 344 flow [2022-12-14 03:08:58,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 160 transitions, 344 flow [2022-12-14 03:08:58,506 INFO L130 PetriNetUnfolder]: 12/157 cut-off events. [2022-12-14 03:08:58,507 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-14 03:08:58,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 157 events. 12/157 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 101 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 117. Up to 2 conditions per place. [2022-12-14 03:08:58,513 INFO L119 LiptonReduction]: Number of co-enabled transitions 1728 [2022-12-14 03:09:02,701 INFO L134 LiptonReduction]: Checked pairs total: 2000 [2022-12-14 03:09:02,701 INFO L136 LiptonReduction]: Total number of compositions: 149 [2022-12-14 03:09:02,706 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 28 transitions, 80 flow [2022-12-14 03:09:02,722 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 107 states, 106 states have (on average 3.0849056603773586) internal successors, (327), 106 states have internal predecessors, (327), 0 states have call successors, (0), 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-12-14 03:09:02,736 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 03:09:02,741 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;@4a4660c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 03:09:02,741 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-14 03:09:02,742 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 106 states have (on average 3.0849056603773586) internal successors, (327), 106 states have internal predecessors, (327), 0 states have call successors, (0), 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-12-14 03:09:02,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 03:09:02,747 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:09:02,748 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] [2022-12-14 03:09:02,748 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 1 more)] === [2022-12-14 03:09:02,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:09:02,751 INFO L85 PathProgramCache]: Analyzing trace with hash -757646960, now seen corresponding path program 1 times [2022-12-14 03:09:02,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:09:02,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899777650] [2022-12-14 03:09:02,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:09:02,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:09:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:09:03,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:09:03,207 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:09:03,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899777650] [2022-12-14 03:09:03,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899777650] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:09:03,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:09:03,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 03:09:03,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736424878] [2022-12-14 03:09:03,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:09:03,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 03:09:03,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:09:03,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 03:09:03,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 03:09:03,235 INFO L87 Difference]: Start difference. First operand has 107 states, 106 states have (on average 3.0849056603773586) internal successors, (327), 106 states have internal predecessors, (327), 0 states have call successors, (0), 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 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:09:03,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:09:03,292 INFO L93 Difference]: Finished difference Result 204 states and 632 transitions. [2022-12-14 03:09:03,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 03:09:03,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-14 03:09:03,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:09:03,302 INFO L225 Difference]: With dead ends: 204 [2022-12-14 03:09:03,302 INFO L226 Difference]: Without dead ends: 197 [2022-12-14 03:09:03,303 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-12-14 03:09:03,305 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 1 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 03:09:03,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 6 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 03:09:03,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-12-14 03:09:03,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2022-12-14 03:09:03,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 3.13265306122449) internal successors, (614), 196 states have internal predecessors, (614), 0 states have call successors, (0), 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-12-14 03:09:03,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 614 transitions. [2022-12-14 03:09:03,340 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 614 transitions. Word has length 20 [2022-12-14 03:09:03,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:09:03,340 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 614 transitions. [2022-12-14 03:09:03,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:09:03,341 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 614 transitions. [2022-12-14 03:09:03,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 03:09:03,342 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:09:03,342 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] [2022-12-14 03:09:03,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 03:09:03,343 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 1 more)] === [2022-12-14 03:09:03,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:09:03,343 INFO L85 PathProgramCache]: Analyzing trace with hash 198230338, now seen corresponding path program 1 times [2022-12-14 03:09:03,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:09:03,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528037974] [2022-12-14 03:09:03,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:09:03,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:09:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:09:03,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:09:03,432 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:09:03,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528037974] [2022-12-14 03:09:03,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528037974] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:09:03,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:09:03,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 03:09:03,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443814796] [2022-12-14 03:09:03,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:09:03,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 03:09:03,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:09:03,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 03:09:03,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 03:09:03,435 INFO L87 Difference]: Start difference. First operand 197 states and 614 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:09:03,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:09:03,524 INFO L93 Difference]: Finished difference Result 379 states and 1141 transitions. [2022-12-14 03:09:03,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 03:09:03,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-14 03:09:03,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:09:03,528 INFO L225 Difference]: With dead ends: 379 [2022-12-14 03:09:03,528 INFO L226 Difference]: Without dead ends: 375 [2022-12-14 03:09:03,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 03:09:03,529 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 57 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 03:09:03,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 13 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 03:09:03,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-12-14 03:09:03,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 287. [2022-12-14 03:09:03,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 286 states have (on average 3.1783216783216783) internal successors, (909), 286 states have internal predecessors, (909), 0 states have call successors, (0), 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-12-14 03:09:03,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 909 transitions. [2022-12-14 03:09:03,552 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 909 transitions. Word has length 21 [2022-12-14 03:09:03,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:09:03,552 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 909 transitions. [2022-12-14 03:09:03,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:09:03,553 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 909 transitions. [2022-12-14 03:09:03,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 03:09:03,555 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:09:03,555 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] [2022-12-14 03:09:03,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 03:09:03,555 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 1 more)] === [2022-12-14 03:09:03,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:09:03,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1806957622, now seen corresponding path program 1 times [2022-12-14 03:09:03,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:09:03,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20459100] [2022-12-14 03:09:03,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:09:03,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:09:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:09:03,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:09:03,724 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:09:03,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20459100] [2022-12-14 03:09:03,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20459100] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:09:03,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:09:03,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 03:09:03,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761093380] [2022-12-14 03:09:03,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:09:03,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 03:09:03,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:09:03,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 03:09:03,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 03:09:03,726 INFO L87 Difference]: Start difference. First operand 287 states and 909 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:09:03,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:09:03,840 INFO L93 Difference]: Finished difference Result 345 states and 997 transitions. [2022-12-14 03:09:03,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 03:09:03,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-14 03:09:03,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:09:03,850 INFO L225 Difference]: With dead ends: 345 [2022-12-14 03:09:03,850 INFO L226 Difference]: Without dead ends: 329 [2022-12-14 03:09:03,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 03:09:03,852 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 48 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 03:09:03,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 8 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 03:09:03,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-12-14 03:09:03,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 301. [2022-12-14 03:09:03,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 3.0233333333333334) internal successors, (907), 300 states have internal predecessors, (907), 0 states have call successors, (0), 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-12-14 03:09:03,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 907 transitions. [2022-12-14 03:09:03,871 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 907 transitions. Word has length 21 [2022-12-14 03:09:03,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:09:03,871 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 907 transitions. [2022-12-14 03:09:03,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:09:03,871 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 907 transitions. [2022-12-14 03:09:03,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 03:09:03,874 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:09:03,874 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] [2022-12-14 03:09:03,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 03:09:03,875 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 1 more)] === [2022-12-14 03:09:03,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:09:03,875 INFO L85 PathProgramCache]: Analyzing trace with hash -764494791, now seen corresponding path program 1 times [2022-12-14 03:09:03,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:09:03,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708370681] [2022-12-14 03:09:03,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:09:03,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:09:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:09:04,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:09:04,043 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:09:04,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708370681] [2022-12-14 03:09:04,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708370681] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:09:04,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:09:04,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 03:09:04,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852891217] [2022-12-14 03:09:04,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:09:04,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 03:09:04,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:09:04,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 03:09:04,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 03:09:04,045 INFO L87 Difference]: Start difference. First operand 301 states and 907 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:09:04,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:09:04,129 INFO L93 Difference]: Finished difference Result 275 states and 785 transitions. [2022-12-14 03:09:04,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 03:09:04,129 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-14 03:09:04,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:09:04,131 INFO L225 Difference]: With dead ends: 275 [2022-12-14 03:09:04,131 INFO L226 Difference]: Without dead ends: 198 [2022-12-14 03:09:04,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 03:09:04,132 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 40 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 03:09:04,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 15 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 03:09:04,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-12-14 03:09:04,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-12-14 03:09:04,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 3.1218274111675126) internal successors, (615), 197 states have internal predecessors, (615), 0 states have call successors, (0), 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-12-14 03:09:04,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 615 transitions. [2022-12-14 03:09:04,140 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 615 transitions. Word has length 21 [2022-12-14 03:09:04,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:09:04,141 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 615 transitions. [2022-12-14 03:09:04,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:09:04,141 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 615 transitions. [2022-12-14 03:09:04,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 03:09:04,142 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:09:04,142 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] [2022-12-14 03:09:04,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 03:09:04,142 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 1 more)] === [2022-12-14 03:09:04,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:09:04,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1279491755, now seen corresponding path program 1 times [2022-12-14 03:09:04,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:09:04,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90254597] [2022-12-14 03:09:04,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:09:04,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:09:04,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:09:04,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 03:09:04,258 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:09:04,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90254597] [2022-12-14 03:09:04,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90254597] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:09:04,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912103355] [2022-12-14 03:09:04,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:09:04,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:09:04,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:09:04,260 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:09:04,261 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 03:09:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:09:04,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 03:09:04,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:09:04,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 03:09:04,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:09:04,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 03:09:04,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912103355] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 03:09:04,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 03:09:04,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2022-12-14 03:09:04,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430433794] [2022-12-14 03:09:04,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:09:04,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 03:09:04,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:09:04,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 03:09:04,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-12-14 03:09:04,486 INFO L87 Difference]: Start difference. First operand 198 states and 615 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:09:04,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:09:04,605 INFO L93 Difference]: Finished difference Result 276 states and 842 transitions. [2022-12-14 03:09:04,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 03:09:04,606 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-14 03:09:04,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:09:04,607 INFO L225 Difference]: With dead ends: 276 [2022-12-14 03:09:04,607 INFO L226 Difference]: Without dead ends: 276 [2022-12-14 03:09:04,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-12-14 03:09:04,608 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 59 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 03:09:04,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 16 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 03:09:04,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-12-14 03:09:04,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 212. [2022-12-14 03:09:04,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 3.170616113744076) internal successors, (669), 211 states have internal predecessors, (669), 0 states have call successors, (0), 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-12-14 03:09:04,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 669 transitions. [2022-12-14 03:09:04,615 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 669 transitions. Word has length 22 [2022-12-14 03:09:04,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:09:04,615 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 669 transitions. [2022-12-14 03:09:04,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:09:04,615 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 669 transitions. [2022-12-14 03:09:04,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 03:09:04,616 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:09:04,616 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] [2022-12-14 03:09:04,622 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 03:09:04,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:09:04,817 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 1 more)] === [2022-12-14 03:09:04,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:09:04,817 INFO L85 PathProgramCache]: Analyzing trace with hash -208659033, now seen corresponding path program 2 times [2022-12-14 03:09:04,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:09:04,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428980392] [2022-12-14 03:09:04,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:09:04,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:09:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:09:04,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 03:09:04,970 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:09:04,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428980392] [2022-12-14 03:09:04,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428980392] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:09:04,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678439365] [2022-12-14 03:09:04,971 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 03:09:04,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:09:04,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:09:04,972 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:09:04,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 03:09:05,062 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 03:09:05,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 03:09:05,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 03:09:05,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:09:05,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 03:09:05,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:09:05,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 03:09:05,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678439365] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 03:09:05,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 03:09:05,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 15 [2022-12-14 03:09:05,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383748905] [2022-12-14 03:09:05,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:09:05,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 03:09:05,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:09:05,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 03:09:05,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-12-14 03:09:05,205 INFO L87 Difference]: Start difference. First operand 212 states and 669 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:09:05,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:09:05,325 INFO L93 Difference]: Finished difference Result 310 states and 966 transitions. [2022-12-14 03:09:05,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 03:09:05,326 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-14 03:09:05,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:09:05,329 INFO L225 Difference]: With dead ends: 310 [2022-12-14 03:09:05,329 INFO L226 Difference]: Without dead ends: 310 [2022-12-14 03:09:05,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-12-14 03:09:05,330 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 85 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 03:09:05,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 12 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 03:09:05,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-12-14 03:09:05,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 226. [2022-12-14 03:09:05,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 3.2755555555555556) internal successors, (737), 225 states have internal predecessors, (737), 0 states have call successors, (0), 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-12-14 03:09:05,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 737 transitions. [2022-12-14 03:09:05,336 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 737 transitions. Word has length 22 [2022-12-14 03:09:05,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:09:05,337 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 737 transitions. [2022-12-14 03:09:05,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:09:05,337 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 737 transitions. [2022-12-14 03:09:05,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 03:09:05,338 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:09:05,338 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] [2022-12-14 03:09:05,343 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 03:09:05,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-14 03:09:05,539 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 1 more)] === [2022-12-14 03:09:05,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:09:05,539 INFO L85 PathProgramCache]: Analyzing trace with hash 2025448461, now seen corresponding path program 3 times [2022-12-14 03:09:05,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:09:05,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474141566] [2022-12-14 03:09:05,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:09:05,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:09:05,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:09:05,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 03:09:05,741 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:09:05,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474141566] [2022-12-14 03:09:05,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474141566] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:09:05,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939151604] [2022-12-14 03:09:05,741 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 03:09:05,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:09:05,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:09:05,742 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:09:05,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 03:09:05,799 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 03:09:05,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 03:09:05,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 03:09:05,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:09:05,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 03:09:05,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:09:05,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 03:09:05,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939151604] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:09:05,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2123258897] [2022-12-14 03:09:05,923 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 03:09:05,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:09:05,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-12-14 03:09:05,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278564194] [2022-12-14 03:09:05,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:09:05,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 03:09:05,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:09:05,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 03:09:05,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-12-14 03:09:05,927 INFO L87 Difference]: Start difference. First operand 226 states and 737 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:09:06,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:09:06,203 INFO L93 Difference]: Finished difference Result 296 states and 933 transitions. [2022-12-14 03:09:06,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 03:09:06,203 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-14 03:09:06,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:09:06,205 INFO L225 Difference]: With dead ends: 296 [2022-12-14 03:09:06,205 INFO L226 Difference]: Without dead ends: 296 [2022-12-14 03:09:06,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2022-12-14 03:09:06,206 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 147 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 03:09:06,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 39 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 03:09:06,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-12-14 03:09:06,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 210. [2022-12-14 03:09:06,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 3.172248803827751) internal successors, (663), 209 states have internal predecessors, (663), 0 states have call successors, (0), 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-12-14 03:09:06,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 663 transitions. [2022-12-14 03:09:06,214 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 663 transitions. Word has length 22 [2022-12-14 03:09:06,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:09:06,214 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 663 transitions. [2022-12-14 03:09:06,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:09:06,215 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 663 transitions. [2022-12-14 03:09:06,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 03:09:06,215 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:09:06,216 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] [2022-12-14 03:09:06,221 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 03:09:06,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-14 03:09:06,416 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 1 more)] === [2022-12-14 03:09:06,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:09:06,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1392493333, now seen corresponding path program 4 times [2022-12-14 03:09:06,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:09:06,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534576414] [2022-12-14 03:09:06,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:09:06,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:09:06,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:09:06,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 03:09:06,549 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:09:06,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534576414] [2022-12-14 03:09:06,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534576414] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:09:06,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752868756] [2022-12-14 03:09:06,549 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 03:09:06,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:09:06,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:09:06,550 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:09:06,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 03:09:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:09:06,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 03:09:06,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:09:06,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 03:09:06,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:09:06,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 03:09:06,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752868756] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 03:09:06,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 03:09:06,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2022-12-14 03:09:06,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384413246] [2022-12-14 03:09:06,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:09:06,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 03:09:06,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:09:06,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 03:09:06,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-12-14 03:09:06,738 INFO L87 Difference]: Start difference. First operand 210 states and 663 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:09:06,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:09:06,842 INFO L93 Difference]: Finished difference Result 274 states and 854 transitions. [2022-12-14 03:09:06,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 03:09:06,843 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-14 03:09:06,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:09:06,844 INFO L225 Difference]: With dead ends: 274 [2022-12-14 03:09:06,844 INFO L226 Difference]: Without dead ends: 274 [2022-12-14 03:09:06,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-12-14 03:09:06,845 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 62 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 03:09:06,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 17 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 03:09:06,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-12-14 03:09:06,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 216. [2022-12-14 03:09:06,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 3.2046511627906975) internal successors, (689), 215 states have internal predecessors, (689), 0 states have call successors, (0), 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-12-14 03:09:06,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 689 transitions. [2022-12-14 03:09:06,854 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 689 transitions. Word has length 22 [2022-12-14 03:09:06,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:09:06,854 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 689 transitions. [2022-12-14 03:09:06,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:09:06,855 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 689 transitions. [2022-12-14 03:09:06,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 03:09:06,855 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:09:06,855 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] [2022-12-14 03:09:06,861 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 03:09:07,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:09:07,056 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 1 more)] === [2022-12-14 03:09:07,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:09:07,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1661553205, now seen corresponding path program 5 times [2022-12-14 03:09:07,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:09:07,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448990818] [2022-12-14 03:09:07,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:09:07,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:09:07,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:09:07,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 03:09:07,178 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:09:07,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448990818] [2022-12-14 03:09:07,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448990818] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:09:07,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409819394] [2022-12-14 03:09:07,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 03:09:07,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:09:07,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:09:07,180 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:09:07,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 03:09:07,256 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 03:09:07,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 03:09:07,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 03:09:07,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:09:07,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 03:09:07,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:09:07,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 03:09:07,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409819394] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 03:09:07,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 03:09:07,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 15 [2022-12-14 03:09:07,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277748807] [2022-12-14 03:09:07,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:09:07,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 03:09:07,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:09:07,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 03:09:07,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-12-14 03:09:07,396 INFO L87 Difference]: Start difference. First operand 216 states and 689 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:09:07,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:09:07,503 INFO L93 Difference]: Finished difference Result 306 states and 943 transitions. [2022-12-14 03:09:07,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 03:09:07,503 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-14 03:09:07,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:09:07,506 INFO L225 Difference]: With dead ends: 306 [2022-12-14 03:09:07,506 INFO L226 Difference]: Without dead ends: 306 [2022-12-14 03:09:07,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2022-12-14 03:09:07,507 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 54 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 03:09:07,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 12 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 03:09:07,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-12-14 03:09:07,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 218. [2022-12-14 03:09:07,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 3.248847926267281) internal successors, (705), 217 states have internal predecessors, (705), 0 states have call successors, (0), 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-12-14 03:09:07,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 705 transitions. [2022-12-14 03:09:07,512 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 705 transitions. Word has length 22 [2022-12-14 03:09:07,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:09:07,512 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 705 transitions. [2022-12-14 03:09:07,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:09:07,513 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 705 transitions. [2022-12-14 03:09:07,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 03:09:07,513 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:09:07,513 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] [2022-12-14 03:09:07,518 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 03:09:07,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:09:07,714 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 1 more)] === [2022-12-14 03:09:07,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:09:07,714 INFO L85 PathProgramCache]: Analyzing trace with hash 915070385, now seen corresponding path program 6 times [2022-12-14 03:09:07,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:09:07,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278012278] [2022-12-14 03:09:07,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:09:07,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:09:07,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:09:07,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 03:09:07,879 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:09:07,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278012278] [2022-12-14 03:09:07,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278012278] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:09:07,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010495246] [2022-12-14 03:09:07,880 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 03:09:07,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:09:07,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:09:07,881 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:09:07,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 03:09:07,944 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 03:09:07,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 03:09:07,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 03:09:07,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:09:08,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 03:09:08,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:09:08,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 03:09:08,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010495246] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:09:08,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1436125311] [2022-12-14 03:09:08,056 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 03:09:08,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:09:08,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-12-14 03:09:08,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650788920] [2022-12-14 03:09:08,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:09:08,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 03:09:08,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:09:08,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 03:09:08,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-12-14 03:09:08,058 INFO L87 Difference]: Start difference. First operand 218 states and 705 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:09:08,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:09:08,341 INFO L93 Difference]: Finished difference Result 278 states and 880 transitions. [2022-12-14 03:09:08,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 03:09:08,342 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-14 03:09:08,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:09:08,344 INFO L225 Difference]: With dead ends: 278 [2022-12-14 03:09:08,345 INFO L226 Difference]: Without dead ends: 278 [2022-12-14 03:09:08,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2022-12-14 03:09:08,345 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 118 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 03:09:08,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 35 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 03:09:08,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-12-14 03:09:08,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 180. [2022-12-14 03:09:08,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 3.1340782122905027) internal successors, (561), 179 states have internal predecessors, (561), 0 states have call successors, (0), 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-12-14 03:09:08,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 561 transitions. [2022-12-14 03:09:08,350 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 561 transitions. Word has length 22 [2022-12-14 03:09:08,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:09:08,350 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 561 transitions. [2022-12-14 03:09:08,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:09:08,350 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 561 transitions. [2022-12-14 03:09:08,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 03:09:08,351 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:09:08,351 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] [2022-12-14 03:09:08,356 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 03:09:08,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-14 03:09:08,553 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 1 more)] === [2022-12-14 03:09:08,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:09:08,554 INFO L85 PathProgramCache]: Analyzing trace with hash 329235529, now seen corresponding path program 1 times [2022-12-14 03:09:08,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:09:08,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740123992] [2022-12-14 03:09:08,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:09:08,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:09:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:09:08,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 03:09:08,739 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:09:08,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740123992] [2022-12-14 03:09:08,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740123992] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:09:08,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058203445] [2022-12-14 03:09:08,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:09:08,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:09:08,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:09:08,740 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:09:08,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 03:09:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:09:08,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 03:09:08,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:09:08,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 03:09:08,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:09:08,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 03:09:08,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058203445] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 03:09:08,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 03:09:08,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2022-12-14 03:09:08,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877939826] [2022-12-14 03:09:08,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:09:08,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 03:09:08,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:09:08,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 03:09:08,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-14 03:09:08,869 INFO L87 Difference]: Start difference. First operand 180 states and 561 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:09:08,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:09:08,916 INFO L93 Difference]: Finished difference Result 224 states and 707 transitions. [2022-12-14 03:09:08,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 03:09:08,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-14 03:09:08,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:09:08,917 INFO L225 Difference]: With dead ends: 224 [2022-12-14 03:09:08,917 INFO L226 Difference]: Without dead ends: 224 [2022-12-14 03:09:08,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-12-14 03:09:08,918 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 53 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 7 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.0s IncrementalHoareTripleChecker+Time [2022-12-14 03:09:08,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 7 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 03:09:08,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-12-14 03:09:08,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2022-12-14 03:09:08,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 3.1704035874439462) internal successors, (707), 223 states have internal predecessors, (707), 0 states have call successors, (0), 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-12-14 03:09:08,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 707 transitions. [2022-12-14 03:09:08,926 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 707 transitions. Word has length 22 [2022-12-14 03:09:08,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:09:08,926 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 707 transitions. [2022-12-14 03:09:08,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:09:08,926 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 707 transitions. [2022-12-14 03:09:08,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 03:09:08,927 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:09:08,927 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] [2022-12-14 03:09:08,932 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 03:09:09,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:09:09,128 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 1 more)] === [2022-12-14 03:09:09,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:09:09,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1485329135, now seen corresponding path program 1 times [2022-12-14 03:09:09,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:09:09,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622826132] [2022-12-14 03:09:09,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:09:09,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:09:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:09:09,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:09:09,796 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:09:09,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622826132] [2022-12-14 03:09:09,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622826132] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:09:09,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479960946] [2022-12-14 03:09:09,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:09:09,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:09:09,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:09:09,798 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:09:09,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 03:09:09,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:09:09,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 03:09:09,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:09:09,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 03:09:09,973 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-12-14 03:09:10,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:09:10,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 03:09:10,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-14 03:09:10,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:09:10,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:09:10,276 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int))) (= (mod (+ c_~sum3~0 c_~sum2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_436) c_~A~0.base) c_~A~0.offset)) 4294967296) (mod c_~sum1~0 4294967296))) is different from false [2022-12-14 03:09:10,290 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int))) (= (mod (+ c_~sum1~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4)))) 4294967296) (mod (+ c_~sum3~0 c_~sum2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_436) c_~A~0.base) c_~A~0.offset)) 4294967296))) is different from false [2022-12-14 03:09:10,344 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_435 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_435))) (= (mod (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) c_~sum1~0) 4294967296) (mod (+ c_~sum3~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_436) |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) c_~sum2~0) 4294967296)))) is different from false [2022-12-14 03:09:10,358 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:09:10,358 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 53 treesize of output 42 [2022-12-14 03:09:10,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 430 treesize of output 382 [2022-12-14 03:09:10,370 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 382 treesize of output 358 [2022-12-14 03:09:10,375 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 358 treesize of output 342 [2022-12-14 03:09:20,185 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-14 03:09:20,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479960946] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:09:20,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [65955404] [2022-12-14 03:09:20,186 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 03:09:20,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:09:20,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-12-14 03:09:20,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225009819] [2022-12-14 03:09:20,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:09:20,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-14 03:09:20,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:09:20,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-14 03:09:20,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=328, Unknown=4, NotChecked=120, Total=552 [2022-12-14 03:09:20,188 INFO L87 Difference]: Start difference. First operand 224 states and 707 transitions. Second operand has 24 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:09:20,414 WARN L837 $PredicateComparison]: unable to prove that (and (<= c_~sum2~0 c_~sum1~0) (= c_~sum3~0 0) (forall ((v_ArrVal_436 (Array Int Int))) (= (mod (+ c_~sum3~0 c_~sum2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_436) c_~A~0.base) c_~A~0.offset)) 4294967296) (mod (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~sum1~0) 4294967296))) (<= c_~sum1~0 c_~sum2~0)) is different from false [2022-12-14 03:09:20,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:09:20,588 INFO L93 Difference]: Finished difference Result 405 states and 1294 transitions. [2022-12-14 03:09:20,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 03:09:20,589 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-14 03:09:20,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:09:20,591 INFO L225 Difference]: With dead ends: 405 [2022-12-14 03:09:20,591 INFO L226 Difference]: Without dead ends: 398 [2022-12-14 03:09:20,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=149, Invalid=462, Unknown=5, NotChecked=196, Total=812 [2022-12-14 03:09:20,591 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 116 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 219 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 03:09:20,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 58 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 404 Invalid, 0 Unknown, 219 Unchecked, 0.3s Time] [2022-12-14 03:09:20,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2022-12-14 03:09:20,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 293. [2022-12-14 03:09:20,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 292 states have (on average 3.3493150684931505) internal successors, (978), 292 states have internal predecessors, (978), 0 states have call successors, (0), 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-12-14 03:09:20,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 978 transitions. [2022-12-14 03:09:20,598 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 978 transitions. Word has length 23 [2022-12-14 03:09:20,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:09:20,598 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 978 transitions. [2022-12-14 03:09:20,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:09:20,598 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 978 transitions. [2022-12-14 03:09:20,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 03:09:20,599 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:09:20,599 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] [2022-12-14 03:09:20,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-14 03:09:20,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-14 03:09:20,801 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 1 more)] === [2022-12-14 03:09:20,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:09:20,802 INFO L85 PathProgramCache]: Analyzing trace with hash 238185748, now seen corresponding path program 1 times [2022-12-14 03:09:20,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:09:20,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034341621] [2022-12-14 03:09:20,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:09:20,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:09:20,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:09:21,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:09:21,616 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:09:21,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034341621] [2022-12-14 03:09:21,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034341621] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:09:21,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6017779] [2022-12-14 03:09:21,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:09:21,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:09:21,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:09:21,617 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:09:21,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 03:09:21,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:09:21,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 03:09:21,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:09:21,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 03:09:21,809 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-12-14 03:09:21,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:09:21,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 03:09:22,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:09:22,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 03:09:22,166 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:09:22,166 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 17 treesize of output 17 [2022-12-14 03:09:22,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:09:22,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:09:23,021 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:09:23,022 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 60 treesize of output 49 [2022-12-14 03:09:23,039 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:09:23,039 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 990 treesize of output 904 [2022-12-14 03:09:23,050 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 894 treesize of output 846 [2022-12-14 03:09:23,066 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:09:23,066 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 846 treesize of output 800 [2022-12-14 03:09:23,075 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 790 treesize of output 694 [2022-12-14 03:09:32,901 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:09:36,107 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:09:58,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:09:58,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6017779] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:09:58,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1378280648] [2022-12-14 03:09:58,848 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 03:09:58,848 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:09:58,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 33 [2022-12-14 03:09:58,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276022178] [2022-12-14 03:09:58,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:09:58,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 03:09:58,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:09:58,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 03:09:58,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1024, Unknown=20, NotChecked=0, Total=1190 [2022-12-14 03:09:58,850 INFO L87 Difference]: Start difference. First operand 293 states and 978 transitions. Second operand has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:01,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:10:01,043 INFO L93 Difference]: Finished difference Result 729 states and 2337 transitions. [2022-12-14 03:10:01,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-14 03:10:01,043 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-14 03:10:01,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:10:01,046 INFO L225 Difference]: With dead ends: 729 [2022-12-14 03:10:01,046 INFO L226 Difference]: Without dead ends: 715 [2022-12-14 03:10:01,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=394, Invalid=2238, Unknown=20, NotChecked=0, Total=2652 [2022-12-14 03:10:01,047 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 290 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 2250 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 2263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-14 03:10:01,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 112 Invalid, 2263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2250 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-14 03:10:01,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2022-12-14 03:10:01,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 429. [2022-12-14 03:10:01,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 428 states have (on average 3.399532710280374) internal successors, (1455), 428 states have internal predecessors, (1455), 0 states have call successors, (0), 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-12-14 03:10:01,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 1455 transitions. [2022-12-14 03:10:01,056 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 1455 transitions. Word has length 23 [2022-12-14 03:10:01,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:10:01,057 INFO L495 AbstractCegarLoop]: Abstraction has 429 states and 1455 transitions. [2022-12-14 03:10:01,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:01,057 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 1455 transitions. [2022-12-14 03:10:01,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 03:10:01,058 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:10:01,058 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] [2022-12-14 03:10:01,062 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 03:10:01,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-14 03:10:01,259 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 1 more)] === [2022-12-14 03:10:01,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:10:01,260 INFO L85 PathProgramCache]: Analyzing trace with hash 376790875, now seen corresponding path program 2 times [2022-12-14 03:10:01,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:10:01,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782138191] [2022-12-14 03:10:01,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:10:01,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:10:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:10:01,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:10:01,814 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:10:01,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782138191] [2022-12-14 03:10:01,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782138191] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:10:01,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484291150] [2022-12-14 03:10:01,814 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 03:10:01,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:10:01,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:10:01,815 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:10:01,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1c2ffcd-8c82-4f6b-acd6-e4e632b9b66a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 03:10:01,904 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 03:10:01,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 03:10:01,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-14 03:10:01,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:10:01,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 03:10:01,980 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-12-14 03:10:02,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:10:02,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 03:10:02,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:10:02,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 03:10:02,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-14 03:10:02,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:10:02,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:10:02,327 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_534 (Array Int Int))) (= (mod (+ c_~sum3~0 c_~sum2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_534) c_~A~0.base) c_~A~0.offset)) 4294967296) (mod c_~sum1~0 4294967296))) is different from false [2022-12-14 03:10:02,339 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_534 (Array Int Int)) (v_ArrVal_533 (Array Int Int))) (= (mod (+ c_~sum3~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_533) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_534) c_~A~0.base) c_~A~0.offset) c_~sum2~0) 4294967296) (mod c_~sum1~0 4294967296))) is different from false [2022-12-14 03:10:02,352 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_534 (Array Int Int)) (v_ArrVal_533 (Array Int Int))) (= (mod (+ c_~sum1~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4)))) 4294967296) (mod (+ c_~sum3~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_533) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_534) c_~A~0.base) c_~A~0.offset) c_~sum2~0) 4294967296))) is different from false [2022-12-14 03:10:02,428 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_534 (Array Int Int)) (v_ArrVal_533 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_532))) (= (mod (+ c_~sum3~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_533) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_534) |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) c_~sum2~0) 4294967296) (mod (+ c_~sum1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) 4294967296)))) is different from false [2022-12-14 03:10:02,438 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:10:02,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 45 [2022-12-14 03:10:02,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3478 treesize of output 3158 [2022-12-14 03:10:02,459 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 3158 treesize of output 3094 [2022-12-14 03:10:02,474 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 3094 treesize of output 2934 [2022-12-14 03:10:02,489 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 2934 treesize of output 2806 [2022-12-14 03:10:14,573 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:10:14,626 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:10:20,775 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:10:20,822 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:10:27,542 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 03:10:38,976 WARN L233 SmtUtils]: Spent 11.31s on a formula simplification. DAG size of input: 669 DAG size of output: 669 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-14 03:10:50,151 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:10:50,193 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:10:56,088 WARN L233 SmtUtils]: Spent 5.83s on a formula simplification. DAG size of input: 627 DAG size of output: 627 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-14 03:11:30,215 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:11:38,360 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:11:49,246 WARN L233 SmtUtils]: Spent 10.79s on a formula simplification. DAG size of input: 731 DAG size of output: 731 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-14 03:12:06,558 WARN L233 SmtUtils]: Spent 5.56s on a formula simplification. DAG size of input: 719 DAG size of output: 719 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-14 03:12:23,170 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:12:29,204 WARN L233 SmtUtils]: Spent 5.84s on a formula simplification. DAG size of input: 717 DAG size of output: 717 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-14 03:12:33,223 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:12:50,326 WARN L233 SmtUtils]: Spent 16.96s on a formula simplification. DAG size of input: 888 DAG size of output: 888 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-14 03:13:20,589 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:20,613 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:20,614 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 03:13:20,633 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:20,662 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:20,723 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:20,770 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:20,826 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:20,882 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:20,907 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:20,909 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:20,947 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:20,948 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:21,023 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:21,024 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:21,085 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:21,086 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:21,137 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:21,138 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:21,159 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 03:13:21,160 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:21,161 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:21,190 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2022-12-14 03:13:21,191 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 03:13:21,192 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:21,193 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:21,226 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 03:13:21,227 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:21,229 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:21,290 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 03:13:21,292 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:21,293 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:21,319 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 03:13:21,320 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 03:13:21,321 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:21,323 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:21,367 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 03:13:21,368 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 03:13:21,369 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:21,371 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:21,440 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 03:13:21,441 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 03:13:21,443 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:21,444 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:21,517 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 03:13:21,518 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 03:13:21,519 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:21,521 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:21,567 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 03:13:21,568 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 03:13:21,570 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:21,571 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:21,640 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 03:13:21,641 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 03:13:21,642 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:21,644 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:21,712 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 03:13:21,713 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 03:13:21,715 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:21,716 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:21,754 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 03:13:21,755 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 03:13:21,756 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:21,760 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:21,761 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2022-12-14 03:13:21,833 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 03:13:21,835 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 03:13:21,836 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:21,838 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:21,839 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2022-12-14 03:13:21,886 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 03:13:21,888 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2022-12-14 03:13:21,890 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 03:13:21,893 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:21,896 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:21,897 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2022-12-14 03:13:21,946 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 03:13:21,947 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2022-12-14 03:13:21,949 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 03:13:21,951 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:21,954 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2022-12-14 03:13:21,956 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:21,958 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2022-12-14 03:13:22,039 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 03:13:22,041 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2022-12-14 03:13:22,042 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 03:13:22,044 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:22,046 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:22,047 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2022-12-14 03:13:22,112 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 03:13:22,113 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2022-12-14 03:13:22,114 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 03:13:22,116 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:22,118 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:22,119 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2022-12-14 03:13:22,196 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 03:13:22,197 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2022-12-14 03:13:22,198 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 03:13:22,200 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:22,201 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:22,202 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2022-12-14 03:13:22,247 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2022-12-14 03:13:22,248 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 03:13:22,249 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2022-12-14 03:13:22,250 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 03:13:22,252 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:22,254 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:22,255 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2022-12-14 03:13:22,321 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2022-12-14 03:13:22,322 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 03:13:22,323 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2022-12-14 03:13:22,324 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 03:13:22,325 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:22,328 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 03:13:22,329 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2022-12-14 03:13:22,387 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2022-12-14 03:13:22,388 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 03:13:22,389 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2022-12-14 03:13:22,391 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts.