./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9 --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 8fcb457b1bed8494a9a3b58e82500f367f4337ac38b5a41a5dad0da896f97e40 --- 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-6b4ec56 [2022-11-20 20:43:03,623 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 20:43:03,625 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 20:43:03,647 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 20:43:03,647 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 20:43:03,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 20:43:03,649 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 20:43:03,651 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 20:43:03,653 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 20:43:03,654 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 20:43:03,655 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 20:43:03,656 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 20:43:03,657 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 20:43:03,658 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 20:43:03,659 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 20:43:03,660 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 20:43:03,661 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 20:43:03,662 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 20:43:03,664 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 20:43:03,666 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 20:43:03,667 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 20:43:03,676 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 20:43:03,682 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 20:43:03,683 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 20:43:03,686 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 20:43:03,695 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 20:43:03,695 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 20:43:03,696 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 20:43:03,697 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 20:43:03,698 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 20:43:03,698 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 20:43:03,699 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 20:43:03,700 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 20:43:03,701 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 20:43:03,702 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 20:43:03,707 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 20:43:03,708 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 20:43:03,708 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 20:43:03,708 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 20:43:03,709 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 20:43:03,710 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 20:43:03,713 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-20 20:43:03,747 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 20:43:03,752 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 20:43:03,753 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 20:43:03,753 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 20:43:03,754 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 20:43:03,754 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 20:43:03,754 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-20 20:43:03,771 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-20 20:43:03,772 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-20 20:43:03,772 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-20 20:43:03,773 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-20 20:43:03,773 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-20 20:43:03,773 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-20 20:43:03,773 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-20 20:43:03,773 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-20 20:43:03,774 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-20 20:43:03,774 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-20 20:43:03,774 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-20 20:43:03,775 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 20:43:03,775 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 20:43:03,775 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 20:43:03,775 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 20:43:03,776 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 20:43:03,776 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 20:43:03,776 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 20:43:03,776 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 20:43:03,776 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 20:43:03,777 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 20:43:03,777 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 20:43:03,777 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 20:43:03,777 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 20:43:03,777 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 20:43:03,777 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 20:43:03,778 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 20:43:03,778 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 20:43:03,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:43:03,778 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 20:43:03,779 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-20 20:43:03,779 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 20:43:03,779 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-20 20:43:03,779 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 20:43:03,779 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-20 20:43:03,779 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_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/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_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9 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 -> 8fcb457b1bed8494a9a3b58e82500f367f4337ac38b5a41a5dad0da896f97e40 [2022-11-20 20:43:04,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 20:43:04,050 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 20:43:04,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 20:43:04,054 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 20:43:04,054 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 20:43:04,056 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/../../sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i [2022-11-20 20:43:07,022 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 20:43:07,317 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 20:43:07,318 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i [2022-11-20 20:43:07,337 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/data/28f7dac41/0dabee94aab748fd923e10f4d5a55821/FLAGd405d7396 [2022-11-20 20:43:07,360 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/data/28f7dac41/0dabee94aab748fd923e10f4d5a55821 [2022-11-20 20:43:07,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 20:43:07,365 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 20:43:07,366 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 20:43:07,366 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 20:43:07,375 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 20:43:07,376 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:43:07" (1/1) ... [2022-11-20 20:43:07,377 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b608925 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:43:07, skipping insertion in model container [2022-11-20 20:43:07,377 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:43:07" (1/1) ... [2022-11-20 20:43:07,386 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 20:43:07,426 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 20:43:07,808 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_4081eb75-eda3-413d-821d-a52e2c709b9b/sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i[30451,30464] [2022-11-20 20:43:07,815 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_4081eb75-eda3-413d-821d-a52e2c709b9b/sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i[30681,30694] [2022-11-20 20:43:07,820 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_4081eb75-eda3-413d-821d-a52e2c709b9b/sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i[30979,30992] [2022-11-20 20:43:07,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:43:07,840 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 20:43:07,916 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_4081eb75-eda3-413d-821d-a52e2c709b9b/sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i[30451,30464] [2022-11-20 20:43:07,919 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_4081eb75-eda3-413d-821d-a52e2c709b9b/sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i[30681,30694] [2022-11-20 20:43:07,921 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_4081eb75-eda3-413d-821d-a52e2c709b9b/sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i[30979,30992] [2022-11-20 20:43:07,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:43:07,987 INFO L208 MainTranslator]: Completed translation [2022-11-20 20:43:07,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:43:07 WrapperNode [2022-11-20 20:43:07,988 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 20:43:07,990 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 20:43:07,990 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 20:43:07,990 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 20:43:07,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:43:07" (1/1) ... [2022-11-20 20:43:08,037 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:43:07" (1/1) ... [2022-11-20 20:43:08,087 INFO L138 Inliner]: procedures = 168, calls = 36, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-11-20 20:43:08,088 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 20:43:08,088 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 20:43:08,088 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 20:43:08,089 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 20:43:08,100 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:43:07" (1/1) ... [2022-11-20 20:43:08,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:43:07" (1/1) ... [2022-11-20 20:43:08,114 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:43:07" (1/1) ... [2022-11-20 20:43:08,114 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:43:07" (1/1) ... [2022-11-20 20:43:08,121 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:43:07" (1/1) ... [2022-11-20 20:43:08,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:43:07" (1/1) ... [2022-11-20 20:43:08,143 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:43:07" (1/1) ... [2022-11-20 20:43:08,144 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:43:07" (1/1) ... [2022-11-20 20:43:08,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 20:43:08,148 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 20:43:08,148 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 20:43:08,148 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 20:43:08,149 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:43:07" (1/1) ... [2022-11-20 20:43:08,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:43:08,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:43:08,200 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 20:43:08,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 20:43:08,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 20:43:08,259 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-20 20:43:08,259 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-20 20:43:08,259 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-20 20:43:08,259 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-20 20:43:08,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 20:43:08,260 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-20 20:43:08,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 20:43:08,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 20:43:08,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 20:43:08,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-20 20:43:08,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 20:43:08,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 20:43:08,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 20:43:08,263 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 20:43:08,443 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 20:43:08,445 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 20:43:08,909 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 20:43:08,923 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 20:43:08,933 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-20 20:43:08,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:43:08 BoogieIcfgContainer [2022-11-20 20:43:08,936 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 20:43:08,939 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 20:43:08,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 20:43:08,945 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 20:43:08,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:43:07" (1/3) ... [2022-11-20 20:43:08,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e17e29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:43:08, skipping insertion in model container [2022-11-20 20:43:08,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:43:07" (2/3) ... [2022-11-20 20:43:08,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e17e29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:43:08, skipping insertion in model container [2022-11-20 20:43:08,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:43:08" (3/3) ... [2022-11-20 20:43:08,952 INFO L112 eAbstractionObserver]: Analyzing ICFG circular_buffer_ok.i [2022-11-20 20:43:08,974 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 20:43:08,975 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-11-20 20:43:08,975 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 20:43:09,156 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-20 20:43:09,214 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 20:43:09,238 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 174 transitions, 364 flow [2022-11-20 20:43:09,244 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 170 places, 174 transitions, 364 flow [2022-11-20 20:43:09,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 174 transitions, 364 flow [2022-11-20 20:43:09,399 INFO L130 PetriNetUnfolder]: 11/172 cut-off events. [2022-11-20 20:43:09,399 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-20 20:43:09,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 172 events. 11/172 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 359 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 108. Up to 2 conditions per place. [2022-11-20 20:43:09,418 INFO L119 LiptonReduction]: Number of co-enabled transitions 6010 [2022-11-20 20:43:33,654 INFO L134 LiptonReduction]: Checked pairs total: 13336 [2022-11-20 20:43:33,654 INFO L136 LiptonReduction]: Total number of compositions: 183 [2022-11-20 20:43:33,662 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 50 places, 51 transitions, 118 flow [2022-11-20 20:43:33,733 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 730 states, 650 states have (on average 3.4553846153846153) internal successors, (2246), 729 states have internal predecessors, (2246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:43:33,751 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 20:43:33,758 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;@63b6a819, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 20:43:33,758 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-11-20 20:43:33,763 INFO L276 IsEmpty]: Start isEmpty. Operand has 730 states, 650 states have (on average 3.4553846153846153) internal successors, (2246), 729 states have internal predecessors, (2246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:43:33,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-20 20:43:33,769 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:43:33,769 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-20 20:43:33,770 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-20 20:43:33,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:43:33,775 INFO L85 PathProgramCache]: Analyzing trace with hash 703, now seen corresponding path program 1 times [2022-11-20 20:43:33,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:43:33,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139765406] [2022-11-20 20:43:33,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:43:33,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:43:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:43:33,895 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-20 20:43:33,896 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:43:33,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139765406] [2022-11-20 20:43:33,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139765406] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:43:33,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:43:33,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-20 20:43:33,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126078032] [2022-11-20 20:43:33,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:43:33,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 20:43:33,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:43:33,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 20:43:33,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 20:43:33,930 INFO L87 Difference]: Start difference. First operand has 730 states, 650 states have (on average 3.4553846153846153) internal successors, (2246), 729 states have internal predecessors, (2246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-20 20:43:34,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:43:34,068 INFO L93 Difference]: Finished difference Result 676 states and 1988 transitions. [2022-11-20 20:43:34,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 20:43:34,071 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-20 20:43:34,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:43:34,099 INFO L225 Difference]: With dead ends: 676 [2022-11-20 20:43:34,100 INFO L226 Difference]: Without dead ends: 676 [2022-11-20 20:43:34,100 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-20 20:43:34,107 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:43:34,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:43:34,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-11-20 20:43:34,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 676. [2022-11-20 20:43:34,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 612 states have (on average 3.2483660130718954) internal successors, (1988), 675 states have internal predecessors, (1988), 0 states have call successors, (0), 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-20 20:43:34,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 1988 transitions. [2022-11-20 20:43:34,219 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 1988 transitions. Word has length 1 [2022-11-20 20:43:34,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:43:34,220 INFO L495 AbstractCegarLoop]: Abstraction has 676 states and 1988 transitions. [2022-11-20 20:43:34,220 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-20 20:43:34,220 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 1988 transitions. [2022-11-20 20:43:34,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 20:43:34,221 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:43:34,221 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 20:43:34,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 20:43:34,222 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-20 20:43:34,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:43:34,223 INFO L85 PathProgramCache]: Analyzing trace with hash 692281, now seen corresponding path program 1 times [2022-11-20 20:43:34,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:43:34,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139120192] [2022-11-20 20:43:34,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:43:34,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:43:34,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:43:34,411 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-20 20:43:34,412 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:43:34,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139120192] [2022-11-20 20:43:34,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139120192] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:43:34,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:43:34,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 20:43:34,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133657407] [2022-11-20 20:43:34,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:43:34,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:43:34,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:43:34,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:43:34,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:43:34,424 INFO L87 Difference]: Start difference. First operand 676 states and 1988 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-20 20:43:34,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:43:34,507 INFO L93 Difference]: Finished difference Result 652 states and 1936 transitions. [2022-11-20 20:43:34,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:43:34,507 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-20 20:43:34,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:43:34,512 INFO L225 Difference]: With dead ends: 652 [2022-11-20 20:43:34,512 INFO L226 Difference]: Without dead ends: 652 [2022-11-20 20:43:34,513 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-20 20:43:34,514 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 38 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:43:34,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 4 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:43:34,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2022-11-20 20:43:34,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 652. [2022-11-20 20:43:34,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 596 states have (on average 3.248322147651007) internal successors, (1936), 651 states have internal predecessors, (1936), 0 states have call successors, (0), 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-20 20:43:34,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 1936 transitions. [2022-11-20 20:43:34,539 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 1936 transitions. Word has length 3 [2022-11-20 20:43:34,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:43:34,539 INFO L495 AbstractCegarLoop]: Abstraction has 652 states and 1936 transitions. [2022-11-20 20:43:34,539 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-20 20:43:34,540 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 1936 transitions. [2022-11-20 20:43:34,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 20:43:34,540 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:43:34,540 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 20:43:34,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 20:43:34,541 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-20 20:43:34,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:43:34,541 INFO L85 PathProgramCache]: Analyzing trace with hash 692282, now seen corresponding path program 1 times [2022-11-20 20:43:34,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:43:34,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196381503] [2022-11-20 20:43:34,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:43:34,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:43:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:43:34,783 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-20 20:43:34,784 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:43:34,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196381503] [2022-11-20 20:43:34,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196381503] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:43:34,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:43:34,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 20:43:34,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351051316] [2022-11-20 20:43:34,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:43:34,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:43:34,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:43:34,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:43:34,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:43:34,786 INFO L87 Difference]: Start difference. First operand 652 states and 1936 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-20 20:43:34,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:43:34,868 INFO L93 Difference]: Finished difference Result 628 states and 1884 transitions. [2022-11-20 20:43:34,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:43:34,869 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-20 20:43:34,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:43:34,873 INFO L225 Difference]: With dead ends: 628 [2022-11-20 20:43:34,874 INFO L226 Difference]: Without dead ends: 628 [2022-11-20 20:43:34,875 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-20 20:43:34,879 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 36 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:43:34,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 4 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:43:34,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2022-11-20 20:43:34,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 628. [2022-11-20 20:43:34,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 580 states have (on average 3.2482758620689656) internal successors, (1884), 627 states have internal predecessors, (1884), 0 states have call successors, (0), 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-20 20:43:34,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 1884 transitions. [2022-11-20 20:43:34,903 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 1884 transitions. Word has length 3 [2022-11-20 20:43:34,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:43:34,903 INFO L495 AbstractCegarLoop]: Abstraction has 628 states and 1884 transitions. [2022-11-20 20:43:34,903 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-20 20:43:34,904 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 1884 transitions. [2022-11-20 20:43:34,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 20:43:34,904 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:43:34,904 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-20 20:43:34,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 20:43:34,905 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-20 20:43:34,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:43:34,906 INFO L85 PathProgramCache]: Analyzing trace with hash 665261865, now seen corresponding path program 1 times [2022-11-20 20:43:34,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:43:34,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788826397] [2022-11-20 20:43:34,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:43:34,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:43:34,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:43:35,187 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-20 20:43:35,187 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:43:35,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788826397] [2022-11-20 20:43:35,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788826397] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:43:35,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:43:35,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 20:43:35,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574741048] [2022-11-20 20:43:35,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:43:35,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:43:35,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:43:35,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:43:35,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:43:35,190 INFO L87 Difference]: Start difference. First operand 628 states and 1884 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-20 20:43:35,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:43:35,258 INFO L93 Difference]: Finished difference Result 532 states and 1607 transitions. [2022-11-20 20:43:35,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:43:35,259 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-20 20:43:35,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:43:35,263 INFO L225 Difference]: With dead ends: 532 [2022-11-20 20:43:35,263 INFO L226 Difference]: Without dead ends: 532 [2022-11-20 20:43:35,263 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-20 20:43:35,264 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:43:35,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 4 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:43:35,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-11-20 20:43:35,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2022-11-20 20:43:35,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 505 states have (on average 3.1821782178217823) internal successors, (1607), 531 states have internal predecessors, (1607), 0 states have call successors, (0), 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-20 20:43:35,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 1607 transitions. [2022-11-20 20:43:35,283 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 1607 transitions. Word has length 5 [2022-11-20 20:43:35,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:43:35,284 INFO L495 AbstractCegarLoop]: Abstraction has 532 states and 1607 transitions. [2022-11-20 20:43:35,284 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-20 20:43:35,285 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 1607 transitions. [2022-11-20 20:43:35,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 20:43:35,285 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:43:35,285 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-20 20:43:35,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 20:43:35,286 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-20 20:43:35,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:43:35,286 INFO L85 PathProgramCache]: Analyzing trace with hash 665261866, now seen corresponding path program 1 times [2022-11-20 20:43:35,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:43:35,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456548992] [2022-11-20 20:43:35,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:43:35,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:43:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:43:35,570 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-20 20:43:35,571 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:43:35,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456548992] [2022-11-20 20:43:35,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456548992] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:43:35,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:43:35,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 20:43:35,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655932079] [2022-11-20 20:43:35,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:43:35,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:43:35,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:43:35,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:43:35,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:43:35,573 INFO L87 Difference]: Start difference. First operand 532 states and 1607 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-20 20:43:35,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:43:35,709 INFO L93 Difference]: Finished difference Result 886 states and 2660 transitions. [2022-11-20 20:43:35,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:43:35,710 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-20 20:43:35,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:43:35,715 INFO L225 Difference]: With dead ends: 886 [2022-11-20 20:43:35,716 INFO L226 Difference]: Without dead ends: 886 [2022-11-20 20:43:35,716 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-20 20:43:35,716 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 27 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:43:35,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 8 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:43:35,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2022-11-20 20:43:35,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 856. [2022-11-20 20:43:35,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 829 states have (on average 3.170084439083233) internal successors, (2628), 855 states have internal predecessors, (2628), 0 states have call successors, (0), 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-20 20:43:35,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 2628 transitions. [2022-11-20 20:43:35,747 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 2628 transitions. Word has length 5 [2022-11-20 20:43:35,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:43:35,748 INFO L495 AbstractCegarLoop]: Abstraction has 856 states and 2628 transitions. [2022-11-20 20:43:35,748 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-20 20:43:35,748 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 2628 transitions. [2022-11-20 20:43:35,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 20:43:35,749 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:43:35,749 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-20 20:43:35,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 20:43:35,750 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-20 20:43:35,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:43:35,750 INFO L85 PathProgramCache]: Analyzing trace with hash 665296843, now seen corresponding path program 1 times [2022-11-20 20:43:35,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:43:35,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739555598] [2022-11-20 20:43:35,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:43:35,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:43:35,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:43:35,817 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-20 20:43:35,818 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:43:35,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739555598] [2022-11-20 20:43:35,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739555598] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:43:35,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:43:35,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 20:43:35,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375827415] [2022-11-20 20:43:35,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:43:35,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:43:35,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:43:35,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:43:35,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:43:35,820 INFO L87 Difference]: Start difference. First operand 856 states and 2628 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-20 20:43:35,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:43:35,911 INFO L93 Difference]: Finished difference Result 662 states and 1966 transitions. [2022-11-20 20:43:35,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:43:35,912 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-20 20:43:35,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:43:35,916 INFO L225 Difference]: With dead ends: 662 [2022-11-20 20:43:35,916 INFO L226 Difference]: Without dead ends: 662 [2022-11-20 20:43:35,917 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-20 20:43:35,918 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 65 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:43:35,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 4 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:43:35,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2022-11-20 20:43:35,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2022-11-20 20:43:35,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 644 states have (on average 3.0527950310559007) internal successors, (1966), 661 states have internal predecessors, (1966), 0 states have call successors, (0), 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-20 20:43:35,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1966 transitions. [2022-11-20 20:43:35,940 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1966 transitions. Word has length 5 [2022-11-20 20:43:35,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:43:35,940 INFO L495 AbstractCegarLoop]: Abstraction has 662 states and 1966 transitions. [2022-11-20 20:43:35,940 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-20 20:43:35,941 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1966 transitions. [2022-11-20 20:43:35,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 20:43:35,941 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:43:35,941 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-20 20:43:35,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 20:43:35,942 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-20 20:43:35,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:43:35,942 INFO L85 PathProgramCache]: Analyzing trace with hash 665296844, now seen corresponding path program 1 times [2022-11-20 20:43:35,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:43:35,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165941910] [2022-11-20 20:43:35,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:43:35,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:43:35,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:43:36,023 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-20 20:43:36,023 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:43:36,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165941910] [2022-11-20 20:43:36,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165941910] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:43:36,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:43:36,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 20:43:36,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043356184] [2022-11-20 20:43:36,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:43:36,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:43:36,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:43:36,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:43:36,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:43:36,026 INFO L87 Difference]: Start difference. First operand 662 states and 1966 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-20 20:43:36,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:43:36,088 INFO L93 Difference]: Finished difference Result 468 states and 1304 transitions. [2022-11-20 20:43:36,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:43:36,089 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-20 20:43:36,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:43:36,092 INFO L225 Difference]: With dead ends: 468 [2022-11-20 20:43:36,092 INFO L226 Difference]: Without dead ends: 468 [2022-11-20 20:43:36,092 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-20 20:43:36,093 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:43:36,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 4 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:43:36,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-11-20 20:43:36,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2022-11-20 20:43:36,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 459 states have (on average 2.840958605664488) internal successors, (1304), 467 states have internal predecessors, (1304), 0 states have call successors, (0), 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-20 20:43:36,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 1304 transitions. [2022-11-20 20:43:36,108 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 1304 transitions. Word has length 5 [2022-11-20 20:43:36,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:43:36,109 INFO L495 AbstractCegarLoop]: Abstraction has 468 states and 1304 transitions. [2022-11-20 20:43:36,109 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-20 20:43:36,109 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 1304 transitions. [2022-11-20 20:43:36,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 20:43:36,110 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:43:36,110 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-20 20:43:36,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 20:43:36,110 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err3ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-20 20:43:36,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:43:36,111 INFO L85 PathProgramCache]: Analyzing trace with hash -851717704, now seen corresponding path program 1 times [2022-11-20 20:43:36,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:43:36,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858817554] [2022-11-20 20:43:36,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:43:36,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:43:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:43:36,197 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-20 20:43:36,197 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:43:36,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858817554] [2022-11-20 20:43:36,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858817554] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:43:36,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:43:36,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 20:43:36,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194755819] [2022-11-20 20:43:36,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:43:36,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:43:36,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:43:36,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:43:36,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:43:36,200 INFO L87 Difference]: Start difference. First operand 468 states and 1304 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 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-20 20:43:36,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:43:36,294 INFO L93 Difference]: Finished difference Result 406 states and 1096 transitions. [2022-11-20 20:43:36,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:43:36,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 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-20 20:43:36,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:43:36,296 INFO L225 Difference]: With dead ends: 406 [2022-11-20 20:43:36,297 INFO L226 Difference]: Without dead ends: 406 [2022-11-20 20:43:36,297 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-20 20:43:36,297 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 21 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:43:36,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 8 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:43:36,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2022-11-20 20:43:36,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 392. [2022-11-20 20:43:36,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 383 states have (on average 2.825065274151436) internal successors, (1082), 391 states have internal predecessors, (1082), 0 states have call successors, (0), 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-20 20:43:36,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1082 transitions. [2022-11-20 20:43:36,310 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1082 transitions. Word has length 6 [2022-11-20 20:43:36,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:43:36,310 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 1082 transitions. [2022-11-20 20:43:36,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 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-20 20:43:36,311 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1082 transitions. [2022-11-20 20:43:36,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-20 20:43:36,311 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:43:36,311 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:43:36,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 20:43:36,312 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err3ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-20 20:43:36,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:43:36,313 INFO L85 PathProgramCache]: Analyzing trace with hash -633456022, now seen corresponding path program 1 times [2022-11-20 20:43:36,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:43:36,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755425143] [2022-11-20 20:43:36,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:43:36,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:43:36,327 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 20:43:36,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [110895206] [2022-11-20 20:43:36,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:43:36,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:43:36,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:43:36,335 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:43:36,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 20:43:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:43:36,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-20 20:43:36,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:43:36,497 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-20 20:43:36,497 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:43:36,498 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:43:36,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755425143] [2022-11-20 20:43:36,498 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 20:43:36,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110895206] [2022-11-20 20:43:36,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110895206] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:43:36,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:43:36,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:43:36,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382464864] [2022-11-20 20:43:36,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:43:36,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:43:36,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:43:36,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:43:36,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:43:36,501 INFO L87 Difference]: Start difference. First operand 392 states and 1082 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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-20 20:43:36,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:43:36,644 INFO L93 Difference]: Finished difference Result 440 states and 1208 transitions. [2022-11-20 20:43:36,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 20:43:36,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-11-20 20:43:36,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:43:36,647 INFO L225 Difference]: With dead ends: 440 [2022-11-20 20:43:36,647 INFO L226 Difference]: Without dead ends: 440 [2022-11-20 20:43:36,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-20 20:43:36,648 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 41 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:43:36,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 16 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:43:36,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-11-20 20:43:36,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 416. [2022-11-20 20:43:36,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 407 states have (on average 2.8132678132678133) internal successors, (1145), 415 states have internal predecessors, (1145), 0 states have call successors, (0), 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-20 20:43:36,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1145 transitions. [2022-11-20 20:43:36,661 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1145 transitions. Word has length 7 [2022-11-20 20:43:36,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:43:36,662 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 1145 transitions. [2022-11-20 20:43:36,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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-20 20:43:36,662 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1145 transitions. [2022-11-20 20:43:36,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-20 20:43:36,663 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:43:36,663 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:43:36,674 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-20 20:43:36,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:43:36,875 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-20 20:43:36,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:43:36,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1415643751, now seen corresponding path program 1 times [2022-11-20 20:43:36,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:43:36,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440546043] [2022-11-20 20:43:36,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:43:36,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:43:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:43:36,960 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-20 20:43:36,960 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:43:36,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440546043] [2022-11-20 20:43:36,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440546043] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:43:36,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:43:36,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 20:43:36,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386650296] [2022-11-20 20:43:36,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:43:36,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:43:36,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:43:36,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:43:36,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:43:36,963 INFO L87 Difference]: Start difference. First operand 416 states and 1145 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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-20 20:43:37,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:43:37,063 INFO L93 Difference]: Finished difference Result 500 states and 1337 transitions. [2022-11-20 20:43:37,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:43:37,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-20 20:43:37,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:43:37,067 INFO L225 Difference]: With dead ends: 500 [2022-11-20 20:43:37,067 INFO L226 Difference]: Without dead ends: 492 [2022-11-20 20:43:37,067 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-20 20:43:37,068 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 21 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:43:37,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 6 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:43:37,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-11-20 20:43:37,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 452. [2022-11-20 20:43:37,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 441 states have (on average 2.81859410430839) internal successors, (1243), 451 states have internal predecessors, (1243), 0 states have call successors, (0), 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-20 20:43:37,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1243 transitions. [2022-11-20 20:43:37,083 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1243 transitions. Word has length 8 [2022-11-20 20:43:37,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:43:37,083 INFO L495 AbstractCegarLoop]: Abstraction has 452 states and 1243 transitions. [2022-11-20 20:43:37,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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-20 20:43:37,084 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1243 transitions. [2022-11-20 20:43:37,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 20:43:37,085 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:43:37,085 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:43:37,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 20:43:37,086 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-20 20:43:37,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:43:37,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1607997401, now seen corresponding path program 1 times [2022-11-20 20:43:37,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:43:37,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639616604] [2022-11-20 20:43:37,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:43:37,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:43:37,101 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 20:43:37,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [448635580] [2022-11-20 20:43:37,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:43:37,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:43:37,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:43:37,103 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:43:37,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 20:43:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:43:37,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-20 20:43:37,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:43:37,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:43:37,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:43:37,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:43:37,274 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:43:37,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639616604] [2022-11-20 20:43:37,275 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 20:43:37,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448635580] [2022-11-20 20:43:37,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448635580] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-20 20:43:37,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 20:43:37,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2022-11-20 20:43:37,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469306308] [2022-11-20 20:43:37,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:43:37,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:43:37,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:43:37,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:43:37,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:43:37,277 INFO L87 Difference]: Start difference. First operand 452 states and 1243 transitions. Second operand has 3 states, 2 states have (on average 6.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-20 20:43:37,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:43:37,376 INFO L93 Difference]: Finished difference Result 342 states and 882 transitions. [2022-11-20 20:43:37,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:43:37,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.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-20 20:43:37,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:43:37,379 INFO L225 Difference]: With dead ends: 342 [2022-11-20 20:43:37,379 INFO L226 Difference]: Without dead ends: 314 [2022-11-20 20:43:37,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:43:37,380 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 20 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:43:37,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 4 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:43:37,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2022-11-20 20:43:37,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 282. [2022-11-20 20:43:37,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 273 states have (on average 2.706959706959707) internal successors, (739), 281 states have internal predecessors, (739), 0 states have call successors, (0), 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-20 20:43:37,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 739 transitions. [2022-11-20 20:43:37,389 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 739 transitions. Word has length 12 [2022-11-20 20:43:37,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:43:37,390 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 739 transitions. [2022-11-20 20:43:37,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.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-20 20:43:37,390 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 739 transitions. [2022-11-20 20:43:37,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 20:43:37,391 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:43:37,391 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:43:37,402 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 20:43:37,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:43:37,597 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-20 20:43:37,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:43:37,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1328715630, now seen corresponding path program 1 times [2022-11-20 20:43:37,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:43:37,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792189057] [2022-11-20 20:43:37,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:43:37,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:43:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:43:37,641 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-20 20:43:37,642 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:43:37,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792189057] [2022-11-20 20:43:37,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792189057] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:43:37,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:43:37,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:43:37,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307223044] [2022-11-20 20:43:37,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:43:37,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:43:37,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:43:37,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:43:37,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:43:37,644 INFO L87 Difference]: Start difference. First operand 282 states and 739 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-20 20:43:37,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:43:37,742 INFO L93 Difference]: Finished difference Result 354 states and 913 transitions. [2022-11-20 20:43:37,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:43:37,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-20 20:43:37,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:43:37,745 INFO L225 Difference]: With dead ends: 354 [2022-11-20 20:43:37,745 INFO L226 Difference]: Without dead ends: 354 [2022-11-20 20:43:37,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-20 20:43:37,746 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 23 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:43:37,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 8 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:43:37,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-11-20 20:43:37,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 282. [2022-11-20 20:43:37,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 273 states have (on average 2.67032967032967) internal successors, (729), 281 states have internal predecessors, (729), 0 states have call successors, (0), 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-20 20:43:37,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 729 transitions. [2022-11-20 20:43:37,758 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 729 transitions. Word has length 13 [2022-11-20 20:43:37,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:43:37,759 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 729 transitions. [2022-11-20 20:43:37,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-20 20:43:37,759 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 729 transitions. [2022-11-20 20:43:37,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 20:43:37,761 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:43:37,761 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:43:37,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 20:43:37,761 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-20 20:43:37,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:43:37,762 INFO L85 PathProgramCache]: Analyzing trace with hash 877237455, now seen corresponding path program 1 times [2022-11-20 20:43:37,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:43:37,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332648257] [2022-11-20 20:43:37,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:43:37,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:43:37,777 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 20:43:37,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [668712606] [2022-11-20 20:43:37,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:43:37,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:43:37,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:43:37,778 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:43:37,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 20:43:37,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:43:37,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 20:43:37,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:43:37,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 20:43:37,978 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-20 20:43:37,979 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:43:37,979 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:43:37,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332648257] [2022-11-20 20:43:37,979 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 20:43:37,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668712606] [2022-11-20 20:43:37,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668712606] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:43:37,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:43:37,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:43:37,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14657405] [2022-11-20 20:43:37,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:43:37,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:43:37,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:43:37,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:43:37,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:43:37,984 INFO L87 Difference]: Start difference. First operand 282 states and 729 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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-20 20:43:38,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:43:38,062 INFO L93 Difference]: Finished difference Result 204 states and 468 transitions. [2022-11-20 20:43:38,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:43:38,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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-20 20:43:38,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:43:38,064 INFO L225 Difference]: With dead ends: 204 [2022-11-20 20:43:38,064 INFO L226 Difference]: Without dead ends: 192 [2022-11-20 20:43:38,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-20 20:43:38,065 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 17 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:43:38,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:43:38,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-11-20 20:43:38,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2022-11-20 20:43:38,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 187 states have (on average 2.379679144385027) internal successors, (445), 191 states have internal predecessors, (445), 0 states have call successors, (0), 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-20 20:43:38,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 445 transitions. [2022-11-20 20:43:38,073 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 445 transitions. Word has length 14 [2022-11-20 20:43:38,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:43:38,073 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 445 transitions. [2022-11-20 20:43:38,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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-20 20:43:38,073 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 445 transitions. [2022-11-20 20:43:38,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 20:43:38,074 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:43:38,074 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:43:38,085 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 20:43:38,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:43:38,286 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-20 20:43:38,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:43:38,286 INFO L85 PathProgramCache]: Analyzing trace with hash -2019169653, now seen corresponding path program 1 times [2022-11-20 20:43:38,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:43:38,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533727712] [2022-11-20 20:43:38,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:43:38,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:43:38,307 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 20:43:38,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [801184134] [2022-11-20 20:43:38,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:43:38,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:43:38,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:43:38,309 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:43:38,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 20:43:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:43:38,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-20 20:43:38,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:43:38,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:43:38,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:43:38,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:43:38,557 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-20 20:43:38,706 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-20 20:43:38,707 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:43:38,707 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:43:38,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533727712] [2022-11-20 20:43:38,707 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 20:43:38,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801184134] [2022-11-20 20:43:38,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801184134] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:43:38,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:43:38,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 20:43:38,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346660311] [2022-11-20 20:43:38,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:43:38,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:43:38,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:43:38,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:43:38,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:43:38,710 INFO L87 Difference]: Start difference. First operand 192 states and 445 transitions. Second operand has 3 states, 2 states have (on average 7.5) 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-20 20:43:38,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:43:38,806 INFO L93 Difference]: Finished difference Result 304 states and 707 transitions. [2022-11-20 20:43:38,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:43:38,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) 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-20 20:43:38,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:43:38,809 INFO L225 Difference]: With dead ends: 304 [2022-11-20 20:43:38,809 INFO L226 Difference]: Without dead ends: 304 [2022-11-20 20:43:38,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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-20 20:43:38,810 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 19 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:43:38,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 8 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:43:38,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-11-20 20:43:38,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 234. [2022-11-20 20:43:38,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 229 states have (on average 2.510917030567686) internal successors, (575), 233 states have internal predecessors, (575), 0 states have call successors, (0), 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-20 20:43:38,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 575 transitions. [2022-11-20 20:43:38,818 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 575 transitions. Word has length 15 [2022-11-20 20:43:38,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:43:38,819 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 575 transitions. [2022-11-20 20:43:38,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) 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-20 20:43:38,819 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 575 transitions. [2022-11-20 20:43:38,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 20:43:38,820 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:43:38,820 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:43:38,826 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 20:43:39,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-20 20:43:39,026 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-20 20:43:39,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:43:39,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1327831629, now seen corresponding path program 1 times [2022-11-20 20:43:39,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:43:39,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738196093] [2022-11-20 20:43:39,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:43:39,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:43:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:43:39,124 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-20 20:43:39,125 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:43:39,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738196093] [2022-11-20 20:43:39,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738196093] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:43:39,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268911442] [2022-11-20 20:43:39,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:43:39,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:43:39,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:43:39,127 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:43:39,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 20:43:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:43:39,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 20:43:39,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:43:39,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 20:43:39,273 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:43:39,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268911442] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:43:39,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 20:43:39,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-20 20:43:39,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527557591] [2022-11-20 20:43:39,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:43:39,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:43:39,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:43:39,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:43:39,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:43:39,275 INFO L87 Difference]: Start difference. First operand 234 states and 575 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-20 20:43:39,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:43:39,367 INFO L93 Difference]: Finished difference Result 326 states and 779 transitions. [2022-11-20 20:43:39,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:43:39,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-20 20:43:39,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:43:39,370 INFO L225 Difference]: With dead ends: 326 [2022-11-20 20:43:39,370 INFO L226 Difference]: Without dead ends: 326 [2022-11-20 20:43:39,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:43:39,371 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 22 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:43:39,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 10 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:43:39,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-11-20 20:43:39,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 264. [2022-11-20 20:43:39,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 259 states have (on average 2.4787644787644787) internal successors, (642), 263 states have internal predecessors, (642), 0 states have call successors, (0), 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-20 20:43:39,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 642 transitions. [2022-11-20 20:43:39,381 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 642 transitions. Word has length 15 [2022-11-20 20:43:39,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:43:39,382 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 642 transitions. [2022-11-20 20:43:39,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-20 20:43:39,382 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 642 transitions. [2022-11-20 20:43:39,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 20:43:39,383 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:43:39,383 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:43:39,393 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 20:43:39,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-20 20:43:39,589 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-20 20:43:39,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:43:39,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1830250880, now seen corresponding path program 1 times [2022-11-20 20:43:39,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:43:39,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663611522] [2022-11-20 20:43:39,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:43:39,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:43:39,605 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 20:43:39,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [109593600] [2022-11-20 20:43:39,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:43:39,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:43:39,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:43:39,607 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:43:39,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 20:43:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:43:39,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-20 20:43:39,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:43:40,089 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-20 20:43:40,090 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:43:40,090 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:43:40,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663611522] [2022-11-20 20:43:40,090 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 20:43:40,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109593600] [2022-11-20 20:43:40,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109593600] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:43:40,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:43:40,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:43:40,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036442824] [2022-11-20 20:43:40,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:43:40,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:43:40,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:43:40,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:43:40,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:43:40,092 INFO L87 Difference]: Start difference. First operand 264 states and 642 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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-20 20:43:40,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:43:40,362 INFO L93 Difference]: Finished difference Result 298 states and 674 transitions. [2022-11-20 20:43:40,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 20:43:40,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-20 20:43:40,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:43:40,364 INFO L225 Difference]: With dead ends: 298 [2022-11-20 20:43:40,364 INFO L226 Difference]: Without dead ends: 298 [2022-11-20 20:43:40,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:43:40,365 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 25 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 12 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.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:43:40,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 12 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 20:43:40,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-11-20 20:43:40,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 250. [2022-11-20 20:43:40,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 2.3959183673469386) internal successors, (587), 249 states have internal predecessors, (587), 0 states have call successors, (0), 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-20 20:43:40,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 587 transitions. [2022-11-20 20:43:40,373 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 587 transitions. Word has length 16 [2022-11-20 20:43:40,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:43:40,374 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 587 transitions. [2022-11-20 20:43:40,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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-20 20:43:40,374 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 587 transitions. [2022-11-20 20:43:40,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 20:43:40,377 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:43:40,377 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:43:40,391 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 20:43:40,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-20 20:43:40,584 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-20 20:43:40,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:43:40,585 INFO L85 PathProgramCache]: Analyzing trace with hash 903175339, now seen corresponding path program 1 times [2022-11-20 20:43:40,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:43:40,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761421422] [2022-11-20 20:43:40,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:43:40,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:43:40,600 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 20:43:40,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1549807469] [2022-11-20 20:43:40,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:43:40,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:43:40,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:43:40,602 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:43:40,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 20:43:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:43:41,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-20 20:43:41,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:43:41,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:43:41,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 12 [2022-11-20 20:43:41,097 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 20:43:41,097 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-20 20:43:41,181 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 52 treesize of output 45 [2022-11-20 20:43:41,329 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 13 treesize of output 15 [2022-11-20 20:43:41,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2022-11-20 20:43:41,443 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-20 20:43:41,443 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:43:41,443 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:43:41,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761421422] [2022-11-20 20:43:41,443 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 20:43:41,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549807469] [2022-11-20 20:43:41,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549807469] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:43:41,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:43:41,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 20:43:41,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248633571] [2022-11-20 20:43:41,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:43:41,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 20:43:41,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:43:41,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 20:43:41,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-20 20:43:41,446 INFO L87 Difference]: Start difference. First operand 250 states and 587 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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-20 20:43:41,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:43:41,640 INFO L93 Difference]: Finished difference Result 322 states and 728 transitions. [2022-11-20 20:43:41,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 20:43:41,641 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-11-20 20:43:41,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:43:41,642 INFO L225 Difference]: With dead ends: 322 [2022-11-20 20:43:41,642 INFO L226 Difference]: Without dead ends: 322 [2022-11-20 20:43:41,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-20 20:43:41,643 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 37 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:43:41,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 24 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 138 Invalid, 0 Unknown, 44 Unchecked, 0.2s Time] [2022-11-20 20:43:41,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-11-20 20:43:41,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 262. [2022-11-20 20:43:41,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 257 states have (on average 2.377431906614786) internal successors, (611), 261 states have internal predecessors, (611), 0 states have call successors, (0), 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-20 20:43:41,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 611 transitions. [2022-11-20 20:43:41,652 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 611 transitions. Word has length 17 [2022-11-20 20:43:41,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:43:41,652 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 611 transitions. [2022-11-20 20:43:41,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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-20 20:43:41,652 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 611 transitions. [2022-11-20 20:43:41,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 20:43:41,653 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:43:41,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:43:41,664 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 20:43:41,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-20 20:43:41,854 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-20 20:43:41,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:43:41,854 INFO L85 PathProgramCache]: Analyzing trace with hash -440966270, now seen corresponding path program 1 times [2022-11-20 20:43:41,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:43:41,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039654457] [2022-11-20 20:43:41,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:43:41,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:43:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:43:41,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 20:43:41,926 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:43:41,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039654457] [2022-11-20 20:43:41,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039654457] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:43:41,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140357169] [2022-11-20 20:43:41,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:43:41,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:43:41,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:43:41,929 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:43:41,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 20:43:42,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:43:42,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 20:43:42,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:43:42,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 20:43:42,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:43:42,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 20:43:42,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140357169] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:43:42,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1907291221] [2022-11-20 20:43:42,115 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-20 20:43:42,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:43:42,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-20 20:43:42,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994696786] [2022-11-20 20:43:42,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:43:42,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 20:43:42,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:43:42,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 20:43:42,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-20 20:43:42,125 INFO L87 Difference]: Start difference. First operand 262 states and 611 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:43:42,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:43:42,322 INFO L93 Difference]: Finished difference Result 536 states and 1201 transitions. [2022-11-20 20:43:42,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 20:43:42,323 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-20 20:43:42,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:43:42,325 INFO L225 Difference]: With dead ends: 536 [2022-11-20 20:43:42,326 INFO L226 Difference]: Without dead ends: 536 [2022-11-20 20:43:42,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-20 20:43:42,326 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 154 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:43:42,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 18 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 20:43:42,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2022-11-20 20:43:42,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 515. [2022-11-20 20:43:42,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 508 states have (on average 2.328740157480315) internal successors, (1183), 514 states have internal predecessors, (1183), 0 states have call successors, (0), 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-20 20:43:42,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 1183 transitions. [2022-11-20 20:43:42,341 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 1183 transitions. Word has length 17 [2022-11-20 20:43:42,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:43:42,342 INFO L495 AbstractCegarLoop]: Abstraction has 515 states and 1183 transitions. [2022-11-20 20:43:42,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:43:42,343 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 1183 transitions. [2022-11-20 20:43:42,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 20:43:42,343 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:43:42,344 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:43:42,354 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 20:43:42,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-20 20:43:42,555 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-20 20:43:42,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:43:42,555 INFO L85 PathProgramCache]: Analyzing trace with hash -2066335500, now seen corresponding path program 1 times [2022-11-20 20:43:42,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:43:42,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162474817] [2022-11-20 20:43:42,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:43:42,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:43:42,573 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 20:43:42,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [283102920] [2022-11-20 20:43:42,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:43:42,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:43:42,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:43:42,575 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:43:42,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 20:43:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:43:42,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-20 20:43:42,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:43:42,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:43:42,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 12 [2022-11-20 20:43:42,962 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 20:43:42,963 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-20 20:43:43,078 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 52 treesize of output 45 [2022-11-20 20:43:43,211 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 13 treesize of output 15 [2022-11-20 20:43:43,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2022-11-20 20:43:43,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-20 20:43:43,330 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:43:43,330 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:43:43,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162474817] [2022-11-20 20:43:43,330 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 20:43:43,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283102920] [2022-11-20 20:43:43,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283102920] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:43:43,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:43:43,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 20:43:43,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013096670] [2022-11-20 20:43:43,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:43:43,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 20:43:43,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:43:43,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 20:43:43,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-20 20:43:43,332 INFO L87 Difference]: Start difference. First operand 515 states and 1183 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 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-20 20:43:43,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:43:43,502 INFO L93 Difference]: Finished difference Result 571 states and 1294 transitions. [2022-11-20 20:43:43,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 20:43:43,502 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-11-20 20:43:43,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:43:43,505 INFO L225 Difference]: With dead ends: 571 [2022-11-20 20:43:43,505 INFO L226 Difference]: Without dead ends: 571 [2022-11-20 20:43:43,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-20 20:43:43,506 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 75 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:43:43,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 16 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 104 Invalid, 0 Unknown, 55 Unchecked, 0.1s Time] [2022-11-20 20:43:43,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-11-20 20:43:43,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 514. [2022-11-20 20:43:43,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 507 states have (on average 2.329388560157791) internal successors, (1181), 513 states have internal predecessors, (1181), 0 states have call successors, (0), 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-20 20:43:43,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 1181 transitions. [2022-11-20 20:43:43,521 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 1181 transitions. Word has length 18 [2022-11-20 20:43:43,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:43:43,521 INFO L495 AbstractCegarLoop]: Abstraction has 514 states and 1181 transitions. [2022-11-20 20:43:43,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 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-20 20:43:43,521 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 1181 transitions. [2022-11-20 20:43:43,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 20:43:43,522 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:43:43,522 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:43:43,534 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 20:43:43,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:43:43,733 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-20 20:43:43,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:43:43,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1282220846, now seen corresponding path program 1 times [2022-11-20 20:43:43,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:43:43,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788349526] [2022-11-20 20:43:43,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:43:43,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:43:43,754 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 20:43:43,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1221772361] [2022-11-20 20:43:43,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:43:43,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:43:43,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:43:43,756 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:43:43,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 20:43:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:43:44,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-20 20:43:44,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:43:44,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:43:44,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:43:44,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:43:44,033 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-20 20:43:44,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:43:44,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:43:45,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:43:45,448 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:43:45,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788349526] [2022-11-20 20:43:45,449 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 20:43:45,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221772361] [2022-11-20 20:43:45,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221772361] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:43:45,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1148017344] [2022-11-20 20:43:45,450 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-20 20:43:45,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:43:45,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2022-11-20 20:43:45,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337394203] [2022-11-20 20:43:45,450 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:43:45,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 20:43:45,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:43:45,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 20:43:45,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-20 20:43:45,451 INFO L87 Difference]: Start difference. First operand 514 states and 1181 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 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-20 20:43:45,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:43:45,607 INFO L93 Difference]: Finished difference Result 602 states and 1348 transitions. [2022-11-20 20:43:45,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 20:43:45,607 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 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-20 20:43:45,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:43:45,610 INFO L225 Difference]: With dead ends: 602 [2022-11-20 20:43:45,610 INFO L226 Difference]: Without dead ends: 602 [2022-11-20 20:43:45,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-11-20 20:43:45,612 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 75 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:43:45,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 8 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:43:45,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2022-11-20 20:43:45,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 486. [2022-11-20 20:43:45,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 483 states have (on average 2.269151138716356) internal successors, (1096), 485 states have internal predecessors, (1096), 0 states have call successors, (0), 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-20 20:43:45,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 1096 transitions. [2022-11-20 20:43:45,631 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 1096 transitions. Word has length 22 [2022-11-20 20:43:45,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:43:45,631 INFO L495 AbstractCegarLoop]: Abstraction has 486 states and 1096 transitions. [2022-11-20 20:43:45,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 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-20 20:43:45,632 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 1096 transitions. [2022-11-20 20:43:45,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 20:43:45,633 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:43:45,633 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:43:45,640 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 20:43:45,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:43:45,840 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-20 20:43:45,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:43:45,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1399439347, now seen corresponding path program 2 times [2022-11-20 20:43:45,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:43:45,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430368576] [2022-11-20 20:43:45,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:43:45,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:43:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:43:45,928 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-20 20:43:45,929 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:43:45,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430368576] [2022-11-20 20:43:45,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430368576] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:43:45,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349323664] [2022-11-20 20:43:45,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:43:45,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:43:45,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:43:45,931 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:43:45,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 20:43:46,090 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-20 20:43:46,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:43:46,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 20:43:46,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:43:46,292 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-20 20:43:46,293 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:43:46,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349323664] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:43:46,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 20:43:46,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2022-11-20 20:43:46,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330934880] [2022-11-20 20:43:46,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:43:46,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:43:46,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:43:46,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:43:46,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:43:46,295 INFO L87 Difference]: Start difference. First operand 486 states and 1096 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 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-20 20:43:46,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:43:46,320 INFO L93 Difference]: Finished difference Result 533 states and 1193 transitions. [2022-11-20 20:43:46,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:43:46,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-20 20:43:46,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:43:46,323 INFO L225 Difference]: With dead ends: 533 [2022-11-20 20:43:46,324 INFO L226 Difference]: Without dead ends: 422 [2022-11-20 20:43:46,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:43:46,325 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 20:43:46,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 26 Unchecked, 0.0s Time] [2022-11-20 20:43:46,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-11-20 20:43:46,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2022-11-20 20:43:46,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 419 states have (on average 2.2553699284009547) internal successors, (945), 421 states have internal predecessors, (945), 0 states have call successors, (0), 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-20 20:43:46,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 945 transitions. [2022-11-20 20:43:46,336 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 945 transitions. Word has length 23 [2022-11-20 20:43:46,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:43:46,337 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 945 transitions. [2022-11-20 20:43:46,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 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-20 20:43:46,337 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 945 transitions. [2022-11-20 20:43:46,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 20:43:46,338 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:43:46,338 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:43:46,351 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-20 20:43:46,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:43:46,551 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-20 20:43:46,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:43:46,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1106763194, now seen corresponding path program 1 times [2022-11-20 20:43:46,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:43:46,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868835135] [2022-11-20 20:43:46,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:43:46,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:43:46,584 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 20:43:46,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [166800285] [2022-11-20 20:43:46,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:43:46,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:43:46,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:43:46,586 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:43:46,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-20 20:43:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:43:46,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 20:43:46,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:43:46,830 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:43:46,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:43:46,924 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:43:46,925 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:43:46,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868835135] [2022-11-20 20:43:46,925 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 20:43:46,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166800285] [2022-11-20 20:43:46,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166800285] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:43:46,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [98262101] [2022-11-20 20:43:46,926 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-20 20:43:46,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:43:46,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-11-20 20:43:46,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986732592] [2022-11-20 20:43:46,928 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:43:46,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 20:43:46,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:43:46,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 20:43:46,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-11-20 20:43:46,929 INFO L87 Difference]: Start difference. First operand 422 states and 945 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 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-20 20:43:47,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:43:47,190 INFO L93 Difference]: Finished difference Result 658 states and 1453 transitions. [2022-11-20 20:43:47,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 20:43:47,192 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 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 24 [2022-11-20 20:43:47,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:43:47,195 INFO L225 Difference]: With dead ends: 658 [2022-11-20 20:43:47,195 INFO L226 Difference]: Without dead ends: 658 [2022-11-20 20:43:47,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-11-20 20:43:47,196 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 273 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:43:47,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 30 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 20:43:47,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2022-11-20 20:43:47,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 650. [2022-11-20 20:43:47,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 647 states have (on average 2.2395672333848533) internal successors, (1449), 649 states have internal predecessors, (1449), 0 states have call successors, (0), 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-20 20:43:47,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1449 transitions. [2022-11-20 20:43:47,212 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1449 transitions. Word has length 24 [2022-11-20 20:43:47,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:43:47,213 INFO L495 AbstractCegarLoop]: Abstraction has 650 states and 1449 transitions. [2022-11-20 20:43:47,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 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-20 20:43:47,213 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1449 transitions. [2022-11-20 20:43:47,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-20 20:43:47,214 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:43:47,215 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:43:47,225 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-20 20:43:47,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-20 20:43:47,421 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-20 20:43:47,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:43:47,421 INFO L85 PathProgramCache]: Analyzing trace with hash -743217045, now seen corresponding path program 2 times [2022-11-20 20:43:47,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:43:47,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869828466] [2022-11-20 20:43:47,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:43:47,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:43:47,442 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 20:43:47,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1278596676] [2022-11-20 20:43:47,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:43:47,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:43:47,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:43:47,443 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:43:47,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-20 20:43:47,686 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 20:43:47,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:43:47,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-20 20:43:47,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:43:47,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:43:47,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 12 [2022-11-20 20:43:47,718 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 20:43:47,719 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-20 20:43:47,820 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 52 treesize of output 45 [2022-11-20 20:43:48,061 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 13 treesize of output 15 [2022-11-20 20:43:48,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2022-11-20 20:43:48,180 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-20 20:43:48,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:43:56,410 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1146 (Array Int Int)) (aux_mod_v_~first~0_191_46 Int)) (or (<= aux_mod_v_~first~0_191_46 2147483647) (<= 4294967296 aux_mod_v_~first~0_191_46) (= c_~value~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1146) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (- 4294967296) (mod aux_mod_v_~first~0_191_46 4294967296)))))) (forall ((v_ArrVal_1146 (Array Int Int)) (aux_mod_v_~first~0_191_46 Int)) (or (< 2147483647 aux_mod_v_~first~0_191_46) (< aux_mod_v_~first~0_191_46 0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1146) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod aux_mod_v_~first~0_191_46 4294967296))) c_~value~0)))) is different from false [2022-11-20 20:43:58,822 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1146 (Array Int Int)) (aux_mod_v_~first~0_191_46 Int)) (or (<= aux_mod_v_~first~0_191_46 2147483647) (= |c_t1Thread1of1ForFork0_~i~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1146) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (- 4294967296) (mod aux_mod_v_~first~0_191_46 4294967296)))) (<= 4294967296 aux_mod_v_~first~0_191_46))) (forall ((v_ArrVal_1146 (Array Int Int)) (aux_mod_v_~first~0_191_46 Int)) (or (< 2147483647 aux_mod_v_~first~0_191_46) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1146) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod aux_mod_v_~first~0_191_46 4294967296))) |c_t1Thread1of1ForFork0_~i~0#1|) (< aux_mod_v_~first~0_191_46 0)))) is different from false [2022-11-20 20:43:59,242 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (mod |c_t1Thread1of1ForFork0_~i~0#1| 256))) (let ((.cse0 (<= .cse3 127)) (.cse1 (select |c_#memory_int| |c_~#buffer~0.base|))) (and (or .cse0 (let ((.cse2 (+ .cse3 (- 256)))) (and (forall ((aux_mod_~next~0_24 Int)) (or (<= aux_mod_~next~0_24 2147483647) (forall ((|~#buffer~0.offset| Int) (v_ArrVal_1146 (Array Int Int)) (aux_mod_v_~first~0_191_46 Int)) (or (= |c_t1Thread1of1ForFork0_~i~0#1| (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse1 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296) (- 4294967296)) .cse2)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1146) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_191_46 4294967296)))) (< 2147483647 aux_mod_v_~first~0_191_46) (< aux_mod_v_~first~0_191_46 0))) (<= 4294967296 aux_mod_~next~0_24))) (forall ((aux_mod_~next~0_24 Int)) (or (<= aux_mod_~next~0_24 2147483647) (forall ((|~#buffer~0.offset| Int) (v_ArrVal_1146 (Array Int Int)) (aux_mod_v_~first~0_191_46 Int)) (or (<= aux_mod_v_~first~0_191_46 2147483647) (<= 4294967296 aux_mod_v_~first~0_191_46) (= (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse1 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296) (- 4294967296)) .cse2)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1146) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (- 4294967296) (mod aux_mod_v_~first~0_191_46 4294967296))) |c_t1Thread1of1ForFork0_~i~0#1|))) (<= 4294967296 aux_mod_~next~0_24))) (forall ((aux_mod_~next~0_24 Int)) (or (forall ((|~#buffer~0.offset| Int) (v_ArrVal_1146 (Array Int Int)) (aux_mod_v_~first~0_191_46 Int)) (or (< 2147483647 aux_mod_v_~first~0_191_46) (= (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse1 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296)) .cse2)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1146) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_191_46 4294967296))) |c_t1Thread1of1ForFork0_~i~0#1|) (< aux_mod_v_~first~0_191_46 0))) (< 2147483647 aux_mod_~next~0_24) (< aux_mod_~next~0_24 0))) (forall ((aux_mod_~next~0_24 Int)) (or (forall ((|~#buffer~0.offset| Int) (v_ArrVal_1146 (Array Int Int)) (aux_mod_v_~first~0_191_46 Int)) (or (<= aux_mod_v_~first~0_191_46 2147483647) (<= 4294967296 aux_mod_v_~first~0_191_46) (= (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse1 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296)) .cse2)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1146) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (- 4294967296) (mod aux_mod_v_~first~0_191_46 4294967296))) |c_t1Thread1of1ForFork0_~i~0#1|))) (< 2147483647 aux_mod_~next~0_24) (< aux_mod_~next~0_24 0)))))) (or (not .cse0) (and (forall ((aux_mod_~next~0_24 Int)) (or (forall ((|~#buffer~0.offset| Int) (v_ArrVal_1146 (Array Int Int)) (aux_mod_v_~first~0_191_46 Int)) (or (< 2147483647 aux_mod_v_~first~0_191_46) (< aux_mod_v_~first~0_191_46 0) (= (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse1 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296)) .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1146) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_191_46 4294967296))) |c_t1Thread1of1ForFork0_~i~0#1|))) (< 2147483647 aux_mod_~next~0_24) (< aux_mod_~next~0_24 0))) (forall ((aux_mod_~next~0_24 Int)) (or (forall ((|~#buffer~0.offset| Int) (v_ArrVal_1146 (Array Int Int)) (aux_mod_v_~first~0_191_46 Int)) (or (<= aux_mod_v_~first~0_191_46 2147483647) (= |c_t1Thread1of1ForFork0_~i~0#1| (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse1 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296) (- 4294967296)) .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1146) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (- 4294967296) (mod aux_mod_v_~first~0_191_46 4294967296)))) (<= 4294967296 aux_mod_v_~first~0_191_46))) (<= aux_mod_~next~0_24 2147483647) (<= 4294967296 aux_mod_~next~0_24))) (forall ((aux_mod_~next~0_24 Int)) (or (< 2147483647 aux_mod_~next~0_24) (forall ((|~#buffer~0.offset| Int) (v_ArrVal_1146 (Array Int Int)) (aux_mod_v_~first~0_191_46 Int)) (or (<= aux_mod_v_~first~0_191_46 2147483647) (= |c_t1Thread1of1ForFork0_~i~0#1| (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse1 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296)) .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1146) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (- 4294967296) (mod aux_mod_v_~first~0_191_46 4294967296)))) (<= 4294967296 aux_mod_v_~first~0_191_46))) (< aux_mod_~next~0_24 0))) (forall ((aux_mod_~next~0_24 Int)) (or (<= aux_mod_~next~0_24 2147483647) (forall ((|~#buffer~0.offset| Int) (v_ArrVal_1146 (Array Int Int)) (aux_mod_v_~first~0_191_46 Int)) (or (< 2147483647 aux_mod_v_~first~0_191_46) (< aux_mod_v_~first~0_191_46 0) (= |c_t1Thread1of1ForFork0_~i~0#1| (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse1 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296) (- 4294967296)) .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1146) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_191_46 4294967296)))))) (<= 4294967296 aux_mod_~next~0_24)))))))) is different from false [2022-11-20 20:43:59,699 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#buffer~0.base|))) (and (forall ((aux_mod_~next~0_24 Int)) (or (forall ((|~#buffer~0.offset| Int) (v_ArrVal_1146 (Array Int Int)) (aux_mod_v_~first~0_191_46 Int)) (or (< 2147483647 aux_mod_v_~first~0_191_46) (= (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296)) 0)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1146) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_191_46 4294967296))) 0) (< aux_mod_v_~first~0_191_46 0))) (< 2147483647 aux_mod_~next~0_24) (< aux_mod_~next~0_24 0))) (forall ((aux_mod_~next~0_24 Int)) (or (forall ((|~#buffer~0.offset| Int) (v_ArrVal_1146 (Array Int Int)) (aux_mod_v_~first~0_191_46 Int)) (or (< 2147483647 aux_mod_v_~first~0_191_46) (< aux_mod_v_~first~0_191_46 0) (= (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296) (- 4294967296)) 0)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1146) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_191_46 4294967296))) 0))) (<= aux_mod_~next~0_24 2147483647) (<= 4294967296 aux_mod_~next~0_24))) (forall ((aux_mod_~next~0_24 Int)) (or (<= aux_mod_~next~0_24 2147483647) (forall ((|~#buffer~0.offset| Int) (v_ArrVal_1146 (Array Int Int)) (aux_mod_v_~first~0_191_46 Int)) (or (<= aux_mod_v_~first~0_191_46 2147483647) (= (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296) (- 4294967296)) 0)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1146) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (- 4294967296) (mod aux_mod_v_~first~0_191_46 4294967296))) 0) (<= 4294967296 aux_mod_v_~first~0_191_46))) (<= 4294967296 aux_mod_~next~0_24))) (forall ((aux_mod_~next~0_24 Int)) (or (forall ((|~#buffer~0.offset| Int) (v_ArrVal_1146 (Array Int Int)) (aux_mod_v_~first~0_191_46 Int)) (or (<= aux_mod_v_~first~0_191_46 2147483647) (= (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296)) 0)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1146) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (- 4294967296) (mod aux_mod_v_~first~0_191_46 4294967296))) 0) (<= 4294967296 aux_mod_v_~first~0_191_46))) (< 2147483647 aux_mod_~next~0_24) (< aux_mod_~next~0_24 0))))) is different from false [2022-11-20 20:43:59,834 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 13 not checked. [2022-11-20 20:43:59,835 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:43:59,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869828466] [2022-11-20 20:43:59,835 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 20:43:59,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278596676] [2022-11-20 20:43:59,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278596676] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:43:59,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1690212043] [2022-11-20 20:43:59,836 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-20 20:43:59,837 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:43:59,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2022-11-20 20:43:59,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790890298] [2022-11-20 20:43:59,838 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:43:59,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 20:43:59,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:43:59,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 20:43:59,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=51, Unknown=8, NotChecked=68, Total=156 [2022-11-20 20:43:59,840 INFO L87 Difference]: Start difference. First operand 650 states and 1449 transitions. Second operand has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 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-20 20:44:06,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:44:06,194 INFO L93 Difference]: Finished difference Result 696 states and 1516 transitions. [2022-11-20 20:44:06,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 20:44:06,195 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-20 20:44:06,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:44:06,198 INFO L225 Difference]: With dead ends: 696 [2022-11-20 20:44:06,198 INFO L226 Difference]: Without dead ends: 696 [2022-11-20 20:44:06,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=44, Invalid=73, Unknown=9, NotChecked=84, Total=210 [2022-11-20 20:44:06,199 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 67 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 229 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:44:06,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 40 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 134 Invalid, 0 Unknown, 229 Unchecked, 0.2s Time] [2022-11-20 20:44:06,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2022-11-20 20:44:06,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 652. [2022-11-20 20:44:06,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 649 states have (on average 2.238828967642527) internal successors, (1453), 651 states have internal predecessors, (1453), 0 states have call successors, (0), 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-20 20:44:06,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 1453 transitions. [2022-11-20 20:44:06,223 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 1453 transitions. Word has length 30 [2022-11-20 20:44:06,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:44:06,223 INFO L495 AbstractCegarLoop]: Abstraction has 652 states and 1453 transitions. [2022-11-20 20:44:06,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 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-20 20:44:06,224 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 1453 transitions. [2022-11-20 20:44:06,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-20 20:44:06,226 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:44:06,226 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:44:06,239 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-20 20:44:06,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:44:06,432 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-20 20:44:06,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:44:06,433 INFO L85 PathProgramCache]: Analyzing trace with hash -371198385, now seen corresponding path program 1 times [2022-11-20 20:44:06,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:44:06,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340550079] [2022-11-20 20:44:06,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:44:06,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:44:06,455 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 20:44:06,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1282275494] [2022-11-20 20:44:06,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:44:06,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:44:06,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:44:06,457 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:44:06,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-20 20:44:06,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:44:06,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-20 20:44:06,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:44:07,269 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:44:07,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:44:09,484 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:44:09,485 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:44:09,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340550079] [2022-11-20 20:44:09,485 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 20:44:09,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282275494] [2022-11-20 20:44:09,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282275494] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:44:09,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [876575544] [2022-11-20 20:44:09,486 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java: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-20 20:44:09,487 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:44:09,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2022-11-20 20:44:09,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298173962] [2022-11-20 20:44:09,488 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:44:09,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 20:44:09,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:44:09,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 20:44:09,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-11-20 20:44:09,489 INFO L87 Difference]: Start difference. First operand 652 states and 1453 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:44:12,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:44:12,468 INFO L93 Difference]: Finished difference Result 1300 states and 2809 transitions. [2022-11-20 20:44:12,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 20:44:12,469 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-20 20:44:12,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:44:12,475 INFO L225 Difference]: With dead ends: 1300 [2022-11-20 20:44:12,475 INFO L226 Difference]: Without dead ends: 1300 [2022-11-20 20:44:12,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2022-11-20 20:44:12,476 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 222 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-20 20:44:12,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 46 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-20 20:44:12,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2022-11-20 20:44:12,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 934. [2022-11-20 20:44:12,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 931 states have (on average 2.3125671321160044) internal successors, (2153), 933 states have internal predecessors, (2153), 0 states have call successors, (0), 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-20 20:44:12,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 2153 transitions. [2022-11-20 20:44:12,505 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 2153 transitions. Word has length 30 [2022-11-20 20:44:12,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:44:12,505 INFO L495 AbstractCegarLoop]: Abstraction has 934 states and 2153 transitions. [2022-11-20 20:44:12,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:44:12,506 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 2153 transitions. [2022-11-20 20:44:12,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-20 20:44:12,507 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:44:12,507 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:44:12,519 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-11-20 20:44:12,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-20 20:44:12,714 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-20 20:44:12,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:44:12,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1564891852, now seen corresponding path program 1 times [2022-11-20 20:44:12,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:44:12,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187865170] [2022-11-20 20:44:12,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:44:12,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:44:12,732 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 20:44:12,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1565280221] [2022-11-20 20:44:12,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:44:12,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:44:12,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:44:12,734 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:44:12,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-20 20:44:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:44:12,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-20 20:44:12,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:44:12,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:44:12,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 12 [2022-11-20 20:44:12,977 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 20:44:12,978 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-20 20:44:13,046 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 52 treesize of output 45 [2022-11-20 20:44:13,287 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 13 treesize of output 15 [2022-11-20 20:44:13,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2022-11-20 20:44:13,405 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-20 20:44:13,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:44:23,633 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((aux_mod_v_~first~0_193_46 Int) (v_ArrVal_1365 (Array Int Int))) (or (< aux_mod_v_~first~0_193_46 0) (= c_~value~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1365) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod aux_mod_v_~first~0_193_46 4294967296)))) (< 2147483647 aux_mod_v_~first~0_193_46))) (forall ((aux_mod_v_~first~0_193_46 Int) (v_ArrVal_1365 (Array Int Int))) (or (<= 4294967296 aux_mod_v_~first~0_193_46) (<= aux_mod_v_~first~0_193_46 2147483647) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1365) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod aux_mod_v_~first~0_193_46 4294967296) (- 4294967296))) c_~value~0)))) is different from false [2022-11-20 20:44:31,518 WARN L233 SmtUtils]: Spent 7.56s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 20:44:33,628 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((aux_mod_v_~first~0_193_46 Int) (v_ArrVal_1365 (Array Int Int))) (or (< aux_mod_v_~first~0_193_46 0) (< 2147483647 aux_mod_v_~first~0_193_46) (= |c_t1Thread1of1ForFork0_~i~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1365) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod aux_mod_v_~first~0_193_46 4294967296)))))) (forall ((aux_mod_v_~first~0_193_46 Int) (v_ArrVal_1365 (Array Int Int))) (or (<= 4294967296 aux_mod_v_~first~0_193_46) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1365) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod aux_mod_v_~first~0_193_46 4294967296) (- 4294967296))) |c_t1Thread1of1ForFork0_~i~0#1|) (<= aux_mod_v_~first~0_193_46 2147483647)))) is different from false [2022-11-20 20:44:34,022 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (mod |c_t1Thread1of1ForFork0_~i~0#1| 256))) (let ((.cse1 (select |c_#memory_int| |c_~#buffer~0.base|)) (.cse0 (<= .cse2 127))) (and (or (not .cse0) (and (forall ((aux_mod_~next~0_24 Int)) (or (forall ((|~#buffer~0.offset| Int) (aux_mod_v_~first~0_193_46 Int) (v_ArrVal_1365 (Array Int Int))) (or (< aux_mod_v_~first~0_193_46 0) (= (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse1 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296)) .cse2)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1365) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_193_46 4294967296))) |c_t1Thread1of1ForFork0_~i~0#1|) (< 2147483647 aux_mod_v_~first~0_193_46))) (< 2147483647 aux_mod_~next~0_24) (< aux_mod_~next~0_24 0))) (forall ((aux_mod_~next~0_24 Int)) (or (forall ((|~#buffer~0.offset| Int) (aux_mod_v_~first~0_193_46 Int) (v_ArrVal_1365 (Array Int Int))) (or (< aux_mod_v_~first~0_193_46 0) (< 2147483647 aux_mod_v_~first~0_193_46) (= |c_t1Thread1of1ForFork0_~i~0#1| (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse1 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296) (- 4294967296)) .cse2)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1365) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_193_46 4294967296)))))) (<= aux_mod_~next~0_24 2147483647) (<= 4294967296 aux_mod_~next~0_24))) (forall ((aux_mod_~next~0_24 Int)) (or (forall ((|~#buffer~0.offset| Int) (aux_mod_v_~first~0_193_46 Int) (v_ArrVal_1365 (Array Int Int))) (or (<= 4294967296 aux_mod_v_~first~0_193_46) (<= aux_mod_v_~first~0_193_46 2147483647) (= (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse1 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296)) .cse2)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1365) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_193_46 4294967296) (- 4294967296))) |c_t1Thread1of1ForFork0_~i~0#1|))) (< 2147483647 aux_mod_~next~0_24) (< aux_mod_~next~0_24 0))) (forall ((aux_mod_~next~0_24 Int)) (or (forall ((|~#buffer~0.offset| Int) (aux_mod_v_~first~0_193_46 Int) (v_ArrVal_1365 (Array Int Int))) (or (<= 4294967296 aux_mod_v_~first~0_193_46) (= |c_t1Thread1of1ForFork0_~i~0#1| (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse1 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296) (- 4294967296)) .cse2)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1365) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_193_46 4294967296) (- 4294967296)))) (<= aux_mod_v_~first~0_193_46 2147483647))) (<= aux_mod_~next~0_24 2147483647) (<= 4294967296 aux_mod_~next~0_24))))) (or (let ((.cse3 (+ .cse2 (- 256)))) (and (forall ((aux_mod_v_~first~0_193_46 Int)) (or (< aux_mod_v_~first~0_193_46 0) (< 2147483647 aux_mod_v_~first~0_193_46) (forall ((|~#buffer~0.offset| Int) (aux_mod_~next~0_24 Int) (v_ArrVal_1365 (Array Int Int))) (or (<= aux_mod_~next~0_24 2147483647) (= |c_t1Thread1of1ForFork0_~i~0#1| (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse1 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296) (- 4294967296)) .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1365) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_193_46 4294967296)))) (<= 4294967296 aux_mod_~next~0_24))))) (forall ((aux_mod_v_~first~0_193_46 Int)) (or (<= 4294967296 aux_mod_v_~first~0_193_46) (forall ((|~#buffer~0.offset| Int) (aux_mod_~next~0_24 Int) (v_ArrVal_1365 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse1 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296) (- 4294967296)) .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1365) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_193_46 4294967296) (- 4294967296))) |c_t1Thread1of1ForFork0_~i~0#1|) (<= aux_mod_~next~0_24 2147483647) (<= 4294967296 aux_mod_~next~0_24))) (<= aux_mod_v_~first~0_193_46 2147483647))) (forall ((aux_mod_v_~first~0_193_46 Int)) (or (< aux_mod_v_~first~0_193_46 0) (forall ((|~#buffer~0.offset| Int) (aux_mod_~next~0_24 Int) (v_ArrVal_1365 (Array Int Int))) (or (= |c_t1Thread1of1ForFork0_~i~0#1| (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse1 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296)) .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1365) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_193_46 4294967296)))) (< 2147483647 aux_mod_~next~0_24) (< aux_mod_~next~0_24 0))) (< 2147483647 aux_mod_v_~first~0_193_46))) (forall ((aux_mod_v_~first~0_193_46 Int)) (or (forall ((|~#buffer~0.offset| Int) (aux_mod_~next~0_24 Int) (v_ArrVal_1365 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse1 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296)) .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1365) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_193_46 4294967296) (- 4294967296))) |c_t1Thread1of1ForFork0_~i~0#1|) (< 2147483647 aux_mod_~next~0_24) (< aux_mod_~next~0_24 0))) (<= 4294967296 aux_mod_v_~first~0_193_46) (<= aux_mod_v_~first~0_193_46 2147483647))))) .cse0)))) is different from false [2022-11-20 20:44:34,426 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#buffer~0.base|))) (and (forall ((aux_mod_~next~0_24 Int)) (or (forall ((|~#buffer~0.offset| Int) (aux_mod_v_~first~0_193_46 Int) (v_ArrVal_1365 (Array Int Int))) (or (< aux_mod_v_~first~0_193_46 0) (< 2147483647 aux_mod_v_~first~0_193_46) (= (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296) (- 4294967296)) 0)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1365) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_193_46 4294967296))) 0))) (<= aux_mod_~next~0_24 2147483647) (<= 4294967296 aux_mod_~next~0_24))) (forall ((aux_mod_~next~0_24 Int)) (or (forall ((|~#buffer~0.offset| Int) (aux_mod_v_~first~0_193_46 Int) (v_ArrVal_1365 (Array Int Int))) (or (< aux_mod_v_~first~0_193_46 0) (= (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296)) 0)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1365) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_193_46 4294967296))) 0) (< 2147483647 aux_mod_v_~first~0_193_46))) (< 2147483647 aux_mod_~next~0_24) (< aux_mod_~next~0_24 0))) (forall ((aux_mod_~next~0_24 Int)) (or (<= aux_mod_~next~0_24 2147483647) (forall ((|~#buffer~0.offset| Int) (aux_mod_v_~first~0_193_46 Int) (v_ArrVal_1365 (Array Int Int))) (or (<= 4294967296 aux_mod_v_~first~0_193_46) (= (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296) (- 4294967296)) 0)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1365) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_193_46 4294967296) (- 4294967296))) 0) (<= aux_mod_v_~first~0_193_46 2147483647))) (<= 4294967296 aux_mod_~next~0_24))) (forall ((aux_mod_~next~0_24 Int)) (or (< 2147483647 aux_mod_~next~0_24) (< aux_mod_~next~0_24 0) (forall ((|~#buffer~0.offset| Int) (aux_mod_v_~first~0_193_46 Int) (v_ArrVal_1365 (Array Int Int))) (or (<= 4294967296 aux_mod_v_~first~0_193_46) (= (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296)) 0)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1365) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_193_46 4294967296) (- 4294967296))) 0) (<= aux_mod_v_~first~0_193_46 2147483647))))))) is different from false [2022-11-20 20:44:34,527 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 23 not checked. [2022-11-20 20:44:34,528 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:44:34,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187865170] [2022-11-20 20:44:34,528 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 20:44:34,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565280221] [2022-11-20 20:44:34,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565280221] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:44:34,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [367618372] [2022-11-20 20:44:34,529 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-20 20:44:34,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:44:34,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 13 [2022-11-20 20:44:34,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307457813] [2022-11-20 20:44:34,531 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:44:34,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-20 20:44:34,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:44:34,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-20 20:44:34,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=78, Unknown=9, NotChecked=84, Total=210 [2022-11-20 20:44:34,533 INFO L87 Difference]: Start difference. First operand 934 states and 2153 transitions. Second operand has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 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-20 20:45:26,897 WARN L233 SmtUtils]: Spent 50.26s on a formula simplification. DAG size of input: 112 DAG size of output: 39 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 20:45:33,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:45:33,239 INFO L93 Difference]: Finished difference Result 1162 states and 2650 transitions. [2022-11-20 20:45:33,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 20:45:33,240 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-20 20:45:33,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:45:33,245 INFO L225 Difference]: With dead ends: 1162 [2022-11-20 20:45:33,245 INFO L226 Difference]: Without dead ends: 1162 [2022-11-20 20:45:33,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 78.3s TimeCoverageRelationStatistics Valid=73, Invalid=140, Unknown=13, NotChecked=116, Total=342 [2022-11-20 20:45:33,246 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 38 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 202 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:45:33,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 37 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 154 Invalid, 0 Unknown, 202 Unchecked, 0.2s Time] [2022-11-20 20:45:33,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2022-11-20 20:45:33,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1082. [2022-11-20 20:45:33,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 1079 states have (on average 2.345690454124189) internal successors, (2531), 1081 states have internal predecessors, (2531), 0 states have call successors, (0), 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-20 20:45:33,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 2531 transitions. [2022-11-20 20:45:33,277 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 2531 transitions. Word has length 31 [2022-11-20 20:45:33,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:45:33,277 INFO L495 AbstractCegarLoop]: Abstraction has 1082 states and 2531 transitions. [2022-11-20 20:45:33,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 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-20 20:45:33,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 2531 transitions. [2022-11-20 20:45:33,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-20 20:45:33,280 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:45:33,280 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:45:33,290 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-11-20 20:45:33,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-20 20:45:33,486 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-20 20:45:33,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:45:33,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1377724860, now seen corresponding path program 1 times [2022-11-20 20:45:33,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:45:33,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979217277] [2022-11-20 20:45:33,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:45:33,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:45:33,513 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 20:45:33,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [61209251] [2022-11-20 20:45:33,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:45:33,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:45:33,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:45:33,515 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:45:33,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-20 20:45:34,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:45:34,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-20 20:45:34,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:45:34,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:45:34,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 12 [2022-11-20 20:45:34,214 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 20:45:34,214 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-20 20:45:34,361 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 52 treesize of output 45 [2022-11-20 20:45:34,857 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 20 treesize of output 22 [2022-11-20 20:45:35,641 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 71 treesize of output 64 [2022-11-20 20:45:36,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-11-20 20:45:36,549 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:45:36,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:46:49,926 WARN L233 SmtUtils]: Spent 44.75s on a formula simplification that was a NOOP. DAG size: 129 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 20:47:41,797 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse74 (mod c_~next~0 4294967296)) (.cse13 (mod (+ c_~first~0 1) 4294967296))) (let ((.cse3 (<= .cse13 2147483647)) (.cse4 (<= .cse74 2147483647))) (let ((.cse0 (+ .cse74 |c_~#buffer~0.offset|)) (.cse1 (not .cse4)) (.cse16 (not .cse3)) (.cse19 (+ |c_~#buffer~0.offset| .cse13))) (or (and (not (<= 4294967296 .cse0)) (or (not (<= 0 .cse0)) .cse1)) (= (mod c_~send~0 256) 0) (let ((.cse10 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (let ((.cse25 (mod .cse10 256))) (let ((.cse2 (<= .cse25 127))) (let ((.cse8 (+ (- 256) .cse25)) (.cse23 (not .cse2)) (.cse7 (+ .cse74 |c_~#buffer~0.offset| (- 4294967296))) (.cse6 (select |c_#memory_int| |c_~#buffer~0.base|)) (.cse9 (+ |c_~#buffer~0.offset| .cse13 (- 4294967296))) (.cse12 (mod (+ c_~next~0 1) 4294967296))) (and (or .cse2 (and (or .cse3 (and (or .cse4 (forall ((aux_mod_aux_mod_~buffer_size~0_31_42 Int) (aux_div_aux_mod_~buffer_size~0_31_42 Int) (v_ArrVal_1469 Int) (v_ArrVal_1470 (Array Int Int))) (let ((.cse5 (mod (mod .cse12 (mod aux_mod_aux_mod_~buffer_size~0_31_42 4294967296)) 4294967296)) (.cse11 (+ (* aux_div_aux_mod_~buffer_size~0_31_42 4294967296) aux_mod_aux_mod_~buffer_size~0_31_42))) (or (not (<= .cse5 2147483647)) (= (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse6 .cse7 v_ArrVal_1469)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1470) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| .cse5) .cse8) .cse9) .cse10) (<= 4294967296 .cse11) (not (< 0 .cse5)) (<= aux_mod_aux_mod_~buffer_size~0_31_42 (mod (mod .cse12 aux_mod_aux_mod_~buffer_size~0_31_42) 4294967296)) (<= .cse11 .cse13) (>= aux_mod_aux_mod_~buffer_size~0_31_42 4294967296))))) (or (forall ((aux_mod_aux_mod_~buffer_size~0_31_42 Int) (aux_div_aux_mod_~buffer_size~0_31_42 Int) (v_ArrVal_1469 Int) (v_ArrVal_1470 (Array Int Int))) (let ((.cse14 (mod (mod .cse12 (mod aux_mod_aux_mod_~buffer_size~0_31_42 4294967296)) 4294967296)) (.cse15 (+ (* aux_div_aux_mod_~buffer_size~0_31_42 4294967296) aux_mod_aux_mod_~buffer_size~0_31_42))) (or (not (<= .cse14 2147483647)) (= .cse10 (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse6 .cse0 v_ArrVal_1469)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1470) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| .cse14) .cse8) .cse9)) (<= 4294967296 .cse15) (<= aux_mod_aux_mod_~buffer_size~0_31_42 (mod (mod .cse12 aux_mod_aux_mod_~buffer_size~0_31_42) 4294967296)) (<= .cse15 .cse13) (>= aux_mod_aux_mod_~buffer_size~0_31_42 4294967296)))) .cse1))) (or .cse16 (and (or (forall ((aux_mod_aux_mod_~buffer_size~0_31_42 Int) (aux_div_aux_mod_~buffer_size~0_31_42 Int) (v_ArrVal_1469 Int) (v_ArrVal_1470 (Array Int Int))) (let ((.cse18 (+ (* aux_div_aux_mod_~buffer_size~0_31_42 4294967296) aux_mod_aux_mod_~buffer_size~0_31_42)) (.cse17 (mod (mod .cse12 (mod aux_mod_aux_mod_~buffer_size~0_31_42 4294967296)) 4294967296))) (or (not (<= .cse17 2147483647)) (<= 4294967296 .cse18) (not (< 0 .cse17)) (<= aux_mod_aux_mod_~buffer_size~0_31_42 (mod (mod .cse12 aux_mod_aux_mod_~buffer_size~0_31_42) 4294967296)) (<= .cse18 .cse13) (= .cse10 (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse6 .cse7 v_ArrVal_1469)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1470) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| .cse17) .cse8) .cse19)) (>= aux_mod_aux_mod_~buffer_size~0_31_42 4294967296)))) .cse4) (or (forall ((aux_mod_aux_mod_~buffer_size~0_31_42 Int) (aux_div_aux_mod_~buffer_size~0_31_42 Int) (v_ArrVal_1469 Int) (v_ArrVal_1470 (Array Int Int))) (let ((.cse20 (mod (mod .cse12 (mod aux_mod_aux_mod_~buffer_size~0_31_42 4294967296)) 4294967296))) (let ((.cse22 (+ (* aux_div_aux_mod_~buffer_size~0_31_42 4294967296) aux_mod_aux_mod_~buffer_size~0_31_42)) (.cse21 (+ |c_~#buffer~0.offset| .cse20))) (or (not (<= .cse20 2147483647)) (= .cse10 (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse6 .cse0 v_ArrVal_1469)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1470) |c_~#buffer~0.base|) .cse21 .cse8) .cse19)) (<= 4294967296 .cse22) (not (< 0 .cse20)) (<= aux_mod_aux_mod_~buffer_size~0_31_42 (mod (mod .cse12 aux_mod_aux_mod_~buffer_size~0_31_42) 4294967296)) (<= .cse22 .cse13) (not (<= 0 .cse21)) (>= aux_mod_aux_mod_~buffer_size~0_31_42 4294967296))))) .cse1))))) (or .cse23 (and (or (and (or (forall ((aux_mod_aux_mod_~buffer_size~0_31_42 Int) (aux_div_aux_mod_~buffer_size~0_31_42 Int) (v_ArrVal_1469 Int) (v_ArrVal_1470 (Array Int Int))) (let ((.cse24 (mod (mod .cse12 (mod aux_mod_aux_mod_~buffer_size~0_31_42 4294967296)) 4294967296)) (.cse26 (+ (* aux_div_aux_mod_~buffer_size~0_31_42 4294967296) aux_mod_aux_mod_~buffer_size~0_31_42))) (or (= .cse10 (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse6 .cse0 v_ArrVal_1469)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1470) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| .cse24 (- 4294967296)) .cse25) .cse9)) (<= 4294967296 aux_mod_aux_mod_~buffer_size~0_31_42) (< aux_mod_aux_mod_~buffer_size~0_31_42 0) (<= .cse24 2147483647) (<= 4294967296 .cse26) (< (+ |c_~#buffer~0.offset| .cse24) 4294967296) (<= .cse26 .cse13)))) .cse1) (or .cse4 (forall ((aux_mod_aux_mod_~buffer_size~0_31_42 Int) (aux_div_aux_mod_~buffer_size~0_31_42 Int) (v_ArrVal_1469 Int) (v_ArrVal_1470 (Array Int Int))) (let ((.cse28 (+ (* aux_div_aux_mod_~buffer_size~0_31_42 4294967296) aux_mod_aux_mod_~buffer_size~0_31_42)) (.cse27 (mod (mod .cse12 (mod aux_mod_aux_mod_~buffer_size~0_31_42 4294967296)) 4294967296))) (or (<= 4294967296 aux_mod_aux_mod_~buffer_size~0_31_42) (< aux_mod_aux_mod_~buffer_size~0_31_42 0) (<= .cse27 2147483647) (<= 4294967296 .cse28) (<= .cse28 .cse13) (= .cse10 (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse6 .cse7 v_ArrVal_1469)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1470) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| .cse27 (- 4294967296)) .cse25) .cse9))))))) .cse3) (or .cse16 (and (or (forall ((aux_mod_aux_mod_~buffer_size~0_31_42 Int) (aux_div_aux_mod_~buffer_size~0_31_42 Int) (v_ArrVal_1469 Int) (v_ArrVal_1470 (Array Int Int))) (let ((.cse30 (mod (mod .cse12 (mod aux_mod_aux_mod_~buffer_size~0_31_42 4294967296)) 4294967296))) (let ((.cse29 (+ |c_~#buffer~0.offset| .cse30)) (.cse31 (+ (* aux_div_aux_mod_~buffer_size~0_31_42 4294967296) aux_mod_aux_mod_~buffer_size~0_31_42))) (or (= (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse6 .cse0 v_ArrVal_1469)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1470) |c_~#buffer~0.base|) .cse29 .cse25) .cse19) .cse10) (not (<= .cse30 2147483647)) (not (<= 4294967296 .cse29)) (<= 4294967296 aux_mod_aux_mod_~buffer_size~0_31_42) (< aux_mod_aux_mod_~buffer_size~0_31_42 0) (<= 4294967296 .cse31) (not (< 0 .cse30)) (<= .cse31 .cse13))))) .cse1) (or (forall ((aux_mod_aux_mod_~buffer_size~0_31_42 Int) (aux_div_aux_mod_~buffer_size~0_31_42 Int) (v_ArrVal_1469 Int) (v_ArrVal_1470 (Array Int Int))) (let ((.cse33 (mod (mod .cse12 (mod aux_mod_aux_mod_~buffer_size~0_31_42 4294967296)) 4294967296))) (let ((.cse32 (+ |c_~#buffer~0.offset| .cse33)) (.cse34 (+ (* aux_div_aux_mod_~buffer_size~0_31_42 4294967296) aux_mod_aux_mod_~buffer_size~0_31_42))) (or (= (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse6 .cse7 v_ArrVal_1469)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1470) |c_~#buffer~0.base|) .cse32 .cse25) .cse19) .cse10) (not (<= .cse33 2147483647)) (not (<= 4294967296 .cse32)) (<= 4294967296 aux_mod_aux_mod_~buffer_size~0_31_42) (< aux_mod_aux_mod_~buffer_size~0_31_42 0) (<= 4294967296 .cse34) (not (< 0 .cse33)) (<= .cse34 .cse13))))) .cse4))) (or (and (or (forall ((aux_mod_aux_mod_~buffer_size~0_31_42 Int) (aux_div_aux_mod_~buffer_size~0_31_42 Int) (v_ArrVal_1469 Int) (v_ArrVal_1470 (Array Int Int))) (let ((.cse35 (mod (mod .cse12 (mod aux_mod_aux_mod_~buffer_size~0_31_42 4294967296)) 4294967296))) (let ((.cse37 (+ (* aux_div_aux_mod_~buffer_size~0_31_42 4294967296) aux_mod_aux_mod_~buffer_size~0_31_42)) (.cse36 (+ |c_~#buffer~0.offset| .cse35))) (or (not (<= .cse35 2147483647)) (not (<= 4294967296 .cse36)) (<= 4294967296 aux_mod_aux_mod_~buffer_size~0_31_42) (< aux_mod_aux_mod_~buffer_size~0_31_42 0) (<= 4294967296 .cse37) (not (< 0 .cse35)) (<= .cse37 .cse13) (= (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse6 .cse7 v_ArrVal_1469)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1470) |c_~#buffer~0.base|) .cse36 .cse25) .cse9) .cse10))))) .cse4) (or (forall ((aux_mod_aux_mod_~buffer_size~0_31_42 Int) (aux_div_aux_mod_~buffer_size~0_31_42 Int) (v_ArrVal_1469 Int) (v_ArrVal_1470 (Array Int Int))) (let ((.cse38 (mod (mod .cse12 (mod aux_mod_aux_mod_~buffer_size~0_31_42 4294967296)) 4294967296))) (let ((.cse40 (+ (* aux_div_aux_mod_~buffer_size~0_31_42 4294967296) aux_mod_aux_mod_~buffer_size~0_31_42)) (.cse39 (+ |c_~#buffer~0.offset| .cse38))) (or (not (<= .cse38 2147483647)) (not (<= 4294967296 .cse39)) (<= 4294967296 aux_mod_aux_mod_~buffer_size~0_31_42) (< aux_mod_aux_mod_~buffer_size~0_31_42 0) (<= 4294967296 .cse40) (<= .cse40 .cse13) (= .cse10 (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse6 .cse0 v_ArrVal_1469)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1470) |c_~#buffer~0.base|) .cse39 .cse25) .cse9)))))) .cse1)) .cse3) (or .cse16 (and (or .cse4 (forall ((aux_mod_aux_mod_~buffer_size~0_31_42 Int) (aux_div_aux_mod_~buffer_size~0_31_42 Int) (v_ArrVal_1469 Int) (v_ArrVal_1470 (Array Int Int))) (let ((.cse41 (mod (mod .cse12 (mod aux_mod_aux_mod_~buffer_size~0_31_42 4294967296)) 4294967296)) (.cse42 (+ (* aux_div_aux_mod_~buffer_size~0_31_42 4294967296) aux_mod_aux_mod_~buffer_size~0_31_42))) (or (= .cse10 (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse6 .cse7 v_ArrVal_1469)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1470) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| .cse41 (- 4294967296)) .cse25) .cse19)) (<= 4294967296 aux_mod_aux_mod_~buffer_size~0_31_42) (< aux_mod_aux_mod_~buffer_size~0_31_42 0) (<= .cse41 2147483647) (<= 4294967296 .cse42) (<= .cse42 .cse13))))) (or .cse1 (forall ((aux_mod_aux_mod_~buffer_size~0_31_42 Int) (aux_div_aux_mod_~buffer_size~0_31_42 Int) (v_ArrVal_1469 Int) (v_ArrVal_1470 (Array Int Int))) (let ((.cse43 (mod (mod .cse12 (mod aux_mod_aux_mod_~buffer_size~0_31_42 4294967296)) 4294967296)) (.cse44 (+ (* aux_div_aux_mod_~buffer_size~0_31_42 4294967296) aux_mod_aux_mod_~buffer_size~0_31_42))) (or (<= 4294967296 aux_mod_aux_mod_~buffer_size~0_31_42) (< aux_mod_aux_mod_~buffer_size~0_31_42 0) (<= .cse43 2147483647) (<= 4294967296 .cse44) (= (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse6 .cse0 v_ArrVal_1469)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1470) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| .cse43 (- 4294967296)) .cse25) .cse19) .cse10) (< (+ |c_~#buffer~0.offset| .cse43) 4294967296) (<= .cse44 .cse13))))))))) (or .cse2 (and (or (and (or (forall ((aux_mod_aux_mod_~buffer_size~0_31_42 Int) (aux_div_aux_mod_~buffer_size~0_31_42 Int) (v_ArrVal_1469 Int) (v_ArrVal_1470 (Array Int Int))) (let ((.cse45 (mod (mod .cse12 (mod aux_mod_aux_mod_~buffer_size~0_31_42 4294967296)) 4294967296)) (.cse46 (+ (* aux_div_aux_mod_~buffer_size~0_31_42 4294967296) aux_mod_aux_mod_~buffer_size~0_31_42))) (or (<= 4294967296 aux_mod_aux_mod_~buffer_size~0_31_42) (< aux_mod_aux_mod_~buffer_size~0_31_42 0) (<= .cse45 2147483647) (<= 4294967296 .cse46) (= .cse10 (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse6 .cse7 v_ArrVal_1469)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1470) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| .cse45 (- 4294967296)) .cse8) .cse9)) (<= .cse46 .cse13)))) .cse4) (or (forall ((aux_mod_aux_mod_~buffer_size~0_31_42 Int) (aux_div_aux_mod_~buffer_size~0_31_42 Int) (v_ArrVal_1469 Int) (v_ArrVal_1470 (Array Int Int))) (let ((.cse48 (+ (* aux_div_aux_mod_~buffer_size~0_31_42 4294967296) aux_mod_aux_mod_~buffer_size~0_31_42)) (.cse47 (mod (mod .cse12 (mod aux_mod_aux_mod_~buffer_size~0_31_42 4294967296)) 4294967296))) (or (<= 4294967296 aux_mod_aux_mod_~buffer_size~0_31_42) (< aux_mod_aux_mod_~buffer_size~0_31_42 0) (<= .cse47 2147483647) (<= 4294967296 .cse48) (< (+ |c_~#buffer~0.offset| .cse47) 4294967296) (<= .cse48 .cse13) (= .cse10 (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse6 .cse0 v_ArrVal_1469)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1470) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| .cse47 (- 4294967296)) .cse8) .cse9))))) .cse1)) .cse3) (or (and (or (forall ((aux_mod_aux_mod_~buffer_size~0_31_42 Int) (aux_div_aux_mod_~buffer_size~0_31_42 Int) (v_ArrVal_1469 Int) (v_ArrVal_1470 (Array Int Int))) (let ((.cse50 (+ (* aux_div_aux_mod_~buffer_size~0_31_42 4294967296) aux_mod_aux_mod_~buffer_size~0_31_42)) (.cse49 (mod (mod .cse12 (mod aux_mod_aux_mod_~buffer_size~0_31_42 4294967296)) 4294967296))) (or (<= 4294967296 aux_mod_aux_mod_~buffer_size~0_31_42) (< aux_mod_aux_mod_~buffer_size~0_31_42 0) (<= .cse49 2147483647) (<= 4294967296 .cse50) (< (+ |c_~#buffer~0.offset| .cse49) 4294967296) (<= .cse50 .cse13) (= .cse10 (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse6 .cse0 v_ArrVal_1469)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1470) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| .cse49 (- 4294967296)) .cse8) .cse19))))) .cse1) (or .cse4 (forall ((aux_mod_aux_mod_~buffer_size~0_31_42 Int) (aux_div_aux_mod_~buffer_size~0_31_42 Int) (v_ArrVal_1469 Int) (v_ArrVal_1470 (Array Int Int))) (let ((.cse51 (mod (mod .cse12 (mod aux_mod_aux_mod_~buffer_size~0_31_42 4294967296)) 4294967296)) (.cse52 (+ (* aux_div_aux_mod_~buffer_size~0_31_42 4294967296) aux_mod_aux_mod_~buffer_size~0_31_42))) (or (= (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse6 .cse7 v_ArrVal_1469)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1470) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| .cse51 (- 4294967296)) .cse8) .cse19) .cse10) (<= 4294967296 aux_mod_aux_mod_~buffer_size~0_31_42) (< aux_mod_aux_mod_~buffer_size~0_31_42 0) (<= .cse51 2147483647) (<= 4294967296 .cse52) (<= .cse52 .cse13)))))) .cse16) (or (and (or (forall ((aux_mod_aux_mod_~buffer_size~0_31_42 Int) (aux_div_aux_mod_~buffer_size~0_31_42 Int) (v_ArrVal_1469 Int) (v_ArrVal_1470 (Array Int Int))) (let ((.cse53 (mod (mod .cse12 (mod aux_mod_aux_mod_~buffer_size~0_31_42 4294967296)) 4294967296))) (let ((.cse55 (+ (* aux_div_aux_mod_~buffer_size~0_31_42 4294967296) aux_mod_aux_mod_~buffer_size~0_31_42)) (.cse54 (+ |c_~#buffer~0.offset| .cse53))) (or (not (<= .cse53 2147483647)) (not (<= 4294967296 .cse54)) (<= 4294967296 aux_mod_aux_mod_~buffer_size~0_31_42) (< aux_mod_aux_mod_~buffer_size~0_31_42 0) (<= 4294967296 .cse55) (not (< 0 .cse53)) (<= .cse55 .cse13) (= .cse10 (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse6 .cse7 v_ArrVal_1469)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1470) |c_~#buffer~0.base|) .cse54 .cse8) .cse19)))))) .cse4) (or (forall ((aux_mod_aux_mod_~buffer_size~0_31_42 Int) (aux_div_aux_mod_~buffer_size~0_31_42 Int) (v_ArrVal_1469 Int) (v_ArrVal_1470 (Array Int Int))) (let ((.cse56 (mod (mod .cse12 (mod aux_mod_aux_mod_~buffer_size~0_31_42 4294967296)) 4294967296))) (let ((.cse57 (+ |c_~#buffer~0.offset| .cse56)) (.cse58 (+ (* aux_div_aux_mod_~buffer_size~0_31_42 4294967296) aux_mod_aux_mod_~buffer_size~0_31_42))) (or (not (<= .cse56 2147483647)) (not (<= 4294967296 .cse57)) (= .cse10 (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse6 .cse0 v_ArrVal_1469)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1470) |c_~#buffer~0.base|) .cse57 .cse8) .cse19)) (<= 4294967296 aux_mod_aux_mod_~buffer_size~0_31_42) (< aux_mod_aux_mod_~buffer_size~0_31_42 0) (<= 4294967296 .cse58) (not (< 0 .cse56)) (<= .cse58 .cse13))))) .cse1)) .cse16) (or (and (or .cse4 (forall ((aux_mod_aux_mod_~buffer_size~0_31_42 Int) (aux_div_aux_mod_~buffer_size~0_31_42 Int) (v_ArrVal_1469 Int) (v_ArrVal_1470 (Array Int Int))) (let ((.cse59 (mod (mod .cse12 (mod aux_mod_aux_mod_~buffer_size~0_31_42 4294967296)) 4294967296))) (let ((.cse60 (+ |c_~#buffer~0.offset| .cse59)) (.cse61 (+ (* aux_div_aux_mod_~buffer_size~0_31_42 4294967296) aux_mod_aux_mod_~buffer_size~0_31_42))) (or (not (<= .cse59 2147483647)) (not (<= 4294967296 .cse60)) (= (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse6 .cse7 v_ArrVal_1469)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1470) |c_~#buffer~0.base|) .cse60 .cse8) .cse9) .cse10) (<= 4294967296 aux_mod_aux_mod_~buffer_size~0_31_42) (< aux_mod_aux_mod_~buffer_size~0_31_42 0) (<= 4294967296 .cse61) (not (< 0 .cse59)) (<= .cse61 .cse13)))))) (or (forall ((aux_mod_aux_mod_~buffer_size~0_31_42 Int) (aux_div_aux_mod_~buffer_size~0_31_42 Int) (v_ArrVal_1469 Int) (v_ArrVal_1470 (Array Int Int))) (let ((.cse62 (mod (mod .cse12 (mod aux_mod_aux_mod_~buffer_size~0_31_42 4294967296)) 4294967296))) (let ((.cse63 (+ |c_~#buffer~0.offset| .cse62)) (.cse64 (+ (* aux_div_aux_mod_~buffer_size~0_31_42 4294967296) aux_mod_aux_mod_~buffer_size~0_31_42))) (or (not (<= .cse62 2147483647)) (= .cse10 (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse6 .cse0 v_ArrVal_1469)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1470) |c_~#buffer~0.base|) .cse63 .cse8) .cse9)) (not (<= 4294967296 .cse63)) (<= 4294967296 aux_mod_aux_mod_~buffer_size~0_31_42) (< aux_mod_aux_mod_~buffer_size~0_31_42 0) (<= 4294967296 .cse64) (<= .cse64 .cse13))))) .cse1)) .cse3))) (or .cse23 (and (or (and (or .cse1 (forall ((aux_mod_aux_mod_~buffer_size~0_31_42 Int) (aux_div_aux_mod_~buffer_size~0_31_42 Int) (v_ArrVal_1469 Int) (v_ArrVal_1470 (Array Int Int))) (let ((.cse66 (mod (mod .cse12 (mod aux_mod_aux_mod_~buffer_size~0_31_42 4294967296)) 4294967296))) (let ((.cse67 (+ (* aux_div_aux_mod_~buffer_size~0_31_42 4294967296) aux_mod_aux_mod_~buffer_size~0_31_42)) (.cse65 (+ |c_~#buffer~0.offset| .cse66))) (or (= (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse6 .cse0 v_ArrVal_1469)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1470) |c_~#buffer~0.base|) .cse65 .cse25) .cse19) .cse10) (not (<= .cse66 2147483647)) (<= 4294967296 .cse67) (not (< 0 .cse66)) (<= aux_mod_aux_mod_~buffer_size~0_31_42 (mod (mod .cse12 aux_mod_aux_mod_~buffer_size~0_31_42) 4294967296)) (<= .cse67 .cse13) (not (<= 0 .cse65)) (>= aux_mod_aux_mod_~buffer_size~0_31_42 4294967296)))))) (or (forall ((aux_mod_aux_mod_~buffer_size~0_31_42 Int) (aux_div_aux_mod_~buffer_size~0_31_42 Int) (v_ArrVal_1469 Int) (v_ArrVal_1470 (Array Int Int))) (let ((.cse68 (mod (mod .cse12 (mod aux_mod_aux_mod_~buffer_size~0_31_42 4294967296)) 4294967296)) (.cse69 (+ (* aux_div_aux_mod_~buffer_size~0_31_42 4294967296) aux_mod_aux_mod_~buffer_size~0_31_42))) (or (= (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse6 .cse7 v_ArrVal_1469)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1470) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| .cse68) .cse25) .cse19) .cse10) (not (<= .cse68 2147483647)) (<= 4294967296 .cse69) (not (< 0 .cse68)) (<= aux_mod_aux_mod_~buffer_size~0_31_42 (mod (mod .cse12 aux_mod_aux_mod_~buffer_size~0_31_42) 4294967296)) (<= .cse69 .cse13) (>= aux_mod_aux_mod_~buffer_size~0_31_42 4294967296)))) .cse4)) .cse16) (or .cse3 (and (or (forall ((aux_mod_aux_mod_~buffer_size~0_31_42 Int) (aux_div_aux_mod_~buffer_size~0_31_42 Int) (v_ArrVal_1469 Int) (v_ArrVal_1470 (Array Int Int))) (let ((.cse71 (+ (* aux_div_aux_mod_~buffer_size~0_31_42 4294967296) aux_mod_aux_mod_~buffer_size~0_31_42)) (.cse70 (mod (mod .cse12 (mod aux_mod_aux_mod_~buffer_size~0_31_42 4294967296)) 4294967296))) (or (not (<= .cse70 2147483647)) (<= 4294967296 .cse71) (not (< 0 .cse70)) (<= aux_mod_aux_mod_~buffer_size~0_31_42 (mod (mod .cse12 aux_mod_aux_mod_~buffer_size~0_31_42) 4294967296)) (<= .cse71 .cse13) (= (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse6 .cse7 v_ArrVal_1469)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1470) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| .cse70) .cse25) .cse9) .cse10) (>= aux_mod_aux_mod_~buffer_size~0_31_42 4294967296)))) .cse4) (or (forall ((aux_mod_aux_mod_~buffer_size~0_31_42 Int) (aux_div_aux_mod_~buffer_size~0_31_42 Int) (v_ArrVal_1469 Int) (v_ArrVal_1470 (Array Int Int))) (let ((.cse73 (+ (* aux_div_aux_mod_~buffer_size~0_31_42 4294967296) aux_mod_aux_mod_~buffer_size~0_31_42)) (.cse72 (mod (mod .cse12 (mod aux_mod_aux_mod_~buffer_size~0_31_42 4294967296)) 4294967296))) (or (not (<= .cse72 2147483647)) (<= 4294967296 .cse73) (<= aux_mod_aux_mod_~buffer_size~0_31_42 (mod (mod .cse12 aux_mod_aux_mod_~buffer_size~0_31_42) 4294967296)) (<= .cse73 .cse13) (= .cse10 (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse6 .cse0 v_ArrVal_1469)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1470) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| .cse72) .cse25) .cse9)) (>= aux_mod_aux_mod_~buffer_size~0_31_42 4294967296)))) .cse1)))))))))) (and (not (<= 4294967296 .cse19)) (or .cse16 (not (<= 0 .cse19)))))))) is different from true [2022-11-20 20:50:05,259 WARN L233 SmtUtils]: Spent 1.37m on a formula simplification. DAG size of input: 147 DAG size of output: 121 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 20:50:16,687 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-20 20:50:16,687 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:50:16,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979217277] [2022-11-20 20:50:16,688 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 20:50:16,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61209251] [2022-11-20 20:50:16,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61209251] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:50:16,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [50841998] [2022-11-20 20:50:16,688 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-20 20:50:16,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:50:16,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2022-11-20 20:50:16,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133886363] [2022-11-20 20:50:16,690 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:50:16,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-20 20:50:16,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:50:16,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-20 20:50:16,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=506, Unknown=9, NotChecked=46, Total=650 [2022-11-20 20:50:16,692 INFO L87 Difference]: Start difference. First operand 1082 states and 2531 transitions. Second operand has 26 states, 25 states have (on average 2.48) internal successors, (62), 25 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:50:30,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:50:30,268 INFO L93 Difference]: Finished difference Result 1161 states and 2701 transitions. [2022-11-20 20:50:30,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-20 20:50:30,269 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.48) internal successors, (62), 25 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-20 20:50:30,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:50:30,276 INFO L225 Difference]: With dead ends: 1161 [2022-11-20 20:50:30,276 INFO L226 Difference]: Without dead ends: 1161 [2022-11-20 20:50:30,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 155.5s TimeCoverageRelationStatistics Valid=218, Invalid=1182, Unknown=10, NotChecked=72, Total=1482 [2022-11-20 20:50:30,278 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 74 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 533 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 20:50:30,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 92 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 172 Invalid, 0 Unknown, 533 Unchecked, 0.7s Time] [2022-11-20 20:50:30,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2022-11-20 20:50:30,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1123. [2022-11-20 20:50:30,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 1120 states have (on average 2.3419642857142855) internal successors, (2623), 1122 states have internal predecessors, (2623), 0 states have call successors, (0), 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-20 20:50:30,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 2623 transitions. [2022-11-20 20:50:30,313 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 2623 transitions. Word has length 31 [2022-11-20 20:50:30,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:50:30,314 INFO L495 AbstractCegarLoop]: Abstraction has 1123 states and 2623 transitions. [2022-11-20 20:50:30,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.48) internal successors, (62), 25 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:50:30,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 2623 transitions. [2022-11-20 20:50:30,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-20 20:50:30,318 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:50:30,318 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:50:30,331 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-20 20:50:30,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-20 20:50:30,526 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-20 20:50:30,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:50:30,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1778330062, now seen corresponding path program 2 times [2022-11-20 20:50:30,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:50:30,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858791776] [2022-11-20 20:50:30,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:50:30,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:50:30,571 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 20:50:30,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1873088673] [2022-11-20 20:50:30,572 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:50:30,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:50:30,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:50:30,574 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:50:30,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-20 20:50:31,691 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 20:50:31,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:50:31,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-20 20:50:31,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:50:31,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:50:31,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:50:31,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:50:31,721 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-20 20:50:33,967 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 70 treesize of output 65 [2022-11-20 20:50:33,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 123 [2022-11-20 20:50:34,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 84 treesize of output 15 [2022-11-20 20:50:34,175 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 59 [2022-11-20 20:50:35,672 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:50:35,675 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 9 [2022-11-20 20:50:35,786 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:50:35,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:50:36,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-20 20:50:36,878 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:50:36,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 76 [2022-11-20 20:50:37,096 INFO L321 Elim1Store]: treesize reduction 50, result has 51.0 percent of original size [2022-11-20 20:50:37,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 129 [2022-11-20 20:50:37,273 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:50:37,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 82 [2022-11-20 20:53:42,575 WARN L233 SmtUtils]: Spent 2.52m on a formula simplification. DAG size of input: 99 DAG size of output: 97 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 20:54:05,298 WARN L233 SmtUtils]: Spent 6.45s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 20:54:07,052 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:54:07,052 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:54:07,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858791776] [2022-11-20 20:54:07,052 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 20:54:07,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873088673] [2022-11-20 20:54:07,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873088673] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:54:07,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [162405339] [2022-11-20 20:54:07,053 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-20 20:54:07,054 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:54:07,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 26 [2022-11-20 20:54:07,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720576597] [2022-11-20 20:54:07,055 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:54:07,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-20 20:54:07,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:54:07,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-20 20:54:07,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=647, Unknown=5, NotChecked=0, Total=756 [2022-11-20 20:54:07,057 INFO L87 Difference]: Start difference. First operand 1123 states and 2623 transitions. Second operand has 28 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 27 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:54:48,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:54:48,652 INFO L93 Difference]: Finished difference Result 1783 states and 3978 transitions. [2022-11-20 20:54:48,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-20 20:54:48,653 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 27 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-20 20:54:48,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:54:48,663 INFO L225 Difference]: With dead ends: 1783 [2022-11-20 20:54:48,663 INFO L226 Difference]: Without dead ends: 1783 [2022-11-20 20:54:48,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 212.0s TimeCoverageRelationStatistics Valid=440, Invalid=3215, Unknown=5, NotChecked=0, Total=3660 [2022-11-20 20:54:48,665 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 396 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 1410 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 2302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 853 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-11-20 20:54:48,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 87 Invalid, 2302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1410 Invalid, 0 Unknown, 853 Unchecked, 7.6s Time] [2022-11-20 20:54:48,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2022-11-20 20:54:48,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1274. [2022-11-20 20:54:48,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 1271 states have (on average 2.3367427222659325) internal successors, (2970), 1273 states have internal predecessors, (2970), 0 states have call successors, (0), 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-20 20:54:48,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 2970 transitions. [2022-11-20 20:54:48,712 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 2970 transitions. Word has length 31 [2022-11-20 20:54:48,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:54:48,712 INFO L495 AbstractCegarLoop]: Abstraction has 1274 states and 2970 transitions. [2022-11-20 20:54:48,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 27 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:54:48,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 2970 transitions. [2022-11-20 20:54:48,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-20 20:54:48,715 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:54:48,715 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:54:48,723 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-11-20 20:54:48,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-20 20:54:48,924 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-20 20:54:48,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:54:48,924 INFO L85 PathProgramCache]: Analyzing trace with hash -169704658, now seen corresponding path program 2 times [2022-11-20 20:54:48,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:54:48,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898292307] [2022-11-20 20:54:48,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:54:48,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:54:48,950 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 20:54:48,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1313266356] [2022-11-20 20:54:48,957 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:54:48,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:54:48,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:54:48,958 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:54:48,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-20 20:54:49,599 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 20:54:49,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:54:49,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-20 20:54:49,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:54:49,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:54:49,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 12 [2022-11-20 20:54:49,642 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 20:54:49,642 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-20 20:54:49,721 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 52 treesize of output 45 [2022-11-20 20:54:49,798 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 13 treesize of output 15 [2022-11-20 20:54:50,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2022-11-20 20:54:50,075 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-20 20:54:50,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:55:06,824 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1697 (Array Int Int)) (aux_mod_v_~first~0_198_46 Int)) (or (= |c_t1Thread1of1ForFork0_~i~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1697) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod aux_mod_v_~first~0_198_46 4294967296) (- 4294967296)))) (<= 4294967296 aux_mod_v_~first~0_198_46) (<= aux_mod_v_~first~0_198_46 2147483647))) (forall ((v_ArrVal_1697 (Array Int Int)) (aux_mod_v_~first~0_198_46 Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1697) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod aux_mod_v_~first~0_198_46 4294967296))) |c_t1Thread1of1ForFork0_~i~0#1|) (< aux_mod_v_~first~0_198_46 0) (< 2147483647 aux_mod_v_~first~0_198_46)))) is different from false [2022-11-20 20:55:07,290 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (mod |c_t1Thread1of1ForFork0_~i~0#1| 256))) (let ((.cse3 (<= .cse2 127)) (.cse0 (select |c_#memory_int| |c_~#buffer~0.base|))) (and (or (let ((.cse1 (+ .cse2 (- 256)))) (and (forall ((aux_mod_v_~first~0_198_46 Int)) (or (<= 4294967296 aux_mod_v_~first~0_198_46) (forall ((|~#buffer~0.offset| Int) (v_ArrVal_1697 (Array Int Int)) (aux_mod_~next~0_24 Int)) (or (= |c_t1Thread1of1ForFork0_~i~0#1| (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296) (- 4294967296)) .cse1)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1697) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_198_46 4294967296) (- 4294967296)))) (<= aux_mod_~next~0_24 2147483647) (<= 4294967296 aux_mod_~next~0_24))) (<= aux_mod_v_~first~0_198_46 2147483647))) (forall ((aux_mod_v_~first~0_198_46 Int)) (or (forall ((|~#buffer~0.offset| Int) (v_ArrVal_1697 (Array Int Int)) (aux_mod_~next~0_24 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296) (- 4294967296)) .cse1)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1697) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_198_46 4294967296))) |c_t1Thread1of1ForFork0_~i~0#1|) (<= aux_mod_~next~0_24 2147483647) (<= 4294967296 aux_mod_~next~0_24))) (< aux_mod_v_~first~0_198_46 0) (< 2147483647 aux_mod_v_~first~0_198_46))) (forall ((aux_mod_v_~first~0_198_46 Int)) (or (forall ((|~#buffer~0.offset| Int) (v_ArrVal_1697 (Array Int Int)) (aux_mod_~next~0_24 Int)) (or (< 2147483647 aux_mod_~next~0_24) (< aux_mod_~next~0_24 0) (= |c_t1Thread1of1ForFork0_~i~0#1| (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296)) .cse1)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1697) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_198_46 4294967296)))))) (< aux_mod_v_~first~0_198_46 0) (< 2147483647 aux_mod_v_~first~0_198_46))) (forall ((aux_mod_v_~first~0_198_46 Int)) (or (forall ((|~#buffer~0.offset| Int) (v_ArrVal_1697 (Array Int Int)) (aux_mod_~next~0_24 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296)) .cse1)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1697) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_198_46 4294967296) (- 4294967296))) |c_t1Thread1of1ForFork0_~i~0#1|) (< 2147483647 aux_mod_~next~0_24) (< aux_mod_~next~0_24 0))) (<= 4294967296 aux_mod_v_~first~0_198_46) (<= aux_mod_v_~first~0_198_46 2147483647))))) .cse3) (or (not .cse3) (and (forall ((aux_mod_v_~first~0_198_46 Int)) (or (forall ((|~#buffer~0.offset| Int) (v_ArrVal_1697 (Array Int Int)) (aux_mod_~next~0_24 Int)) (or (= |c_t1Thread1of1ForFork0_~i~0#1| (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296) (- 4294967296)) .cse2)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1697) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_198_46 4294967296) (- 4294967296)))) (<= aux_mod_~next~0_24 2147483647) (<= 4294967296 aux_mod_~next~0_24))) (<= 4294967296 aux_mod_v_~first~0_198_46) (<= aux_mod_v_~first~0_198_46 2147483647))) (forall ((aux_mod_v_~first~0_198_46 Int)) (or (forall ((|~#buffer~0.offset| Int) (v_ArrVal_1697 (Array Int Int)) (aux_mod_~next~0_24 Int)) (or (= |c_t1Thread1of1ForFork0_~i~0#1| (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296)) .cse2)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1697) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_198_46 4294967296) (- 4294967296)))) (< 2147483647 aux_mod_~next~0_24) (< aux_mod_~next~0_24 0))) (<= 4294967296 aux_mod_v_~first~0_198_46) (<= aux_mod_v_~first~0_198_46 2147483647))) (forall ((aux_mod_v_~first~0_198_46 Int)) (or (forall ((|~#buffer~0.offset| Int) (v_ArrVal_1697 (Array Int Int)) (aux_mod_~next~0_24 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296) (- 4294967296)) .cse2)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1697) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_198_46 4294967296))) |c_t1Thread1of1ForFork0_~i~0#1|) (<= aux_mod_~next~0_24 2147483647) (<= 4294967296 aux_mod_~next~0_24))) (< aux_mod_v_~first~0_198_46 0) (< 2147483647 aux_mod_v_~first~0_198_46))) (forall ((aux_mod_v_~first~0_198_46 Int)) (or (forall ((|~#buffer~0.offset| Int) (v_ArrVal_1697 (Array Int Int)) (aux_mod_~next~0_24 Int)) (or (= |c_t1Thread1of1ForFork0_~i~0#1| (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296)) .cse2)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1697) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_198_46 4294967296)))) (< 2147483647 aux_mod_~next~0_24) (< aux_mod_~next~0_24 0))) (< aux_mod_v_~first~0_198_46 0) (< 2147483647 aux_mod_v_~first~0_198_46)))))))) is different from false [2022-11-20 20:55:07,652 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#buffer~0.base|))) (and (forall ((aux_mod_v_~first~0_198_46 Int)) (or (forall ((|~#buffer~0.offset| Int) (v_ArrVal_1697 (Array Int Int)) (aux_mod_~next~0_24 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296)) 0)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1697) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_198_46 4294967296))) 0) (< 2147483647 aux_mod_~next~0_24) (< aux_mod_~next~0_24 0))) (< aux_mod_v_~first~0_198_46 0) (< 2147483647 aux_mod_v_~first~0_198_46))) (forall ((aux_mod_v_~first~0_198_46 Int)) (or (< aux_mod_v_~first~0_198_46 0) (< 2147483647 aux_mod_v_~first~0_198_46) (forall ((|~#buffer~0.offset| Int) (v_ArrVal_1697 (Array Int Int)) (aux_mod_~next~0_24 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296) (- 4294967296)) 0)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1697) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_198_46 4294967296))) 0) (<= aux_mod_~next~0_24 2147483647) (<= 4294967296 aux_mod_~next~0_24))))) (forall ((aux_mod_v_~first~0_198_46 Int)) (or (<= 4294967296 aux_mod_v_~first~0_198_46) (forall ((|~#buffer~0.offset| Int) (v_ArrVal_1697 (Array Int Int)) (aux_mod_~next~0_24 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296) (- 4294967296)) 0)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1697) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_198_46 4294967296) (- 4294967296))) 0) (<= aux_mod_~next~0_24 2147483647) (<= 4294967296 aux_mod_~next~0_24))) (<= aux_mod_v_~first~0_198_46 2147483647))) (forall ((aux_mod_v_~first~0_198_46 Int)) (or (<= 4294967296 aux_mod_v_~first~0_198_46) (forall ((|~#buffer~0.offset| Int) (v_ArrVal_1697 (Array Int Int)) (aux_mod_~next~0_24 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296)) 0)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1697) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_198_46 4294967296) (- 4294967296))) 0) (< 2147483647 aux_mod_~next~0_24) (< aux_mod_~next~0_24 0))) (<= aux_mod_v_~first~0_198_46 2147483647))))) is different from false [2022-11-20 20:55:07,741 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 7 not checked. [2022-11-20 20:55:07,741 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:55:07,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898292307] [2022-11-20 20:55:07,741 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 20:55:07,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313266356] [2022-11-20 20:55:07,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313266356] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:55:07,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1405333558] [2022-11-20 20:55:07,742 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-20 20:55:07,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:55:07,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2022-11-20 20:55:07,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556949904] [2022-11-20 20:55:07,744 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:55:07,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 20:55:07,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:55:07,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 20:55:07,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=63, Unknown=10, NotChecked=54, Total=156 [2022-11-20 20:55:07,746 INFO L87 Difference]: Start difference. First operand 1274 states and 2970 transitions. Second operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 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-20 20:55:12,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:55:12,094 INFO L93 Difference]: Finished difference Result 1682 states and 3879 transitions. [2022-11-20 20:55:12,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 20:55:12,095 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-20 20:55:12,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:55:12,103 INFO L225 Difference]: With dead ends: 1682 [2022-11-20 20:55:12,104 INFO L226 Difference]: Without dead ends: 1682 [2022-11-20 20:55:12,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=12, NotChecked=72, Total=240 [2022-11-20 20:55:12,104 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 63 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 337 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:55:12,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 32 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 337 Unchecked, 0.2s Time] [2022-11-20 20:55:12,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2022-11-20 20:55:12,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1316. [2022-11-20 20:55:12,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 1313 states have (on average 2.33968012185834) internal successors, (3072), 1315 states have internal predecessors, (3072), 0 states have call successors, (0), 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-20 20:55:12,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 3072 transitions. [2022-11-20 20:55:12,144 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 3072 transitions. Word has length 31 [2022-11-20 20:55:12,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:55:12,144 INFO L495 AbstractCegarLoop]: Abstraction has 1316 states and 3072 transitions. [2022-11-20 20:55:12,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 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-20 20:55:12,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 3072 transitions. [2022-11-20 20:55:12,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-20 20:55:12,147 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:55:12,147 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:55:12,159 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-11-20 20:55:12,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-20 20:55:12,359 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-20 20:55:12,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:55:12,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1608207202, now seen corresponding path program 3 times [2022-11-20 20:55:12,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:55:12,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464978407] [2022-11-20 20:55:12,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:55:12,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:55:12,377 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 20:55:12,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [485585208] [2022-11-20 20:55:12,378 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 20:55:12,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:55:12,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:55:12,379 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:55:12,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-20 20:55:12,625 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 20:55:12,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:55:12,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-20 20:55:12,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:55:12,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:55:12,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 12 [2022-11-20 20:55:12,661 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 20:55:12,661 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-20 20:55:12,726 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 52 treesize of output 45 [2022-11-20 20:55:12,803 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 13 treesize of output 15 [2022-11-20 20:55:13,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2022-11-20 20:55:13,133 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 20:55:13,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:55:33,956 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1820 (Array Int Int)) (aux_mod_v_~first~0_199_46 Int)) (or (< aux_mod_v_~first~0_199_46 0) (< 2147483647 aux_mod_v_~first~0_199_46) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1820) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod aux_mod_v_~first~0_199_46 4294967296))) |c_t1Thread1of1ForFork0_~i~0#1|))) (forall ((v_ArrVal_1820 (Array Int Int)) (aux_mod_v_~first~0_199_46 Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1820) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod aux_mod_v_~first~0_199_46 4294967296) (- 4294967296))) |c_t1Thread1of1ForFork0_~i~0#1|) (<= 4294967296 aux_mod_v_~first~0_199_46) (<= aux_mod_v_~first~0_199_46 2147483647)))) is different from false [2022-11-20 20:55:34,395 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (mod |c_t1Thread1of1ForFork0_~i~0#1| 256))) (let ((.cse2 (<= .cse1 127)) (.cse0 (select |c_#memory_int| |c_~#buffer~0.base|))) (and (or (and (forall ((aux_mod_~next~0_24 Int)) (or (forall ((|~#buffer~0.offset| Int) (v_ArrVal_1820 (Array Int Int)) (aux_mod_v_~first~0_199_46 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296)) .cse1)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1820) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_199_46 4294967296) (- 4294967296))) |c_t1Thread1of1ForFork0_~i~0#1|) (<= 4294967296 aux_mod_v_~first~0_199_46) (<= aux_mod_v_~first~0_199_46 2147483647))) (< 2147483647 aux_mod_~next~0_24) (< aux_mod_~next~0_24 0))) (forall ((aux_mod_~next~0_24 Int)) (or (forall ((|~#buffer~0.offset| Int) (v_ArrVal_1820 (Array Int Int)) (aux_mod_v_~first~0_199_46 Int)) (or (< aux_mod_v_~first~0_199_46 0) (< 2147483647 aux_mod_v_~first~0_199_46) (= |c_t1Thread1of1ForFork0_~i~0#1| (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296)) .cse1)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1820) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_199_46 4294967296)))))) (< 2147483647 aux_mod_~next~0_24) (< aux_mod_~next~0_24 0))) (forall ((aux_mod_~next~0_24 Int)) (or (<= aux_mod_~next~0_24 2147483647) (forall ((|~#buffer~0.offset| Int) (v_ArrVal_1820 (Array Int Int)) (aux_mod_v_~first~0_199_46 Int)) (or (< aux_mod_v_~first~0_199_46 0) (< 2147483647 aux_mod_v_~first~0_199_46) (= |c_t1Thread1of1ForFork0_~i~0#1| (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296) (- 4294967296)) .cse1)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1820) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_199_46 4294967296)))))) (<= 4294967296 aux_mod_~next~0_24))) (forall ((aux_mod_~next~0_24 Int)) (or (forall ((|~#buffer~0.offset| Int) (v_ArrVal_1820 (Array Int Int)) (aux_mod_v_~first~0_199_46 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296) (- 4294967296)) .cse1)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1820) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_199_46 4294967296) (- 4294967296))) |c_t1Thread1of1ForFork0_~i~0#1|) (<= 4294967296 aux_mod_v_~first~0_199_46) (<= aux_mod_v_~first~0_199_46 2147483647))) (<= aux_mod_~next~0_24 2147483647) (<= 4294967296 aux_mod_~next~0_24)))) (not .cse2)) (or .cse2 (let ((.cse3 (+ .cse1 (- 256)))) (and (forall ((aux_mod_~next~0_24 Int)) (or (<= aux_mod_~next~0_24 2147483647) (forall ((|~#buffer~0.offset| Int) (v_ArrVal_1820 (Array Int Int)) (aux_mod_v_~first~0_199_46 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296) (- 4294967296)) .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1820) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_199_46 4294967296))) |c_t1Thread1of1ForFork0_~i~0#1|) (< aux_mod_v_~first~0_199_46 0) (< 2147483647 aux_mod_v_~first~0_199_46))) (<= 4294967296 aux_mod_~next~0_24))) (forall ((aux_mod_~next~0_24 Int)) (or (<= aux_mod_~next~0_24 2147483647) (forall ((|~#buffer~0.offset| Int) (v_ArrVal_1820 (Array Int Int)) (aux_mod_v_~first~0_199_46 Int)) (or (<= 4294967296 aux_mod_v_~first~0_199_46) (= (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296) (- 4294967296)) .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1820) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_199_46 4294967296) (- 4294967296))) |c_t1Thread1of1ForFork0_~i~0#1|) (<= aux_mod_v_~first~0_199_46 2147483647))) (<= 4294967296 aux_mod_~next~0_24))) (forall ((aux_mod_~next~0_24 Int)) (or (< 2147483647 aux_mod_~next~0_24) (forall ((|~#buffer~0.offset| Int) (v_ArrVal_1820 (Array Int Int)) (aux_mod_v_~first~0_199_46 Int)) (or (<= 4294967296 aux_mod_v_~first~0_199_46) (<= aux_mod_v_~first~0_199_46 2147483647) (= |c_t1Thread1of1ForFork0_~i~0#1| (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296)) .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1820) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_199_46 4294967296) (- 4294967296)))))) (< aux_mod_~next~0_24 0))) (forall ((aux_mod_~next~0_24 Int)) (or (forall ((|~#buffer~0.offset| Int) (v_ArrVal_1820 (Array Int Int)) (aux_mod_v_~first~0_199_46 Int)) (or (< aux_mod_v_~first~0_199_46 0) (< 2147483647 aux_mod_v_~first~0_199_46) (= |c_t1Thread1of1ForFork0_~i~0#1| (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296)) .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1820) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_199_46 4294967296)))))) (< 2147483647 aux_mod_~next~0_24) (< aux_mod_~next~0_24 0))))))))) is different from false [2022-11-20 20:55:34,743 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#buffer~0.base|))) (and (forall ((aux_mod_~next~0_24 Int)) (or (< 2147483647 aux_mod_~next~0_24) (forall ((|~#buffer~0.offset| Int) (v_ArrVal_1820 (Array Int Int)) (aux_mod_v_~first~0_199_46 Int)) (or (<= 4294967296 aux_mod_v_~first~0_199_46) (= (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296)) 0)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1820) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_199_46 4294967296) (- 4294967296))) 0) (<= aux_mod_v_~first~0_199_46 2147483647))) (< aux_mod_~next~0_24 0))) (forall ((aux_mod_~next~0_24 Int)) (or (forall ((|~#buffer~0.offset| Int) (v_ArrVal_1820 (Array Int Int)) (aux_mod_v_~first~0_199_46 Int)) (or (< aux_mod_v_~first~0_199_46 0) (< 2147483647 aux_mod_v_~first~0_199_46) (= (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296) (- 4294967296)) 0)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1820) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_199_46 4294967296))) 0))) (<= aux_mod_~next~0_24 2147483647) (<= 4294967296 aux_mod_~next~0_24))) (forall ((aux_mod_~next~0_24 Int)) (or (forall ((|~#buffer~0.offset| Int) (v_ArrVal_1820 (Array Int Int)) (aux_mod_v_~first~0_199_46 Int)) (or (< aux_mod_v_~first~0_199_46 0) (< 2147483647 aux_mod_v_~first~0_199_46) (= (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296)) 0)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1820) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_199_46 4294967296))) 0))) (< 2147483647 aux_mod_~next~0_24) (< aux_mod_~next~0_24 0))) (forall ((aux_mod_~next~0_24 Int)) (or (forall ((|~#buffer~0.offset| Int) (v_ArrVal_1820 (Array Int Int)) (aux_mod_v_~first~0_199_46 Int)) (or (<= 4294967296 aux_mod_v_~first~0_199_46) (= (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296) (- 4294967296)) 0)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1820) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_199_46 4294967296) (- 4294967296))) 0) (<= aux_mod_v_~first~0_199_46 2147483647))) (<= aux_mod_~next~0_24 2147483647) (<= 4294967296 aux_mod_~next~0_24))))) is different from false [2022-11-20 20:55:34,838 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 7 not checked. [2022-11-20 20:55:34,839 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:55:34,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464978407] [2022-11-20 20:55:34,839 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 20:55:34,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485585208] [2022-11-20 20:55:34,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485585208] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:55:34,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [80288614] [2022-11-20 20:55:34,840 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-20 20:55:34,841 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:55:34,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 13 [2022-11-20 20:55:34,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381014738] [2022-11-20 20:55:34,841 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:55:34,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-20 20:55:34,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:55:34,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-20 20:55:34,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=95, Unknown=11, NotChecked=66, Total=210 [2022-11-20 20:55:34,843 INFO L87 Difference]: Start difference. First operand 1316 states and 3072 transitions. Second operand has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 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-20 20:55:47,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:55:47,372 INFO L93 Difference]: Finished difference Result 1868 states and 4264 transitions. [2022-11-20 20:55:47,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 20:55:47,373 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-20 20:55:47,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:55:47,380 INFO L225 Difference]: With dead ends: 1868 [2022-11-20 20:55:47,380 INFO L226 Difference]: Without dead ends: 1868 [2022-11-20 20:55:47,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 32.7s TimeCoverageRelationStatistics Valid=86, Invalid=183, Unknown=15, NotChecked=96, Total=380 [2022-11-20 20:55:47,381 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 91 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 405 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:55:47,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 35 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 111 Invalid, 0 Unknown, 405 Unchecked, 0.2s Time] [2022-11-20 20:55:47,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868 states. [2022-11-20 20:55:47,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868 to 1339. [2022-11-20 20:55:47,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1339 states, 1336 states have (on average 2.3577844311377247) internal successors, (3150), 1338 states have internal predecessors, (3150), 0 states have call successors, (0), 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-20 20:55:47,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 3150 transitions. [2022-11-20 20:55:47,426 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 3150 transitions. Word has length 31 [2022-11-20 20:55:47,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:55:47,426 INFO L495 AbstractCegarLoop]: Abstraction has 1339 states and 3150 transitions. [2022-11-20 20:55:47,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 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-20 20:55:47,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 3150 transitions. [2022-11-20 20:55:47,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-20 20:55:47,429 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:55:47,429 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:55:47,439 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-20 20:55:47,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-20 20:55:47,636 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-20 20:55:47,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:55:47,636 INFO L85 PathProgramCache]: Analyzing trace with hash -185439744, now seen corresponding path program 1 times [2022-11-20 20:55:47,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:55:47,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495824118] [2022-11-20 20:55:47,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:55:47,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:55:47,657 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 20:55:47,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [364039027] [2022-11-20 20:55:47,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:55:47,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:55:47,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:55:47,659 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:55:47,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-20 20:55:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:55:47,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-20 20:55:47,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:55:47,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:55:47,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 12 [2022-11-20 20:55:47,921 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 20:55:47,922 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-20 20:55:47,988 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 52 treesize of output 45 [2022-11-20 20:55:48,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 13 treesize of output 15 [2022-11-20 20:55:48,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2022-11-20 20:55:48,332 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-20 20:55:48,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:56:11,098 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1943 (Array Int Int)) (aux_mod_v_~first~0_200_46 Int)) (or (<= 4294967296 aux_mod_v_~first~0_200_46) (<= aux_mod_v_~first~0_200_46 2147483647) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1943) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod aux_mod_v_~first~0_200_46 4294967296) (- 4294967296))) |c_t1Thread1of1ForFork0_~i~0#1|))) (forall ((v_ArrVal_1943 (Array Int Int)) (aux_mod_v_~first~0_200_46 Int)) (or (< aux_mod_v_~first~0_200_46 0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1943) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod aux_mod_v_~first~0_200_46 4294967296))) |c_t1Thread1of1ForFork0_~i~0#1|) (< 2147483647 aux_mod_v_~first~0_200_46)))) is different from false [2022-11-20 20:56:11,527 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (mod |c_t1Thread1of1ForFork0_~i~0#1| 256))) (let ((.cse3 (<= .cse2 127)) (.cse0 (select |c_#memory_int| |c_~#buffer~0.base|))) (and (or (let ((.cse1 (+ .cse2 (- 256)))) (and (forall ((aux_mod_v_~first~0_200_46 Int)) (or (<= 4294967296 aux_mod_v_~first~0_200_46) (<= aux_mod_v_~first~0_200_46 2147483647) (forall ((v_ArrVal_1943 (Array Int Int)) (|~#buffer~0.offset| Int) (aux_mod_~next~0_24 Int)) (or (= |c_t1Thread1of1ForFork0_~i~0#1| (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296) (- 4294967296)) .cse1)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1943) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_200_46 4294967296) (- 4294967296)))) (<= aux_mod_~next~0_24 2147483647) (<= 4294967296 aux_mod_~next~0_24))))) (forall ((aux_mod_v_~first~0_200_46 Int)) (or (< aux_mod_v_~first~0_200_46 0) (forall ((v_ArrVal_1943 (Array Int Int)) (|~#buffer~0.offset| Int) (aux_mod_~next~0_24 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296) (- 4294967296)) .cse1)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1943) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_200_46 4294967296))) |c_t1Thread1of1ForFork0_~i~0#1|) (<= aux_mod_~next~0_24 2147483647) (<= 4294967296 aux_mod_~next~0_24))) (< 2147483647 aux_mod_v_~first~0_200_46))) (forall ((aux_mod_v_~first~0_200_46 Int)) (or (<= 4294967296 aux_mod_v_~first~0_200_46) (forall ((v_ArrVal_1943 (Array Int Int)) (|~#buffer~0.offset| Int) (aux_mod_~next~0_24 Int)) (or (= |c_t1Thread1of1ForFork0_~i~0#1| (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296)) .cse1)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1943) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_200_46 4294967296) (- 4294967296)))) (< 2147483647 aux_mod_~next~0_24) (< aux_mod_~next~0_24 0))) (<= aux_mod_v_~first~0_200_46 2147483647))) (forall ((aux_mod_v_~first~0_200_46 Int)) (or (< aux_mod_v_~first~0_200_46 0) (forall ((v_ArrVal_1943 (Array Int Int)) (|~#buffer~0.offset| Int) (aux_mod_~next~0_24 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296)) .cse1)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1943) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_200_46 4294967296))) |c_t1Thread1of1ForFork0_~i~0#1|) (< 2147483647 aux_mod_~next~0_24) (< aux_mod_~next~0_24 0))) (< 2147483647 aux_mod_v_~first~0_200_46))))) .cse3) (or (not .cse3) (and (forall ((aux_mod_v_~first~0_200_46 Int)) (or (< aux_mod_v_~first~0_200_46 0) (forall ((v_ArrVal_1943 (Array Int Int)) (|~#buffer~0.offset| Int) (aux_mod_~next~0_24 Int)) (or (= |c_t1Thread1of1ForFork0_~i~0#1| (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296)) .cse2)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1943) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_200_46 4294967296)))) (< 2147483647 aux_mod_~next~0_24) (< aux_mod_~next~0_24 0))) (< 2147483647 aux_mod_v_~first~0_200_46))) (forall ((aux_mod_v_~first~0_200_46 Int)) (or (<= 4294967296 aux_mod_v_~first~0_200_46) (forall ((v_ArrVal_1943 (Array Int Int)) (|~#buffer~0.offset| Int) (aux_mod_~next~0_24 Int)) (or (<= aux_mod_~next~0_24 2147483647) (= |c_t1Thread1of1ForFork0_~i~0#1| (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296) (- 4294967296)) .cse2)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1943) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_200_46 4294967296) (- 4294967296)))) (<= 4294967296 aux_mod_~next~0_24))) (<= aux_mod_v_~first~0_200_46 2147483647))) (forall ((aux_mod_v_~first~0_200_46 Int)) (or (<= 4294967296 aux_mod_v_~first~0_200_46) (<= aux_mod_v_~first~0_200_46 2147483647) (forall ((v_ArrVal_1943 (Array Int Int)) (|~#buffer~0.offset| Int) (aux_mod_~next~0_24 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296)) .cse2)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1943) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_200_46 4294967296) (- 4294967296))) |c_t1Thread1of1ForFork0_~i~0#1|) (< 2147483647 aux_mod_~next~0_24) (< aux_mod_~next~0_24 0))))) (forall ((aux_mod_v_~first~0_200_46 Int)) (or (< aux_mod_v_~first~0_200_46 0) (forall ((v_ArrVal_1943 (Array Int Int)) (|~#buffer~0.offset| Int) (aux_mod_~next~0_24 Int)) (or (<= aux_mod_~next~0_24 2147483647) (= |c_t1Thread1of1ForFork0_~i~0#1| (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296) (- 4294967296)) .cse2)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1943) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_200_46 4294967296)))) (<= 4294967296 aux_mod_~next~0_24))) (< 2147483647 aux_mod_v_~first~0_200_46)))))))) is different from false [2022-11-20 20:56:11,840 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#buffer~0.base|))) (and (forall ((aux_mod_v_~first~0_200_46 Int)) (or (<= 4294967296 aux_mod_v_~first~0_200_46) (<= aux_mod_v_~first~0_200_46 2147483647) (forall ((v_ArrVal_1943 (Array Int Int)) (|~#buffer~0.offset| Int) (aux_mod_~next~0_24 Int)) (or (<= aux_mod_~next~0_24 2147483647) (= (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296) (- 4294967296)) 0)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1943) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_200_46 4294967296) (- 4294967296))) 0) (<= 4294967296 aux_mod_~next~0_24))))) (forall ((aux_mod_v_~first~0_200_46 Int)) (or (< aux_mod_v_~first~0_200_46 0) (forall ((v_ArrVal_1943 (Array Int Int)) (|~#buffer~0.offset| Int) (aux_mod_~next~0_24 Int)) (or (<= aux_mod_~next~0_24 2147483647) (= (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296) (- 4294967296)) 0)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1943) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_200_46 4294967296))) 0) (<= 4294967296 aux_mod_~next~0_24))) (< 2147483647 aux_mod_v_~first~0_200_46))) (forall ((aux_mod_v_~first~0_200_46 Int)) (or (<= 4294967296 aux_mod_v_~first~0_200_46) (<= aux_mod_v_~first~0_200_46 2147483647) (forall ((v_ArrVal_1943 (Array Int Int)) (|~#buffer~0.offset| Int) (aux_mod_~next~0_24 Int)) (or (< 2147483647 aux_mod_~next~0_24) (= (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296)) 0)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1943) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_200_46 4294967296) (- 4294967296))) 0) (< aux_mod_~next~0_24 0))))) (forall ((aux_mod_v_~first~0_200_46 Int)) (or (< aux_mod_v_~first~0_200_46 0) (forall ((v_ArrVal_1943 (Array Int Int)) (|~#buffer~0.offset| Int) (aux_mod_~next~0_24 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store .cse0 (+ |~#buffer~0.offset| (mod aux_mod_~next~0_24 4294967296)) 0)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1943) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod aux_mod_v_~first~0_200_46 4294967296))) 0) (< 2147483647 aux_mod_~next~0_24) (< aux_mod_~next~0_24 0))) (< 2147483647 aux_mod_v_~first~0_200_46))))) is different from false [2022-11-20 20:56:11,918 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 7 not checked. [2022-11-20 20:56:11,918 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:56:11,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495824118] [2022-11-20 20:56:11,918 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 20:56:11,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364039027] [2022-11-20 20:56:11,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364039027] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:56:11,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1863663410] [2022-11-20 20:56:11,919 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-20 20:56:11,919 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:56:11,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 13 [2022-11-20 20:56:11,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022623879] [2022-11-20 20:56:11,919 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:56:11,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-20 20:56:11,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:56:11,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-20 20:56:11,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=95, Unknown=11, NotChecked=66, Total=210 [2022-11-20 20:56:11,921 INFO L87 Difference]: Start difference. First operand 1339 states and 3150 transitions. Second operand has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 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-20 20:56:20,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:56:20,654 INFO L93 Difference]: Finished difference Result 1392 states and 3241 transitions. [2022-11-20 20:56:20,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 20:56:20,655 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-20 20:56:20,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:56:20,659 INFO L225 Difference]: With dead ends: 1392 [2022-11-20 20:56:20,659 INFO L226 Difference]: Without dead ends: 1392 [2022-11-20 20:56:20,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 30.8s TimeCoverageRelationStatistics Valid=86, Invalid=183, Unknown=15, NotChecked=96, Total=380 [2022-11-20 20:56:20,660 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 70 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 241 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:56:20,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 46 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 207 Invalid, 0 Unknown, 241 Unchecked, 0.2s Time] [2022-11-20 20:56:20,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2022-11-20 20:56:20,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1114. [2022-11-20 20:56:20,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1114 states, 1111 states have (on average 2.3114311431143113) internal successors, (2568), 1113 states have internal predecessors, (2568), 0 states have call successors, (0), 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-20 20:56:20,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 2568 transitions. [2022-11-20 20:56:20,690 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 2568 transitions. Word has length 32 [2022-11-20 20:56:20,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:56:20,690 INFO L495 AbstractCegarLoop]: Abstraction has 1114 states and 2568 transitions. [2022-11-20 20:56:20,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 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-20 20:56:20,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 2568 transitions. [2022-11-20 20:56:20,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-20 20:56:20,692 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:56:20,692 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:56:20,698 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-20 20:56:20,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:56:20,899 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-20 20:56:20,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:56:20,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1891367526, now seen corresponding path program 1 times [2022-11-20 20:56:20,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:56:20,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653925940] [2022-11-20 20:56:20,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:56:20,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:56:20,917 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 20:56:20,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [734482887] [2022-11-20 20:56:20,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:56:20,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:56:20,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:56:20,919 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:56:20,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-20 20:56:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:56:21,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 20:56:21,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:56:21,179 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-11-20 20:56:21,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:56:21,197 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-11-20 20:56:21,197 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:56:21,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653925940] [2022-11-20 20:56:21,197 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 20:56:21,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734482887] [2022-11-20 20:56:21,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734482887] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:56:21,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [147425868] [2022-11-20 20:56:21,198 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-20 20:56:21,198 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:56:21,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-11-20 20:56:21,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409480177] [2022-11-20 20:56:21,199 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:56:21,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 20:56:21,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:56:21,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 20:56:21,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:56:21,200 INFO L87 Difference]: Start difference. First operand 1114 states and 2568 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:56:21,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:56:21,423 INFO L93 Difference]: Finished difference Result 2896 states and 6018 transitions. [2022-11-20 20:56:21,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 20:56:21,424 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-20 20:56:21,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:56:21,430 INFO L225 Difference]: With dead ends: 2896 [2022-11-20 20:56:21,430 INFO L226 Difference]: Without dead ends: 2896 [2022-11-20 20:56:21,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:56:21,432 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 200 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:56:21,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 20 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 20:56:21,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2896 states. [2022-11-20 20:56:21,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2896 to 2888. [2022-11-20 20:56:21,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2888 states, 2885 states have (on average 2.083535528596187) internal successors, (6011), 2887 states have internal predecessors, (6011), 0 states have call successors, (0), 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-20 20:56:21,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2888 states to 2888 states and 6011 transitions. [2022-11-20 20:56:21,505 INFO L78 Accepts]: Start accepts. Automaton has 2888 states and 6011 transitions. Word has length 34 [2022-11-20 20:56:21,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:56:21,505 INFO L495 AbstractCegarLoop]: Abstraction has 2888 states and 6011 transitions. [2022-11-20 20:56:21,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:56:21,505 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 6011 transitions. [2022-11-20 20:56:21,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-20 20:56:21,515 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:56:21,515 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:56:21,524 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-20 20:56:21,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:56:21,723 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-20 20:56:21,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:56:21,723 INFO L85 PathProgramCache]: Analyzing trace with hash -579370107, now seen corresponding path program 2 times [2022-11-20 20:56:21,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:56:21,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285960938] [2022-11-20 20:56:21,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:56:21,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:56:21,744 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 20:56:21,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1694012240] [2022-11-20 20:56:21,745 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:56:21,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:56:21,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:56:21,747 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:56:21,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-20 20:56:22,015 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-20 20:56:22,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:56:22,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 20:56:22,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:56:22,389 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-11-20 20:56:22,389 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:56:22,389 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:56:22,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285960938] [2022-11-20 20:56:22,390 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 20:56:22,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694012240] [2022-11-20 20:56:22,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694012240] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:56:22,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:56:22,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 20:56:22,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520049507] [2022-11-20 20:56:22,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:56:22,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:56:22,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:56:22,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:56:22,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:56:22,392 INFO L87 Difference]: Start difference. First operand 2888 states and 6011 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:56:22,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:56:22,420 INFO L93 Difference]: Finished difference Result 2945 states and 6122 transitions. [2022-11-20 20:56:22,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:56:22,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-11-20 20:56:22,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:56:22,430 INFO L225 Difference]: With dead ends: 2945 [2022-11-20 20:56:22,430 INFO L226 Difference]: Without dead ends: 2898 [2022-11-20 20:56:22,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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-20 20:56:22,431 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 20:56:22,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 26 Unchecked, 0.0s Time] [2022-11-20 20:56:22,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2022-11-20 20:56:22,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2830. [2022-11-20 20:56:22,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2830 states, 2827 states have (on average 2.073222497347011) internal successors, (5861), 2829 states have internal predecessors, (5861), 0 states have call successors, (0), 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-20 20:56:22,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2830 states to 2830 states and 5861 transitions. [2022-11-20 20:56:22,506 INFO L78 Accepts]: Start accepts. Automaton has 2830 states and 5861 transitions. Word has length 40 [2022-11-20 20:56:22,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:56:22,506 INFO L495 AbstractCegarLoop]: Abstraction has 2830 states and 5861 transitions. [2022-11-20 20:56:22,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:56:22,507 INFO L276 IsEmpty]: Start isEmpty. Operand 2830 states and 5861 transitions. [2022-11-20 20:56:22,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-20 20:56:22,513 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:56:22,513 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:56:22,523 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-20 20:56:22,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:56:22,720 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-20 20:56:22,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:56:22,720 INFO L85 PathProgramCache]: Analyzing trace with hash -401139502, now seen corresponding path program 1 times [2022-11-20 20:56:22,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:56:22,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323259297] [2022-11-20 20:56:22,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:56:22,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:56:22,741 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 20:56:22,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1641630056] [2022-11-20 20:56:22,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:56:22,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:56:22,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:56:22,743 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:56:22,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-20 20:56:22,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:56:22,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 20:56:22,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:56:23,044 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-11-20 20:56:23,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:56:23,106 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-11-20 20:56:23,106 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:56:23,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323259297] [2022-11-20 20:56:23,106 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 20:56:23,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641630056] [2022-11-20 20:56:23,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641630056] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:56:23,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [126317674] [2022-11-20 20:56:23,107 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-20 20:56:23,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:56:23,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-11-20 20:56:23,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693311367] [2022-11-20 20:56:23,108 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:56:23,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 20:56:23,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:56:23,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 20:56:23,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-11-20 20:56:23,109 INFO L87 Difference]: Start difference. First operand 2830 states and 5861 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 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-20 20:56:23,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:56:23,441 INFO L93 Difference]: Finished difference Result 5492 states and 11021 transitions. [2022-11-20 20:56:23,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 20:56:23,441 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 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 45 [2022-11-20 20:56:23,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:56:23,456 INFO L225 Difference]: With dead ends: 5492 [2022-11-20 20:56:23,457 INFO L226 Difference]: Without dead ends: 5492 [2022-11-20 20:56:23,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-11-20 20:56:23,458 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 255 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:56:23,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 34 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 20:56:23,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5492 states. [2022-11-20 20:56:23,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5492 to 5392. [2022-11-20 20:56:23,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5392 states, 5389 states have (on average 2.0128038597142326) internal successors, (10847), 5391 states have internal predecessors, (10847), 0 states have call successors, (0), 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-20 20:56:23,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5392 states to 5392 states and 10847 transitions. [2022-11-20 20:56:23,607 INFO L78 Accepts]: Start accepts. Automaton has 5392 states and 10847 transitions. Word has length 45 [2022-11-20 20:56:23,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:56:23,607 INFO L495 AbstractCegarLoop]: Abstraction has 5392 states and 10847 transitions. [2022-11-20 20:56:23,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 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-20 20:56:23,608 INFO L276 IsEmpty]: Start isEmpty. Operand 5392 states and 10847 transitions. [2022-11-20 20:56:23,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-20 20:56:23,618 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:56:23,618 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:56:23,631 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-20 20:56:23,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-20 20:56:23,826 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-20 20:56:23,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:56:23,826 INFO L85 PathProgramCache]: Analyzing trace with hash -51785998, now seen corresponding path program 1 times [2022-11-20 20:56:23,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:56:23,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916068462] [2022-11-20 20:56:23,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:56:23,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:56:23,855 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 20:56:23,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [728575] [2022-11-20 20:56:23,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:56:23,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:56:23,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:56:23,857 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:56:23,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4081eb75-eda3-413d-821d-a52e2c709b9b/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-20 20:56:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:56:24,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 101 conjunts are in the unsatisfiable core [2022-11-20 20:56:24,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:56:24,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:56:24,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:56:24,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:56:24,656 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-20 20:56:24,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:56:24,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 12 [2022-11-20 20:56:24,685 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 20:56:24,685 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-20 20:56:24,863 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 52 treesize of output 45 [2022-11-20 20:56:25,390 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 13 treesize of output 15 [2022-11-20 20:56:25,852 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 52 treesize of output 45 [2022-11-20 20:56:26,690 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 40 treesize of output 33 [2022-11-20 20:56:27,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-11-20 20:56:27,174 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:56:27,174 INFO L328 TraceCheckSpWp]: Computing backward predicates...