./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread/queue_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/queue_ok.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-22 01:23:32,698 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 01:23:32,701 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 01:23:32,745 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 01:23:32,756 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 01:23:32,758 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 01:23:32,761 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 01:23:32,767 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 01:23:32,770 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 01:23:32,772 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 01:23:32,774 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 01:23:32,776 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 01:23:32,778 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 01:23:32,782 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 01:23:32,788 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 01:23:32,790 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 01:23:32,791 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 01:23:32,792 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 01:23:32,795 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 01:23:32,798 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 01:23:32,802 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 01:23:32,804 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 01:23:32,805 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 01:23:32,807 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 01:23:32,811 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 01:23:32,811 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 01:23:32,811 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 01:23:32,813 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 01:23:32,813 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 01:23:32,824 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 01:23:32,825 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 01:23:32,826 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 01:23:32,828 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 01:23:32,830 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 01:23:32,831 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 01:23:32,832 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 01:23:32,833 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 01:23:32,833 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 01:23:32,833 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 01:23:32,834 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 01:23:32,835 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 01:23:32,836 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-22 01:23:32,888 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 01:23:32,888 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 01:23:32,889 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 01:23:32,889 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 01:23:32,890 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 01:23:32,891 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 01:23:32,891 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 01:23:32,891 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 01:23:32,892 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 01:23:32,892 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 01:23:32,893 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 01:23:32,894 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 01:23:32,894 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 01:23:32,894 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 01:23:32,895 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 01:23:32,895 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 01:23:32,895 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 01:23:32,895 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 01:23:32,896 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-22 01:23:32,897 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-22 01:23:32,897 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 01:23:32,897 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 01:23:32,898 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 01:23:32,898 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 01:23:32,898 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 01:23:32,898 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 01:23:32,899 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-22 01:23:32,899 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-22 01:23:32,899 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-22 01:23:32,900 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 01:23:32,900 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-22 01:23:32,900 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 01:23:32,901 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 01:23:32,901 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 01:23:32,901 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 01:23:32,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:23:32,902 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 01:23:32,902 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 01:23:32,903 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 01:23:32,903 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 01:23:32,903 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 01:23:32,903 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 01:23:32,904 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_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 [2022-11-22 01:23:33,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 01:23:33,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 01:23:33,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 01:23:33,310 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 01:23:33,311 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 01:23:33,312 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/pthread/queue_ok.i [2022-11-22 01:23:36,701 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 01:23:37,109 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 01:23:37,114 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/sv-benchmarks/c/pthread/queue_ok.i [2022-11-22 01:23:37,137 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/data/cef0c10e9/192fe2c8e9d84135991820d9e7e4d1e3/FLAG7b7e2ada0 [2022-11-22 01:23:37,163 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/data/cef0c10e9/192fe2c8e9d84135991820d9e7e4d1e3 [2022-11-22 01:23:37,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 01:23:37,172 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 01:23:37,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 01:23:37,175 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 01:23:37,179 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 01:23:37,181 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:23:37" (1/1) ... [2022-11-22 01:23:37,182 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b44a537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:37, skipping insertion in model container [2022-11-22 01:23:37,183 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:23:37" (1/1) ... [2022-11-22 01:23:37,192 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 01:23:37,250 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 01:23:37,876 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_f187267f-2b34-4425-a34a-41c65eb65e7e/sv-benchmarks/c/pthread/queue_ok.i[43266,43279] [2022-11-22 01:23:37,882 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_f187267f-2b34-4425-a34a-41c65eb65e7e/sv-benchmarks/c/pthread/queue_ok.i[43543,43556] [2022-11-22 01:23:37,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:23:37,903 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 01:23:37,961 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_f187267f-2b34-4425-a34a-41c65eb65e7e/sv-benchmarks/c/pthread/queue_ok.i[43266,43279] [2022-11-22 01:23:37,965 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_f187267f-2b34-4425-a34a-41c65eb65e7e/sv-benchmarks/c/pthread/queue_ok.i[43543,43556] [2022-11-22 01:23:37,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:23:38,030 INFO L208 MainTranslator]: Completed translation [2022-11-22 01:23:38,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:38 WrapperNode [2022-11-22 01:23:38,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 01:23:38,032 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 01:23:38,033 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 01:23:38,033 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 01:23:38,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:38" (1/1) ... [2022-11-22 01:23:38,067 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:38" (1/1) ... [2022-11-22 01:23:38,127 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 202 [2022-11-22 01:23:38,127 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 01:23:38,128 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 01:23:38,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 01:23:38,129 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 01:23:38,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:38" (1/1) ... [2022-11-22 01:23:38,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:38" (1/1) ... [2022-11-22 01:23:38,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:38" (1/1) ... [2022-11-22 01:23:38,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:38" (1/1) ... [2022-11-22 01:23:38,182 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:38" (1/1) ... [2022-11-22 01:23:38,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:38" (1/1) ... [2022-11-22 01:23:38,190 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:38" (1/1) ... [2022-11-22 01:23:38,192 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:38" (1/1) ... [2022-11-22 01:23:38,196 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 01:23:38,198 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 01:23:38,198 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 01:23:38,198 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 01:23:38,199 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:38" (1/1) ... [2022-11-22 01:23:38,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:23:38,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:23:38,269 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 01:23:38,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 01:23:38,320 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-22 01:23:38,320 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-22 01:23:38,321 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-22 01:23:38,322 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-22 01:23:38,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 01:23:38,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 01:23:38,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-22 01:23:38,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 01:23:38,323 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-22 01:23:38,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 01:23:38,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 01:23:38,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 01:23:38,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 01:23:38,327 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-22 01:23:38,526 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 01:23:38,528 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 01:23:39,251 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 01:23:39,264 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 01:23:39,264 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-22 01:23:39,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:23:39 BoogieIcfgContainer [2022-11-22 01:23:39,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 01:23:39,271 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 01:23:39,271 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 01:23:39,276 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 01:23:39,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:23:37" (1/3) ... [2022-11-22 01:23:39,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279eb368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:23:39, skipping insertion in model container [2022-11-22 01:23:39,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:38" (2/3) ... [2022-11-22 01:23:39,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279eb368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:23:39, skipping insertion in model container [2022-11-22 01:23:39,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:23:39" (3/3) ... [2022-11-22 01:23:39,280 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2022-11-22 01:23:39,306 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 01:23:39,306 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2022-11-22 01:23:39,306 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-22 01:23:39,573 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-22 01:23:39,623 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-22 01:23:39,660 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 285 places, 291 transitions, 598 flow [2022-11-22 01:23:39,670 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 285 places, 291 transitions, 598 flow [2022-11-22 01:23:39,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 285 places, 291 transitions, 598 flow [2022-11-22 01:23:39,864 INFO L130 PetriNetUnfolder]: 13/289 cut-off events. [2022-11-22 01:23:39,865 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-22 01:23:39,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 289 events. 13/289 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 675 event pairs, 0 based on Foata normal form. 0/215 useless extension candidates. Maximal degree in co-relation 190. Up to 3 conditions per place. [2022-11-22 01:23:39,888 INFO L119 LiptonReduction]: Number of co-enabled transitions 18694 [2022-11-22 01:24:05,698 INFO L134 LiptonReduction]: Checked pairs total: 59291 [2022-11-22 01:24:05,699 INFO L136 LiptonReduction]: Total number of compositions: 457 [2022-11-22 01:24:05,710 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 109 places, 109 transitions, 234 flow [2022-11-22 01:24:05,971 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5589 states, 4122 states have (on average 3.8469189713731198) internal successors, (15857), 5588 states have internal predecessors, (15857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:06,002 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 01:24:06,013 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@44120fb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 01:24:06,013 INFO L358 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2022-11-22 01:24:06,035 INFO L276 IsEmpty]: Start isEmpty. Operand has 5589 states, 4122 states have (on average 3.8469189713731198) internal successors, (15857), 5588 states have internal predecessors, (15857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:06,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-22 01:24:06,042 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:24:06,043 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-22 01:24:06,044 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-22 01:24:06,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:24:06,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1279, now seen corresponding path program 1 times [2022-11-22 01:24:06,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:24:06,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440819714] [2022-11-22 01:24:06,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:24:06,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:24:06,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:24:06,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:24:06,248 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:24:06,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440819714] [2022-11-22 01:24:06,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440819714] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:24:06,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:24:06,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-22 01:24:06,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334037401] [2022-11-22 01:24:06,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:24:06,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-22 01:24:06,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:24:06,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-22 01:24:06,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-22 01:24:06,322 INFO L87 Difference]: Start difference. First operand has 5589 states, 4122 states have (on average 3.8469189713731198) internal successors, (15857), 5588 states have internal predecessors, (15857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:06,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:24:06,590 INFO L93 Difference]: Finished difference Result 2668 states and 7688 transitions. [2022-11-22 01:24:06,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-22 01:24:06,594 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 1 [2022-11-22 01:24:06,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:24:06,636 INFO L225 Difference]: With dead ends: 2668 [2022-11-22 01:24:06,637 INFO L226 Difference]: Without dead ends: 2668 [2022-11-22 01:24:06,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-22 01:24:06,643 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:24:06,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:24:06,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2022-11-22 01:24:06,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 2668. [2022-11-22 01:24:06,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2668 states, 2340 states have (on average 3.2854700854700853) internal successors, (7688), 2667 states have internal predecessors, (7688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:06,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2668 states and 7688 transitions. [2022-11-22 01:24:06,914 INFO L78 Accepts]: Start accepts. Automaton has 2668 states and 7688 transitions. Word has length 1 [2022-11-22 01:24:06,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:24:06,915 INFO L495 AbstractCegarLoop]: Abstraction has 2668 states and 7688 transitions. [2022-11-22 01:24:06,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:06,918 INFO L276 IsEmpty]: Start isEmpty. Operand 2668 states and 7688 transitions. [2022-11-22 01:24:06,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-22 01:24:06,918 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:24:06,919 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-22 01:24:06,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 01:24:06,919 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-22 01:24:06,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:24:06,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1279544, now seen corresponding path program 1 times [2022-11-22 01:24:06,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:24:06,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236735776] [2022-11-22 01:24:06,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:24:06,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:24:06,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:24:07,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:24:07,233 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:24:07,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236735776] [2022-11-22 01:24:07,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236735776] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:24:07,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:24:07,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 01:24:07,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912724768] [2022-11-22 01:24:07,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:24:07,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:24:07,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:24:07,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:24:07,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:24:07,238 INFO L87 Difference]: Start difference. First operand 2668 states and 7688 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:07,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:24:07,390 INFO L93 Difference]: Finished difference Result 2618 states and 7583 transitions. [2022-11-22 01:24:07,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:24:07,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-11-22 01:24:07,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:24:07,411 INFO L225 Difference]: With dead ends: 2618 [2022-11-22 01:24:07,411 INFO L226 Difference]: Without dead ends: 2618 [2022-11-22 01:24:07,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:24:07,413 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 65 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:24:07,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 4 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:24:07,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2618 states. [2022-11-22 01:24:07,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2618 to 2618. [2022-11-22 01:24:07,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2618 states, 2310 states have (on average 3.2826839826839826) internal successors, (7583), 2617 states have internal predecessors, (7583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:07,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2618 states to 2618 states and 7583 transitions. [2022-11-22 01:24:07,518 INFO L78 Accepts]: Start accepts. Automaton has 2618 states and 7583 transitions. Word has length 3 [2022-11-22 01:24:07,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:24:07,520 INFO L495 AbstractCegarLoop]: Abstraction has 2618 states and 7583 transitions. [2022-11-22 01:24:07,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:07,520 INFO L276 IsEmpty]: Start isEmpty. Operand 2618 states and 7583 transitions. [2022-11-22 01:24:07,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-22 01:24:07,521 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:24:07,521 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-22 01:24:07,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 01:24:07,522 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-22 01:24:07,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:24:07,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1279543, now seen corresponding path program 1 times [2022-11-22 01:24:07,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:24:07,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327378949] [2022-11-22 01:24:07,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:24:07,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:24:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:24:07,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:24:07,668 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:24:07,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327378949] [2022-11-22 01:24:07,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327378949] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:24:07,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:24:07,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 01:24:07,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461364618] [2022-11-22 01:24:07,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:24:07,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:24:07,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:24:07,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:24:07,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:24:07,671 INFO L87 Difference]: Start difference. First operand 2618 states and 7583 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:07,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:24:07,817 INFO L93 Difference]: Finished difference Result 2568 states and 7478 transitions. [2022-11-22 01:24:07,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:24:07,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-11-22 01:24:07,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:24:07,837 INFO L225 Difference]: With dead ends: 2568 [2022-11-22 01:24:07,838 INFO L226 Difference]: Without dead ends: 2568 [2022-11-22 01:24:07,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:24:07,839 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:24:07,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 4 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:24:07,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2022-11-22 01:24:08,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2568. [2022-11-22 01:24:08,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2568 states, 2280 states have (on average 3.2798245614035086) internal successors, (7478), 2567 states have internal predecessors, (7478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:08,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 7478 transitions. [2022-11-22 01:24:08,052 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 7478 transitions. Word has length 3 [2022-11-22 01:24:08,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:24:08,055 INFO L495 AbstractCegarLoop]: Abstraction has 2568 states and 7478 transitions. [2022-11-22 01:24:08,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:08,056 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 7478 transitions. [2022-11-22 01:24:08,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-22 01:24:08,057 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:24:08,057 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-22 01:24:08,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 01:24:08,061 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-22 01:24:08,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:24:08,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1229669010, now seen corresponding path program 1 times [2022-11-22 01:24:08,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:24:08,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656445172] [2022-11-22 01:24:08,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:24:08,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:24:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:24:08,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:24:08,223 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:24:08,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656445172] [2022-11-22 01:24:08,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656445172] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:24:08,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:24:08,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:24:08,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811840892] [2022-11-22 01:24:08,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:24:08,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:24:08,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:24:08,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:24:08,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:24:08,226 INFO L87 Difference]: Start difference. First operand 2568 states and 7478 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:08,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:24:08,374 INFO L93 Difference]: Finished difference Result 1952 states and 5508 transitions. [2022-11-22 01:24:08,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:24:08,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-22 01:24:08,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:24:08,390 INFO L225 Difference]: With dead ends: 1952 [2022-11-22 01:24:08,390 INFO L226 Difference]: Without dead ends: 1952 [2022-11-22 01:24:08,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:24:08,392 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 123 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:24:08,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 4 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:24:08,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1952 states. [2022-11-22 01:24:08,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1952 to 1952. [2022-11-22 01:24:08,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1952 states, 1760 states have (on average 3.1295454545454544) internal successors, (5508), 1951 states have internal predecessors, (5508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:08,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 5508 transitions. [2022-11-22 01:24:08,471 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 5508 transitions. Word has length 5 [2022-11-22 01:24:08,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:24:08,471 INFO L495 AbstractCegarLoop]: Abstraction has 1952 states and 5508 transitions. [2022-11-22 01:24:08,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:08,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 5508 transitions. [2022-11-22 01:24:08,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-22 01:24:08,472 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:24:08,473 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-22 01:24:08,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 01:24:08,473 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-22 01:24:08,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:24:08,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1229669011, now seen corresponding path program 1 times [2022-11-22 01:24:08,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:24:08,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826518508] [2022-11-22 01:24:08,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:24:08,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:24:08,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:24:08,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:24:08,768 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:24:08,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826518508] [2022-11-22 01:24:08,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826518508] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:24:08,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:24:08,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:24:08,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237220192] [2022-11-22 01:24:08,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:24:08,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:24:08,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:24:08,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:24:08,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:24:08,778 INFO L87 Difference]: Start difference. First operand 1952 states and 5508 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:08,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:24:08,917 INFO L93 Difference]: Finished difference Result 1336 states and 3538 transitions. [2022-11-22 01:24:08,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:24:08,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-22 01:24:08,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:24:08,927 INFO L225 Difference]: With dead ends: 1336 [2022-11-22 01:24:08,927 INFO L226 Difference]: Without dead ends: 1336 [2022-11-22 01:24:08,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:24:08,929 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 121 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:24:08,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 4 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:24:08,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2022-11-22 01:24:08,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1336. [2022-11-22 01:24:08,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1336 states, 1240 states have (on average 2.8532258064516127) internal successors, (3538), 1335 states have internal predecessors, (3538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:09,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 3538 transitions. [2022-11-22 01:24:09,008 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 3538 transitions. Word has length 5 [2022-11-22 01:24:09,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:24:09,008 INFO L495 AbstractCegarLoop]: Abstraction has 1336 states and 3538 transitions. [2022-11-22 01:24:09,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:09,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 3538 transitions. [2022-11-22 01:24:09,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-22 01:24:09,010 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:24:09,010 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-22 01:24:09,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 01:24:09,011 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-22 01:24:09,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:24:09,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1229601986, now seen corresponding path program 1 times [2022-11-22 01:24:09,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:24:09,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425772057] [2022-11-22 01:24:09,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:24:09,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:24:09,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:24:09,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-11-22 01:24:09,207 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:24:09,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425772057] [2022-11-22 01:24:09,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425772057] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:24:09,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:24:09,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 01:24:09,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272631999] [2022-11-22 01:24:09,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:24:09,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:24:09,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:24:09,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:24:09,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:24:09,210 INFO L87 Difference]: Start difference. First operand 1336 states and 3538 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:09,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:24:09,331 INFO L93 Difference]: Finished difference Result 1190 states and 3162 transitions. [2022-11-22 01:24:09,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:24:09,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-22 01:24:09,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:24:09,340 INFO L225 Difference]: With dead ends: 1190 [2022-11-22 01:24:09,341 INFO L226 Difference]: Without dead ends: 1190 [2022-11-22 01:24:09,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:24:09,342 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:24:09,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 4 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:24:09,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2022-11-22 01:24:09,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1190. [2022-11-22 01:24:09,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 1120 states have (on average 2.8232142857142857) internal successors, (3162), 1189 states have internal predecessors, (3162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:09,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 3162 transitions. [2022-11-22 01:24:09,385 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 3162 transitions. Word has length 5 [2022-11-22 01:24:09,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:24:09,385 INFO L495 AbstractCegarLoop]: Abstraction has 1190 states and 3162 transitions. [2022-11-22 01:24:09,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:09,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 3162 transitions. [2022-11-22 01:24:09,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-22 01:24:09,386 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:24:09,386 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-22 01:24:09,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 01:24:09,387 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-22 01:24:09,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:24:09,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1229601987, now seen corresponding path program 1 times [2022-11-22 01:24:09,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:24:09,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566607873] [2022-11-22 01:24:09,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:24:09,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:24:09,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:24:09,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:24:09,598 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:24:09,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566607873] [2022-11-22 01:24:09,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566607873] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:24:09,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:24:09,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 01:24:09,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102350902] [2022-11-22 01:24:09,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:24:09,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:24:09,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:24:09,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:24:09,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:24:09,600 INFO L87 Difference]: Start difference. First operand 1190 states and 3162 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:09,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:24:09,712 INFO L93 Difference]: Finished difference Result 1010 states and 2698 transitions. [2022-11-22 01:24:09,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:24:09,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-22 01:24:09,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:24:09,719 INFO L225 Difference]: With dead ends: 1010 [2022-11-22 01:24:09,720 INFO L226 Difference]: Without dead ends: 1010 [2022-11-22 01:24:09,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:24:09,721 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:24:09,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:24:09,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2022-11-22 01:24:09,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 1010. [2022-11-22 01:24:09,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 968 states have (on average 2.7871900826446283) internal successors, (2698), 1009 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:09,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 2698 transitions. [2022-11-22 01:24:09,756 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 2698 transitions. Word has length 5 [2022-11-22 01:24:09,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:24:09,757 INFO L495 AbstractCegarLoop]: Abstraction has 1010 states and 2698 transitions. [2022-11-22 01:24:09,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:09,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 2698 transitions. [2022-11-22 01:24:09,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-22 01:24:09,758 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:24:09,758 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-22 01:24:09,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 01:24:09,758 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-22 01:24:09,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:24:09,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1229602043, now seen corresponding path program 1 times [2022-11-22 01:24:09,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:24:09,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628432132] [2022-11-22 01:24:09,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:24:09,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:24:09,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:24:10,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:24:10,291 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:24:10,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628432132] [2022-11-22 01:24:10,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628432132] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:24:10,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:24:10,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 01:24:10,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281161402] [2022-11-22 01:24:10,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:24:10,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:24:10,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:24:10,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:24:10,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:24:10,294 INFO L87 Difference]: Start difference. First operand 1010 states and 2698 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:10,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:24:10,445 INFO L93 Difference]: Finished difference Result 1016 states and 2711 transitions. [2022-11-22 01:24:10,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:24:10,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-22 01:24:10,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:24:10,458 INFO L225 Difference]: With dead ends: 1016 [2022-11-22 01:24:10,458 INFO L226 Difference]: Without dead ends: 1016 [2022-11-22 01:24:10,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:24:10,459 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:24:10,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 8 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:24:10,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2022-11-22 01:24:10,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1011. [2022-11-22 01:24:10,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 969 states have (on average 2.787409700722394) internal successors, (2701), 1010 states have internal predecessors, (2701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:10,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 2701 transitions. [2022-11-22 01:24:10,502 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 2701 transitions. Word has length 5 [2022-11-22 01:24:10,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:24:10,503 INFO L495 AbstractCegarLoop]: Abstraction has 1011 states and 2701 transitions. [2022-11-22 01:24:10,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:10,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 2701 transitions. [2022-11-22 01:24:10,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-22 01:24:10,505 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:24:10,505 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-22 01:24:10,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-22 01:24:10,507 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-22 01:24:10,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:24:10,508 INFO L85 PathProgramCache]: Analyzing trace with hash -534759366, now seen corresponding path program 1 times [2022-11-22 01:24:10,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:24:10,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645659735] [2022-11-22 01:24:10,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:24:10,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:24:10,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:24:11,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:24:11,160 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:24:11,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645659735] [2022-11-22 01:24:11,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645659735] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:24:11,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:24:11,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:24:11,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780812838] [2022-11-22 01:24:11,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:24:11,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:24:11,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:24:11,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:24:11,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:24:11,162 INFO L87 Difference]: Start difference. First operand 1011 states and 2701 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:11,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:24:11,367 INFO L93 Difference]: Finished difference Result 1286 states and 3454 transitions. [2022-11-22 01:24:11,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:24:11,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-11-22 01:24:11,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:24:11,375 INFO L225 Difference]: With dead ends: 1286 [2022-11-22 01:24:11,375 INFO L226 Difference]: Without dead ends: 1286 [2022-11-22 01:24:11,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:24:11,377 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 56 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:24:11,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 8 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:24:11,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2022-11-22 01:24:11,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1094. [2022-11-22 01:24:11,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1094 states, 1052 states have (on average 2.826045627376426) internal successors, (2973), 1093 states have internal predecessors, (2973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:11,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 2973 transitions. [2022-11-22 01:24:11,418 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 2973 transitions. Word has length 6 [2022-11-22 01:24:11,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:24:11,419 INFO L495 AbstractCegarLoop]: Abstraction has 1094 states and 2973 transitions. [2022-11-22 01:24:11,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:11,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 2973 transitions. [2022-11-22 01:24:11,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-22 01:24:11,420 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:24:11,420 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-22 01:24:11,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-22 01:24:11,421 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-22 01:24:11,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:24:11,421 INFO L85 PathProgramCache]: Analyzing trace with hash -537040297, now seen corresponding path program 1 times [2022-11-22 01:24:11,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:24:11,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117477719] [2022-11-22 01:24:11,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:24:11,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:24:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:24:11,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:24:11,674 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:24:11,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117477719] [2022-11-22 01:24:11,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117477719] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:24:11,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:24:11,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:24:11,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295192251] [2022-11-22 01:24:11,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:24:11,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:24:11,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:24:11,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:24:11,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:24:11,677 INFO L87 Difference]: Start difference. First operand 1094 states and 2973 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:11,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:24:11,916 INFO L93 Difference]: Finished difference Result 1280 states and 3468 transitions. [2022-11-22 01:24:11,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:24:11,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-11-22 01:24:11,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:24:11,924 INFO L225 Difference]: With dead ends: 1280 [2022-11-22 01:24:11,925 INFO L226 Difference]: Without dead ends: 1280 [2022-11-22 01:24:11,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:24:11,926 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 100 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:24:11,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 12 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:24:11,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2022-11-22 01:24:11,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 998. [2022-11-22 01:24:11,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 970 states have (on average 2.8072164948453606) internal successors, (2723), 997 states have internal predecessors, (2723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:11,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 2723 transitions. [2022-11-22 01:24:11,965 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 2723 transitions. Word has length 6 [2022-11-22 01:24:11,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:24:11,966 INFO L495 AbstractCegarLoop]: Abstraction has 998 states and 2723 transitions. [2022-11-22 01:24:11,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:11,966 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 2723 transitions. [2022-11-22 01:24:11,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-22 01:24:11,968 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:24:11,968 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:24:11,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-22 01:24:11,969 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-22 01:24:11,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:24:11,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1494000732, now seen corresponding path program 1 times [2022-11-22 01:24:11,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:24:11,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112424133] [2022-11-22 01:24:11,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:24:11,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:24:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:24:12,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:24:12,042 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:24:12,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112424133] [2022-11-22 01:24:12,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112424133] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:24:12,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:24:12,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:24:12,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002824838] [2022-11-22 01:24:12,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:24:12,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:24:12,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:24:12,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:24:12,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:24:12,045 INFO L87 Difference]: Start difference. First operand 998 states and 2723 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:12,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:24:12,165 INFO L93 Difference]: Finished difference Result 434 states and 998 transitions. [2022-11-22 01:24:12,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:24:12,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-11-22 01:24:12,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:24:12,168 INFO L225 Difference]: With dead ends: 434 [2022-11-22 01:24:12,168 INFO L226 Difference]: Without dead ends: 426 [2022-11-22 01:24:12,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:24:12,169 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 28 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:24:12,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 7 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:24:12,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2022-11-22 01:24:12,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 400. [2022-11-22 01:24:12,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 387 states have (on average 2.41343669250646) internal successors, (934), 399 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:12,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 934 transitions. [2022-11-22 01:24:12,183 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 934 transitions. Word has length 9 [2022-11-22 01:24:12,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:24:12,184 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 934 transitions. [2022-11-22 01:24:12,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:12,184 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 934 transitions. [2022-11-22 01:24:12,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-22 01:24:12,185 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:24:12,186 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:24:12,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-22 01:24:12,186 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-22 01:24:12,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:24:12,187 INFO L85 PathProgramCache]: Analyzing trace with hash 740251664, now seen corresponding path program 1 times [2022-11-22 01:24:12,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:24:12,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152671466] [2022-11-22 01:24:12,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:24:12,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:24:12,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:24:12,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:24:12,307 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:24:12,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152671466] [2022-11-22 01:24:12,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152671466] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:24:12,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:24:12,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 01:24:12,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481818933] [2022-11-22 01:24:12,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:24:12,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:24:12,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:24:12,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:24:12,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:24:12,309 INFO L87 Difference]: Start difference. First operand 400 states and 934 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:12,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:24:12,402 INFO L93 Difference]: Finished difference Result 380 states and 890 transitions. [2022-11-22 01:24:12,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:24:12,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-11-22 01:24:12,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:24:12,405 INFO L225 Difference]: With dead ends: 380 [2022-11-22 01:24:12,405 INFO L226 Difference]: Without dead ends: 380 [2022-11-22 01:24:12,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:24:12,406 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:24:12,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 4 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:24:12,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-11-22 01:24:12,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2022-11-22 01:24:12,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 370 states have (on average 2.4054054054054053) internal successors, (890), 379 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:12,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 890 transitions. [2022-11-22 01:24:12,420 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 890 transitions. Word has length 11 [2022-11-22 01:24:12,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:24:12,420 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 890 transitions. [2022-11-22 01:24:12,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:12,421 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 890 transitions. [2022-11-22 01:24:12,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-22 01:24:12,422 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:24:12,422 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:24:12,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-22 01:24:12,423 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-22 01:24:12,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:24:12,423 INFO L85 PathProgramCache]: Analyzing trace with hash 740251665, now seen corresponding path program 1 times [2022-11-22 01:24:12,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:24:12,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495198134] [2022-11-22 01:24:12,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:24:12,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:24:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:24:12,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:24:12,830 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:24:12,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495198134] [2022-11-22 01:24:12,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495198134] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:24:12,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:24:12,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:24:12,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129370392] [2022-11-22 01:24:12,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:24:12,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:24:12,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:24:12,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:24:12,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:24:12,833 INFO L87 Difference]: Start difference. First operand 380 states and 890 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:13,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:24:13,041 INFO L93 Difference]: Finished difference Result 390 states and 909 transitions. [2022-11-22 01:24:13,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 01:24:13,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-11-22 01:24:13,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:24:13,043 INFO L225 Difference]: With dead ends: 390 [2022-11-22 01:24:13,043 INFO L226 Difference]: Without dead ends: 390 [2022-11-22 01:24:13,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:24:13,044 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:24:13,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 16 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:24:13,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-11-22 01:24:13,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 384. [2022-11-22 01:24:13,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 374 states have (on average 2.4010695187165774) internal successors, (898), 383 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:13,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 898 transitions. [2022-11-22 01:24:13,057 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 898 transitions. Word has length 11 [2022-11-22 01:24:13,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:24:13,057 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 898 transitions. [2022-11-22 01:24:13,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:13,058 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 898 transitions. [2022-11-22 01:24:13,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 01:24:13,059 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:24:13,059 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:24:13,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-22 01:24:13,059 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-22 01:24:13,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:24:13,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1341499408, now seen corresponding path program 1 times [2022-11-22 01:24:13,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:24:13,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811854458] [2022-11-22 01:24:13,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:24:13,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:24:13,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:24:13,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:24:13,330 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:24:13,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811854458] [2022-11-22 01:24:13,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811854458] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:24:13,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:24:13,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:24:13,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501286867] [2022-11-22 01:24:13,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:24:13,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:24:13,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:24:13,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:24:13,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:24:13,333 INFO L87 Difference]: Start difference. First operand 384 states and 898 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:13,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:24:13,471 INFO L93 Difference]: Finished difference Result 475 states and 1103 transitions. [2022-11-22 01:24:13,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:24:13,472 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-22 01:24:13,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:24:13,474 INFO L225 Difference]: With dead ends: 475 [2022-11-22 01:24:13,474 INFO L226 Difference]: Without dead ends: 475 [2022-11-22 01:24:13,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:24:13,475 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 69 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:24:13,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 9 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:24:13,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-11-22 01:24:13,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 475. [2022-11-22 01:24:13,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 465 states have (on average 2.372043010752688) internal successors, (1103), 474 states have internal predecessors, (1103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:13,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 1103 transitions. [2022-11-22 01:24:13,513 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 1103 transitions. Word has length 12 [2022-11-22 01:24:13,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:24:13,514 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 1103 transitions. [2022-11-22 01:24:13,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:13,514 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 1103 transitions. [2022-11-22 01:24:13,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 01:24:13,515 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:24:13,515 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:24:13,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-22 01:24:13,515 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-22 01:24:13,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:24:13,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1363188893, now seen corresponding path program 1 times [2022-11-22 01:24:13,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:24:13,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544836344] [2022-11-22 01:24:13,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:24:13,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:24:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:24:14,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:24:14,460 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:24:14,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544836344] [2022-11-22 01:24:14,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544836344] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:24:14,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:24:14,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 01:24:14,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156350208] [2022-11-22 01:24:14,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:24:14,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 01:24:14,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:24:14,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 01:24:14,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:24:14,463 INFO L87 Difference]: Start difference. First operand 475 states and 1103 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:14,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:24:14,834 INFO L93 Difference]: Finished difference Result 624 states and 1427 transitions. [2022-11-22 01:24:14,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 01:24:14,835 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-22 01:24:14,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:24:14,837 INFO L225 Difference]: With dead ends: 624 [2022-11-22 01:24:14,837 INFO L226 Difference]: Without dead ends: 624 [2022-11-22 01:24:14,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-22 01:24:14,838 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 39 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:24:14,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 30 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 01:24:14,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2022-11-22 01:24:14,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 519. [2022-11-22 01:24:14,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 509 states have (on average 2.3634577603143416) internal successors, (1203), 518 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:14,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 1203 transitions. [2022-11-22 01:24:14,880 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 1203 transitions. Word has length 13 [2022-11-22 01:24:14,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:24:14,880 INFO L495 AbstractCegarLoop]: Abstraction has 519 states and 1203 transitions. [2022-11-22 01:24:14,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:14,881 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 1203 transitions. [2022-11-22 01:24:14,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 01:24:14,882 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:24:14,882 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:24:14,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-22 01:24:14,882 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-22 01:24:14,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:24:14,883 INFO L85 PathProgramCache]: Analyzing trace with hash 949156331, now seen corresponding path program 2 times [2022-11-22 01:24:14,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:24:14,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342134330] [2022-11-22 01:24:14,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:24:14,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:24:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:24:15,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:24:15,658 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:24:15,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342134330] [2022-11-22 01:24:15,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342134330] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:24:15,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:24:15,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 01:24:15,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518055704] [2022-11-22 01:24:15,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:24:15,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 01:24:15,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:24:15,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 01:24:15,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:24:15,660 INFO L87 Difference]: Start difference. First operand 519 states and 1203 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:15,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:24:15,966 INFO L93 Difference]: Finished difference Result 563 states and 1303 transitions. [2022-11-22 01:24:15,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 01:24:15,967 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-22 01:24:15,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:24:15,969 INFO L225 Difference]: With dead ends: 563 [2022-11-22 01:24:15,969 INFO L226 Difference]: Without dead ends: 563 [2022-11-22 01:24:15,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-22 01:24:15,970 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 28 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:24:15,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 22 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:24:15,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2022-11-22 01:24:15,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 497. [2022-11-22 01:24:15,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 487 states have (on average 2.3675564681724848) internal successors, (1153), 496 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:15,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 1153 transitions. [2022-11-22 01:24:15,985 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 1153 transitions. Word has length 13 [2022-11-22 01:24:15,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:24:15,985 INFO L495 AbstractCegarLoop]: Abstraction has 497 states and 1153 transitions. [2022-11-22 01:24:15,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:15,986 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 1153 transitions. [2022-11-22 01:24:15,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 01:24:15,987 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:24:15,987 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:24:15,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-22 01:24:15,987 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-22 01:24:15,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:24:15,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1723774363, now seen corresponding path program 3 times [2022-11-22 01:24:15,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:24:15,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497772510] [2022-11-22 01:24:15,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:24:15,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:24:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:24:16,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:24:16,695 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:24:16,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497772510] [2022-11-22 01:24:16,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497772510] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:24:16,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:24:16,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 01:24:16,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181375396] [2022-11-22 01:24:16,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:24:16,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 01:24:16,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:24:16,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 01:24:16,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:24:16,698 INFO L87 Difference]: Start difference. First operand 497 states and 1153 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:17,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:24:17,002 INFO L93 Difference]: Finished difference Result 552 states and 1267 transitions. [2022-11-22 01:24:17,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 01:24:17,002 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-22 01:24:17,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:24:17,004 INFO L225 Difference]: With dead ends: 552 [2022-11-22 01:24:17,004 INFO L226 Difference]: Without dead ends: 552 [2022-11-22 01:24:17,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-22 01:24:17,005 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 31 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:24:17,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 22 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:24:17,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2022-11-22 01:24:17,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 464. [2022-11-22 01:24:17,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 454 states have (on average 2.350220264317181) internal successors, (1067), 463 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:17,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1067 transitions. [2022-11-22 01:24:17,019 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1067 transitions. Word has length 13 [2022-11-22 01:24:17,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:24:17,019 INFO L495 AbstractCegarLoop]: Abstraction has 464 states and 1067 transitions. [2022-11-22 01:24:17,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:24:17,020 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1067 transitions. [2022-11-22 01:24:17,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 01:24:17,021 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:24:17,021 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:24:17,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-22 01:24:17,021 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-22 01:24:17,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:24:17,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1625342350, now seen corresponding path program 1 times [2022-11-22 01:24:17,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:24:17,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957248127] [2022-11-22 01:24:17,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:24:17,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:24:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:24:18,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:24:18,040 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:24:18,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957248127] [2022-11-22 01:24:18,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957248127] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:24:18,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101835584] [2022-11-22 01:24:18,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:24:18,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:24:18,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:24:18,050 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:24:18,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 01:24:18,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:24:18,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-22 01:24:18,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:24:18,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:24:18,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:24:18,424 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-22 01:24:18,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-22 01:24:18,444 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 01:24:18,444 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 11 treesize of output 11 [2022-11-22 01:24:18,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-22 01:24:18,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-22 01:24:19,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-22 01:24:19,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:24:19,258 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 74 treesize of output 76 [2022-11-22 01:24:19,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:24:19,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:24:19,450 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_574 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_574) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_574 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_574) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-22 01:24:19,705 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:24:19,706 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 91 treesize of output 95 [2022-11-22 01:24:30,348 WARN L233 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:24:32,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:24:32,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101835584] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:24:32,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [827096696] [2022-11-22 01:24:32,767 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 01:24:32,774 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:24:32,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 23 [2022-11-22 01:24:32,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679694338] [2022-11-22 01:24:32,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:24:32,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-22 01:24:32,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:24:32,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-22 01:24:32,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=415, Unknown=17, NotChecked=44, Total=600 [2022-11-22 01:24:32,777 INFO L87 Difference]: Start difference. First operand 464 states and 1067 transitions. Second operand has 25 states, 24 states have (on average 1.625) internal successors, (39), 24 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-11-22 01:24:48,828 WARN L233 SmtUtils]: Spent 7.96s on a formula simplification. DAG size of input: 92 DAG size of output: 90 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:24:51,324 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (let ((.cse9 (select .cse8 .cse5)) (.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse4 (+ (select .cse1 .cse3) 1)) (.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse0 (* .cse9 4))) (and (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= (+ 88 .cse0 |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|)) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int))) (< (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_prenex_1) .cse3 .cse4)) |c_~#stored_elements~0.base| v_prenex_2) |c_~#queue~0.base|) .cse5) 4)) (+ 89 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (forall ((v_ArrVal_570 Int) (v_ArrVal_574 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_570) .cse3 .cse4)) |c_~#stored_elements~0.base| v_ArrVal_574) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1469| Int)) (or (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_ArrVal_569 Int)) (< (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse6 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1469| 4)) v_ArrVal_569))) (store (store .cse6 .cse7 v_prenex_1) .cse5 (+ (select .cse6 .cse5) 1)))) |c_~#stored_elements~0.base| v_prenex_2) |c_~#queue~0.base|) .cse5) 4) 89)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1469| .cse9)))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1469| Int)) (or (forall ((v_ArrVal_570 Int) (v_ArrVal_569 Int) (v_ArrVal_574 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse10 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1469| 4)) v_ArrVal_569))) (store (store .cse10 .cse7 v_ArrVal_570) .cse5 (+ (select .cse10 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_574) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1469| .cse9)))) (<= 4 (+ .cse0 |c_~#queue~0.offset|)))))) is different from false [2022-11-22 01:24:59,084 WARN L233 SmtUtils]: Spent 5.36s on a formula simplification. DAG size of input: 92 DAG size of output: 77 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:25:01,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:25:04,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:25:51,479 WARN L233 SmtUtils]: Spent 42.92s on a formula simplification. DAG size of input: 108 DAG size of output: 91 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:25:53,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:25:55,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:25:57,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:25:59,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:26:01,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:26:04,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:26:06,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:26:06,142 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (+ (select .cse2 .cse4) 1))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse4 .cse5))) (.cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse6 (select |c_#length| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_574 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_574) |c_~#queue~0.base|) .cse1) 4)))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int))) (< (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse3 v_prenex_1) .cse4 .cse5)) |c_~#stored_elements~0.base| v_prenex_2) |c_~#queue~0.base|) .cse1) 4)) (+ 89 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (forall ((v_ArrVal_570 Int) (v_ArrVal_574 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_570) .cse4 .cse5)) |c_~#stored_elements~0.base| v_ArrVal_574) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_574 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_574) |c_~#queue~0.base|) .cse1) 4)) .cse6)) (forall ((v_ArrVal_570 Int) (v_ArrVal_574 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_570) .cse4 .cse5)) |c_~#stored_elements~0.base| v_ArrVal_574) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) .cse6)))))) is different from false [2022-11-22 01:26:08,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:26:09,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:26:11,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:26:13,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:26:16,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:26:18,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:26:20,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:26:21,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:26:23,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:26:23,738 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse7 (+ (select .cse4 .cse6) 1)) (.cse0 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (* (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 4)) (.cse1 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse6 .cse7))) (.cse5 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (select |c_#length| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_574 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_574) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_574 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_574) |c_~#queue~0.base|) .cse0) 4)))) (<= 0 (+ .cse2 |c_~#queue~0.offset|)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= (+ .cse2 |c_~#queue~0.offset| 4) .cse3) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int))) (< (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 .cse5 v_prenex_1) .cse6 .cse7)) |c_~#stored_elements~0.base| v_prenex_2) |c_~#queue~0.base|) .cse0) 4)) (+ 89 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (forall ((v_ArrVal_570 Int) (v_ArrVal_574 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 .cse5 v_ArrVal_570) .cse6 .cse7)) |c_~#stored_elements~0.base| v_ArrVal_574) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_574 (Array Int Int))) (<= (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_574) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset| 4) .cse3)) (forall ((v_ArrVal_574 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_574) |c_~#queue~0.base|) .cse0) 4)) .cse3)) (forall ((v_ArrVal_570 Int) (v_ArrVal_574 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 .cse5 v_ArrVal_570) .cse6 .cse7)) |c_~#stored_elements~0.base| v_ArrVal_574) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) .cse3)))))) is different from false [2022-11-22 01:26:25,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:26:28,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:26:30,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:26:30,462 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 (+ (select .cse4 .cse5) 1)))) (.cse3 (select |c_#length| |c_~#queue~0.base|)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_574 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_574) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_574 (Array Int Int))) (<= (+ (* (select (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_574) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) .cse3)) (forall ((v_ArrVal_574 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_574) |c_~#queue~0.base|) .cse1) 4)) .cse3)) (forall ((v_ArrVal_574 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_574) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|)))))) is different from false [2022-11-22 01:26:32,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:26:32,310 INFO L93 Difference]: Finished difference Result 754 states and 1758 transitions. [2022-11-22 01:26:32,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-22 01:26:32,311 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.625) internal successors, (39), 24 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 13 [2022-11-22 01:26:32,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:26:32,314 INFO L225 Difference]: With dead ends: 754 [2022-11-22 01:26:32,314 INFO L226 Difference]: Without dead ends: 754 [2022-11-22 01:26:32,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 85.5s TimeCoverageRelationStatistics Valid=241, Invalid=810, Unknown=25, NotChecked=330, Total=1406 [2022-11-22 01:26:32,316 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 172 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 55 mSolverCounterUnsat, 125 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 1765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 125 IncrementalHoareTripleChecker+Unknown, 389 IncrementalHoareTripleChecker+Unchecked, 47.6s IncrementalHoareTripleChecker+Time [2022-11-22 01:26:32,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 127 Invalid, 1765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1196 Invalid, 125 Unknown, 389 Unchecked, 47.6s Time] [2022-11-22 01:26:32,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2022-11-22 01:26:32,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 594. [2022-11-22 01:26:32,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 584 states have (on average 2.410958904109589) internal successors, (1408), 593 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:26:32,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 1408 transitions. [2022-11-22 01:26:32,339 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 1408 transitions. Word has length 13 [2022-11-22 01:26:32,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:26:32,354 INFO L495 AbstractCegarLoop]: Abstraction has 594 states and 1408 transitions. [2022-11-22 01:26:32,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.625) internal successors, (39), 24 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-11-22 01:26:32,354 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 1408 transitions. [2022-11-22 01:26:32,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 01:26:32,355 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:26:32,355 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:26:32,367 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-22 01:26:32,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-22 01:26:32,564 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-22 01:26:32,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:26:32,565 INFO L85 PathProgramCache]: Analyzing trace with hash 648121009, now seen corresponding path program 1 times [2022-11-22 01:26:32,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:26:32,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539028490] [2022-11-22 01:26:32,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:26:32,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:26:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:26:34,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:26:34,072 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:26:34,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539028490] [2022-11-22 01:26:34,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539028490] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:26:34,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242614326] [2022-11-22 01:26:34,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:26:34,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:26:34,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:26:34,074 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:26:34,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 01:26:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:26:34,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-22 01:26:34,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:26:34,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2022-11-22 01:26:34,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:26:34,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:26:34,312 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-22 01:26:34,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-11-22 01:26:34,352 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-22 01:26:34,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-22 01:26:34,443 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 16 treesize of output 18 [2022-11-22 01:26:34,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:26:34,655 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-22 01:26:34,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-22 01:26:34,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:26:34,896 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 36 treesize of output 29 [2022-11-22 01:26:35,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 22 [2022-11-22 01:26:35,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:26:35,167 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 29 treesize of output 29 [2022-11-22 01:26:35,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:26:35,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:26:35,305 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_667 (Array Int Int))) (<= (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_667) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_667 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_667) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset|))))) is different from false [2022-11-22 01:26:35,460 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_667 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_667) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_667 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_667) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-22 01:26:35,502 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_663 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_663) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_667) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_663 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_663) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_667) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))) is different from false [2022-11-22 01:26:35,527 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:26:35,527 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 91 treesize of output 95 [2022-11-22 01:26:43,722 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:26:48,222 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_prenex_4 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1473| Int) (v_ArrVal_661 Int) (v_ArrVal_660 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_660))) (let ((.cse1 (select .cse3 |c_~#queue~0.base|)) (.cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1473| 4) |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (not (<= 0 .cse0)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1473| (select .cse1 .cse2))) (< (* 4 (select (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse1 .cse0 v_ArrVal_661))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_prenex_4) .cse2 (+ (select .cse4 .cse2) 1)))) |c_~#stored_elements~0.base| v_prenex_3) |c_~#queue~0.base|) .cse2)) 89))))) is different from false [2022-11-22 01:26:48,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:26:48,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242614326] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:26:48,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [470289458] [2022-11-22 01:26:48,265 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 01:26:48,266 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:26:48,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 25 [2022-11-22 01:26:48,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390189249] [2022-11-22 01:26:48,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:26:48,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-22 01:26:48,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:26:48,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-22 01:26:48,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=420, Unknown=7, NotChecked=180, Total=702 [2022-11-22 01:26:48,269 INFO L87 Difference]: Start difference. First operand 594 states and 1408 transitions. Second operand has 27 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 26 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:26:54,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:26:57,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:27:04,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:27:09,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:27:11,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:27:18,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:27:18,329 INFO L93 Difference]: Finished difference Result 1523 states and 3565 transitions. [2022-11-22 01:27:18,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-22 01:27:18,330 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 26 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-22 01:27:18,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:27:18,336 INFO L225 Difference]: With dead ends: 1523 [2022-11-22 01:27:18,336 INFO L226 Difference]: Without dead ends: 1523 [2022-11-22 01:27:18,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 10 SyntacticMatches, 7 SemanticMatches, 39 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 30.3s TimeCoverageRelationStatistics Valid=273, Invalid=1061, Unknown=14, NotChecked=292, Total=1640 [2022-11-22 01:27:18,338 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 475 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 1273 mSolverCounterSat, 89 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 1918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1273 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 536 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:27:18,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 157 Invalid, 1918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1273 Invalid, 20 Unknown, 536 Unchecked, 13.0s Time] [2022-11-22 01:27:18,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2022-11-22 01:27:18,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 697. [2022-11-22 01:27:18,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 687 states have (on average 2.483260553129549) internal successors, (1706), 696 states have internal predecessors, (1706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:27:18,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1706 transitions. [2022-11-22 01:27:18,370 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1706 transitions. Word has length 14 [2022-11-22 01:27:18,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:27:18,371 INFO L495 AbstractCegarLoop]: Abstraction has 697 states and 1706 transitions. [2022-11-22 01:27:18,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 26 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:27:18,371 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1706 transitions. [2022-11-22 01:27:18,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 01:27:18,372 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:27:18,373 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:27:18,381 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-22 01:27:18,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:27:18,581 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-22 01:27:18,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:27:18,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1154017767, now seen corresponding path program 2 times [2022-11-22 01:27:18,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:27:18,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464543633] [2022-11-22 01:27:18,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:27:18,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:27:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:27:20,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:27:20,022 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:27:20,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464543633] [2022-11-22 01:27:20,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464543633] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:27:20,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094462308] [2022-11-22 01:27:20,022 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:27:20,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:27:20,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:27:20,027 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:27:20,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 01:27:20,266 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-22 01:27:20,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:27:20,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-22 01:27:20,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:27:20,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:27:20,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:27:20,331 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-22 01:27:20,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-22 01:27:20,375 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-22 01:27:20,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-22 01:27:20,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-22 01:27:20,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-22 01:27:21,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-22 01:27:21,303 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 74 treesize of output 76 [2022-11-22 01:27:21,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:27:21,421 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 74 treesize of output 76 [2022-11-22 01:27:21,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:27:21,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:27:21,532 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 39 treesize of output 35 [2022-11-22 01:27:21,611 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_764 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_764) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_764 (Array Int Int))) (< (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_764) |c_~#queue~0.base|) .cse0) 4) 85)))) is different from false [2022-11-22 01:27:21,627 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_764 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_763) |c_~#stored_elements~0.base| v_ArrVal_764) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_764 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (< (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_763) |c_~#stored_elements~0.base| v_ArrVal_764) |c_~#queue~0.base|) .cse0) 4) 85)))) is different from false [2022-11-22 01:27:21,649 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_764 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_763) |c_~#stored_elements~0.base| v_ArrVal_764) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_764 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (< (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_763) |c_~#stored_elements~0.base| v_ArrVal_764) |c_~#queue~0.base|) .cse1) 4) 85)))) is different from false [2022-11-22 01:27:30,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:27:30,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094462308] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:27:30,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1756957836] [2022-11-22 01:27:30,764 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 01:27:30,765 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:27:30,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-22 01:27:30,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51055480] [2022-11-22 01:27:30,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:27:30,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-22 01:27:30,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:27:30,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-22 01:27:30,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=403, Unknown=17, NotChecked=132, Total=650 [2022-11-22 01:27:30,767 INFO L87 Difference]: Start difference. First operand 697 states and 1706 transitions. Second operand has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:27:39,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:27:41,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:27:43,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:27:45,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:28:03,008 WARN L233 SmtUtils]: Spent 11.64s on a formula simplification. DAG size of input: 92 DAG size of output: 69 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:28:05,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:28:08,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:28:14,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:28:17,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:28:19,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:28:20,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:28:22,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:28:27,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:28:29,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:28:36,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:28:36,183 INFO L93 Difference]: Finished difference Result 1403 states and 3411 transitions. [2022-11-22 01:28:36,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-22 01:28:36,184 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-22 01:28:36,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:28:36,189 INFO L225 Difference]: With dead ends: 1403 [2022-11-22 01:28:36,189 INFO L226 Difference]: Without dead ends: 1403 [2022-11-22 01:28:36,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 42.6s TimeCoverageRelationStatistics Valid=289, Invalid=1095, Unknown=34, NotChecked=222, Total=1640 [2022-11-22 01:28:36,196 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 551 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 87 mSolverCounterUnsat, 94 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 94 IncrementalHoareTripleChecker+Unknown, 448 IncrementalHoareTripleChecker+Unchecked, 32.7s IncrementalHoareTripleChecker+Time [2022-11-22 01:28:36,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 111 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 861 Invalid, 94 Unknown, 448 Unchecked, 32.7s Time] [2022-11-22 01:28:36,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2022-11-22 01:28:36,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 767. [2022-11-22 01:28:36,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 757 states have (on average 2.499339498018494) internal successors, (1892), 766 states have internal predecessors, (1892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:28:36,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1892 transitions. [2022-11-22 01:28:36,229 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1892 transitions. Word has length 14 [2022-11-22 01:28:36,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:28:36,230 INFO L495 AbstractCegarLoop]: Abstraction has 767 states and 1892 transitions. [2022-11-22 01:28:36,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:28:36,230 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1892 transitions. [2022-11-22 01:28:36,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-22 01:28:36,231 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:28:36,231 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:28:36,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-22 01:28:36,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:28:36,437 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-22 01:28:36,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:28:36,438 INFO L85 PathProgramCache]: Analyzing trace with hash -551375410, now seen corresponding path program 1 times [2022-11-22 01:28:36,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:28:36,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583360459] [2022-11-22 01:28:36,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:28:36,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:28:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:28:36,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:28:36,538 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:28:36,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583360459] [2022-11-22 01:28:36,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583360459] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:28:36,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:28:36,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:28:36,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294239194] [2022-11-22 01:28:36,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:28:36,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:28:36,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:28:36,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:28:36,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:28:36,543 INFO L87 Difference]: Start difference. First operand 767 states and 1892 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:28:36,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:28:36,798 INFO L93 Difference]: Finished difference Result 779 states and 1900 transitions. [2022-11-22 01:28:36,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:28:36,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-22 01:28:36,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:28:36,801 INFO L225 Difference]: With dead ends: 779 [2022-11-22 01:28:36,801 INFO L226 Difference]: Without dead ends: 779 [2022-11-22 01:28:36,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:28:36,802 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 26 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:28:36,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 9 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:28:36,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2022-11-22 01:28:36,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 753. [2022-11-22 01:28:36,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 743 states have (on average 2.496635262449529) internal successors, (1855), 752 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:28:36,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1855 transitions. [2022-11-22 01:28:36,825 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1855 transitions. Word has length 15 [2022-11-22 01:28:36,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:28:36,827 INFO L495 AbstractCegarLoop]: Abstraction has 753 states and 1855 transitions. [2022-11-22 01:28:36,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:28:36,827 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1855 transitions. [2022-11-22 01:28:36,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 01:28:36,828 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:28:36,829 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:28:36,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-22 01:28:36,829 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-22 01:28:36,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:28:36,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1955257272, now seen corresponding path program 1 times [2022-11-22 01:28:36,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:28:36,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688071400] [2022-11-22 01:28:36,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:28:36,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:28:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:28:38,477 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:28:38,477 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:28:38,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688071400] [2022-11-22 01:28:38,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688071400] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:28:38,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801110735] [2022-11-22 01:28:38,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:28:38,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:28:38,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:28:38,480 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:28:38,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 01:28:38,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:28:38,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-22 01:28:38,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:28:38,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:28:38,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:28:38,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:28:38,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-22 01:28:39,254 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:28:39,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:28:39,621 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:28:39,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801110735] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:28:39,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1509779156] [2022-11-22 01:28:39,622 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 01:28:39,622 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:28:39,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 3, 3] total 15 [2022-11-22 01:28:39,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205223114] [2022-11-22 01:28:39,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:28:39,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-22 01:28:39,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:28:39,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-22 01:28:39,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-11-22 01:28:39,623 INFO L87 Difference]: Start difference. First operand 753 states and 1855 transitions. Second operand has 16 states, 16 states have (on average 3.5625) internal successors, (57), 15 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:28:42,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:28:42,328 INFO L93 Difference]: Finished difference Result 1985 states and 4706 transitions. [2022-11-22 01:28:42,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-22 01:28:42,329 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 15 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-22 01:28:42,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:28:42,340 INFO L225 Difference]: With dead ends: 1985 [2022-11-22 01:28:42,340 INFO L226 Difference]: Without dead ends: 1985 [2022-11-22 01:28:42,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=278, Invalid=778, Unknown=0, NotChecked=0, Total=1056 [2022-11-22 01:28:42,342 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 441 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-22 01:28:42,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 78 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-22 01:28:42,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2022-11-22 01:28:42,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1401. [2022-11-22 01:28:42,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1401 states, 1391 states have (on average 2.4586628324946083) internal successors, (3420), 1400 states have internal predecessors, (3420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:28:42,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 3420 transitions. [2022-11-22 01:28:42,385 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 3420 transitions. Word has length 19 [2022-11-22 01:28:42,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:28:42,385 INFO L495 AbstractCegarLoop]: Abstraction has 1401 states and 3420 transitions. [2022-11-22 01:28:42,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 15 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:28:42,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 3420 transitions. [2022-11-22 01:28:42,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-22 01:28:42,387 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:28:42,387 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:28:42,395 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-22 01:28:42,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-22 01:28:42,593 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-22 01:28:42,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:28:42,594 INFO L85 PathProgramCache]: Analyzing trace with hash 541648150, now seen corresponding path program 1 times [2022-11-22 01:28:42,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:28:42,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384641221] [2022-11-22 01:28:42,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:28:42,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:28:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:28:44,427 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:28:44,427 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:28:44,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384641221] [2022-11-22 01:28:44,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384641221] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:28:44,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965238941] [2022-11-22 01:28:44,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:28:44,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:28:44,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:28:44,429 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:28:44,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-22 01:28:44,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:28:44,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-22 01:28:44,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:28:44,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:28:44,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:28:44,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:28:44,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-22 01:28:45,518 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 13 treesize of output 9 [2022-11-22 01:28:45,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:28:45,638 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 16 treesize of output 18 [2022-11-22 01:28:45,729 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:28:45,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:28:45,815 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_984 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_984) |c_~#queue~0.base|) .cse0))))) (forall ((v_ArrVal_984 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_984) |c_~#queue~0.base|) .cse0)) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-22 01:28:45,828 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:28:45,829 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 26 treesize of output 27 [2022-11-22 01:28:45,847 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:28:45,847 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 44 treesize of output 43 [2022-11-22 01:28:45,882 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 11 treesize of output 7 [2022-11-22 01:28:45,895 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:28:45,895 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 29 treesize of output 30 [2022-11-22 01:28:45,898 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:28:45,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:28:45,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-22 01:28:46,702 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-11-22 01:28:46,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965238941] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:28:46,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1428737867] [2022-11-22 01:28:46,702 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 01:28:46,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:28:46,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 6] total 24 [2022-11-22 01:28:46,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266918848] [2022-11-22 01:28:46,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:28:46,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-22 01:28:46,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:28:46,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-22 01:28:46,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=450, Unknown=1, NotChecked=44, Total=600 [2022-11-22 01:28:46,704 INFO L87 Difference]: Start difference. First operand 1401 states and 3420 transitions. Second operand has 25 states, 25 states have (on average 2.52) internal successors, (63), 24 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:28:49,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:28:49,846 INFO L93 Difference]: Finished difference Result 1482 states and 3472 transitions. [2022-11-22 01:28:49,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-22 01:28:49,847 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.52) internal successors, (63), 24 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-22 01:28:49,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:28:49,851 INFO L225 Difference]: With dead ends: 1482 [2022-11-22 01:28:49,851 INFO L226 Difference]: Without dead ends: 1482 [2022-11-22 01:28:49,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=313, Invalid=880, Unknown=1, NotChecked=66, Total=1260 [2022-11-22 01:28:49,852 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 490 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-22 01:28:49,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 90 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 797 Invalid, 0 Unknown, 90 Unchecked, 1.9s Time] [2022-11-22 01:28:49,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2022-11-22 01:28:49,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1118. [2022-11-22 01:28:49,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1118 states, 1108 states have (on average 2.4196750902527078) internal successors, (2681), 1117 states have internal predecessors, (2681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:28:49,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 2681 transitions. [2022-11-22 01:28:49,884 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 2681 transitions. Word has length 21 [2022-11-22 01:28:49,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:28:49,885 INFO L495 AbstractCegarLoop]: Abstraction has 1118 states and 2681 transitions. [2022-11-22 01:28:49,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.52) internal successors, (63), 24 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:28:49,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 2681 transitions. [2022-11-22 01:28:49,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 01:28:49,886 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:28:49,886 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-22 01:28:49,898 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-22 01:28:50,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-22 01:28:50,098 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-22 01:28:50,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:28:50,099 INFO L85 PathProgramCache]: Analyzing trace with hash -431472802, now seen corresponding path program 3 times [2022-11-22 01:28:50,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:28:50,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903563149] [2022-11-22 01:28:50,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:28:50,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:28:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:28:52,564 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:28:52,564 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:28:52,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903563149] [2022-11-22 01:28:52,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903563149] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:28:52,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828758799] [2022-11-22 01:28:52,565 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 01:28:52,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:28:52,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:28:52,566 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:28:52,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-22 01:28:52,760 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 01:28:52,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:28:52,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 101 conjunts are in the unsatisfiable core [2022-11-22 01:28:52,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:28:52,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:28:52,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:28:52,856 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-22 01:28:52,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-22 01:28:52,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:28:52,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:28:52,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:28:52,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-22 01:28:52,920 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-22 01:28:52,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-22 01:28:53,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2022-11-22 01:28:53,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 57 [2022-11-22 01:28:53,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2022-11-22 01:28:54,037 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 41 treesize of output 43 [2022-11-22 01:28:54,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:28:54,169 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 41 treesize of output 43 [2022-11-22 01:28:54,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 74 [2022-11-22 01:28:54,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 83 [2022-11-22 01:28:54,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2022-11-22 01:28:55,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:28:55,068 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 51 treesize of output 53 [2022-11-22 01:28:55,184 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:28:55,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:28:55,270 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1106 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1106) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_1106 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1106) |c_~#queue~0.base|) .cse0) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-22 01:28:55,290 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1106 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1106) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1106 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1106) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-22 01:28:55,513 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1103 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1103) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1106) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1103 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1103) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1106) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))) is different from false [2022-11-22 01:29:19,959 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-22 01:29:19,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828758799] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:29:19,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [292372640] [2022-11-22 01:29:19,960 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 01:29:19,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:29:19,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 15] total 39 [2022-11-22 01:29:19,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149093596] [2022-11-22 01:29:19,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:29:19,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-22 01:29:19,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:29:19,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-22 01:29:19,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1149, Unknown=44, NotChecked=222, Total=1640 [2022-11-22 01:29:19,962 INFO L87 Difference]: Start difference. First operand 1118 states and 2681 transitions. Second operand has 41 states, 40 states have (on average 1.65) internal successors, (66), 40 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:37,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:29:58,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:30:02,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:30:06,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:30:14,768 WARN L233 SmtUtils]: Spent 7.51s on a formula simplification. DAG size of input: 170 DAG size of output: 93 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:30:31,259 WARN L233 SmtUtils]: Spent 6.73s on a formula simplification. DAG size of input: 157 DAG size of output: 93 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:31:42,527 WARN L233 SmtUtils]: Spent 57.41s on a formula simplification. DAG size of input: 211 DAG size of output: 199 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:31:46,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:31:48,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:31:50,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:32:54,678 WARN L233 SmtUtils]: Spent 56.27s on a formula simplification. DAG size of input: 201 DAG size of output: 187 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:32:57,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:32:59,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:33:01,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:33:03,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:33:05,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:33:07,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:33:09,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:33:11,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:33:13,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:33:15,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:33:22,106 WARN L233 SmtUtils]: Spent 5.84s on a formula simplification. DAG size of input: 76 DAG size of output: 72 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:33:31,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:33:33,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:33:35,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:33:37,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:33:39,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:33:41,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:33:43,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:33:45,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:33:47,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:33:49,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:33:51,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:33:54,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:33:56,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:33:58,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:34:00,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:34:02,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:34:04,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:34:13,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:34:15,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:34:17,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:34:19,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:34:21,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:34:23,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:34:25,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:34:27,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:34:39,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:34:41,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:34:47,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:34:47,918 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 (+ (select .cse4 .cse5) 1)))) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select |c_#length| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_1106 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1106) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) .cse2)) (forall ((v_ArrVal_1106 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1106) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1106 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1106) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1106 (Array Int Int))) (<= (+ (* (select (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1106) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) .cse2))))) is different from false [2022-11-22 01:34:50,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:34:52,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:34:55,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:34:55,073 INFO L93 Difference]: Finished difference Result 1907 states and 4528 transitions. [2022-11-22 01:34:55,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-22 01:34:55,074 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.65) internal successors, (66), 40 states have internal predecessors, (66), 0 states have call successors, (0), 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-11-22 01:34:55,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:34:55,080 INFO L225 Difference]: With dead ends: 1907 [2022-11-22 01:34:55,080 INFO L226 Difference]: Without dead ends: 1907 [2022-11-22 01:34:55,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 16 SyntacticMatches, 8 SemanticMatches, 68 ConstructedPredicates, 4 IntricatePredicates, 4 DeprecatedPredicates, 1249 ImplicationChecksByTransitivity, 241.4s TimeCoverageRelationStatistics Valid=691, Invalid=3544, Unknown=71, NotChecked=524, Total=4830 [2022-11-22 01:34:55,082 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 813 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 2431 mSolverCounterSat, 116 mSolverCounterUnsat, 139 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 118.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 3656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2431 IncrementalHoareTripleChecker+Invalid, 139 IncrementalHoareTripleChecker+Unknown, 970 IncrementalHoareTripleChecker+Unchecked, 119.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:34:55,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 334 Invalid, 3656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 2431 Invalid, 139 Unknown, 970 Unchecked, 119.3s Time] [2022-11-22 01:34:55,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1907 states. [2022-11-22 01:34:55,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1907 to 1165. [2022-11-22 01:34:55,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1165 states, 1155 states have (on average 2.433766233766234) internal successors, (2811), 1164 states have internal predecessors, (2811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:34:55,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 2811 transitions. [2022-11-22 01:34:55,119 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 2811 transitions. Word has length 22 [2022-11-22 01:34:55,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:34:55,119 INFO L495 AbstractCegarLoop]: Abstraction has 1165 states and 2811 transitions. [2022-11-22 01:34:55,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.65) internal successors, (66), 40 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:34:55,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 2811 transitions. [2022-11-22 01:34:55,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 01:34:55,121 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:34:55,121 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-22 01:34:55,134 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-22 01:34:55,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:34:55,326 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-22 01:34:55,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:34:55,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1769761558, now seen corresponding path program 4 times [2022-11-22 01:34:55,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:34:55,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85000900] [2022-11-22 01:34:55,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:34:55,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:34:55,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:34:58,335 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:34:58,335 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:34:58,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85000900] [2022-11-22 01:34:58,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85000900] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:34:58,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137242210] [2022-11-22 01:34:58,336 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-22 01:34:58,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:34:58,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:34:58,337 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:34:58,340 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f187267f-2b34-4425-a34a-41c65eb65e7e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-22 01:34:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:34:58,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 103 conjunts are in the unsatisfiable core [2022-11-22 01:34:58,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:34:58,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:34:58,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:34:58,638 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-22 01:34:58,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-22 01:34:58,748 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-22 01:34:58,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-11-22 01:34:59,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2022-11-22 01:34:59,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 57 [2022-11-22 01:35:00,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2022-11-22 01:35:00,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:35:00,531 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 41 treesize of output 43 [2022-11-22 01:35:00,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2022-11-22 01:35:00,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 60 [2022-11-22 01:35:01,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 83 [2022-11-22 01:35:01,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2022-11-22 01:35:01,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:35:01,966 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 51 treesize of output 53 [2022-11-22 01:35:02,125 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:35:02,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:35:11,395 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:35:11,395 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 521 treesize of output 525 [2022-11-22 01:35:11,538 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse18 (select .cse6 .cse8))) (or (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse7 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse9 (+ .cse18 1)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1222 Int) (v_ArrVal_1224 Int) (v_ArrVal_1215 Int) (v_ArrVal_1220 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 .cse7 v_ArrVal_1215) .cse8 .cse9)) |c_~#stored_elements~0.base| v_ArrVal_1219) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1220))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (let ((.cse5 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|))) (or (<= 0 (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 .cse5 v_ArrVal_1222))) (store (store .cse1 .cse2 v_ArrVal_1224) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1227) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|)) (not (<= 0 .cse5))))))) (forall ((v_prenex_15 Int) (v_prenex_14 Int) (v_prenex_13 Int) (v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_prenex_16 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 .cse7 v_prenex_15) .cse8 .cse9)) |c_~#stored_elements~0.base| v_prenex_11) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_16))) (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (let ((.cse13 (+ (* 4 (select .cse12 .cse3)) |c_~#queue~0.offset|))) (or (< (+ (* (select (select (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse12 .cse13 v_prenex_13))) (store (store .cse11 .cse2 v_prenex_14) .cse3 (+ (select .cse11 .cse3) 1)))) |c_~#stored_elements~0.base| v_prenex_12) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|) (+ 89 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (not (<= 0 .cse13))))))) (or (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (and (forall ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1222 Int) (v_ArrVal_1224 Int) (v_ArrVal_1220 (Array Int Int)) (v_ArrVal_1215 Int)) (let ((.cse14 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 .cse7 v_ArrVal_1215) .cse8 .cse9)) |c_~#stored_elements~0.base| v_ArrVal_1219) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1220))) (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (let ((.cse17 (+ (* (select .cse16 .cse3) 4) |c_~#queue~0.offset|))) (or (<= 0 (+ (* (select (select (store (store .cse14 |c_~#queue~0.base| (let ((.cse15 (store .cse16 .cse17 v_ArrVal_1222))) (store (store .cse15 .cse2 v_ArrVal_1224) .cse3 (+ (select .cse15 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1227) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|)) (not (<= 0 .cse17))))))) (forall ((v_prenex_15 Int) (v_prenex_11 (Array Int Int)) (v_prenex_16 (Array Int Int))) (not (<= 0 (+ (* 4 (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 .cse7 v_prenex_15) .cse8 .cse9)) |c_~#stored_elements~0.base| v_prenex_11) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_16) |c_~#queue~0.base|) .cse3)) |c_~#queue~0.offset|)))))))) (= .cse18 20) (not (= (select |c_#valid| |c_~#queue~0.base|) 1))))) is different from false [2022-11-22 01:35:18,314 WARN L233 SmtUtils]: Spent 5.51s on a formula simplification. DAG size of input: 109 DAG size of output: 105 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:35:19,410 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-22 01:35:19,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137242210] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:35:19,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [596131620] [2022-11-22 01:35:19,411 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 01:35:19,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:35:19,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 16] total 42 [2022-11-22 01:35:19,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093269547] [2022-11-22 01:35:19,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:35:19,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-22 01:35:19,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:35:19,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-22 01:35:19,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1539, Unknown=55, NotChecked=82, Total=1892 [2022-11-22 01:35:19,417 INFO L87 Difference]: Start difference. First operand 1165 states and 2811 transitions. Second operand has 44 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:35:25,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:35:27,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:35:30,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:35:31,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:35:34,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:35:36,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:35:39,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:35:48,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:36:08,870 WARN L233 SmtUtils]: Spent 8.21s on a formula simplification. DAG size of input: 251 DAG size of output: 96 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:36:14,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:36:16,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:36:18,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:36:20,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:36:42,174 WARN L233 SmtUtils]: Spent 19.72s on a formula simplification. DAG size of input: 290 DAG size of output: 100 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:36:44,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:37:06,774 WARN L233 SmtUtils]: Spent 22.02s on a formula simplification. DAG size of input: 257 DAG size of output: 100 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:37:08,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:37:23,843 WARN L233 SmtUtils]: Spent 7.97s on a formula simplification. DAG size of input: 139 DAG size of output: 131 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:37:27,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:37:34,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:37:37,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:37:48,157 WARN L233 SmtUtils]: Spent 9.81s on a formula simplification. DAG size of input: 73 DAG size of output: 69 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)