./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a 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_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --- 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-38b53e6 [2022-11-25 18:25:31,640 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:25:31,644 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:25:31,693 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:25:31,694 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:25:31,698 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:25:31,701 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:25:31,703 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:25:31,704 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:25:31,706 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:25:31,707 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:25:31,708 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:25:31,709 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:25:31,710 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:25:31,714 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:25:31,719 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:25:31,722 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:25:31,729 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:25:31,732 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:25:31,740 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:25:31,741 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:25:31,745 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:25:31,746 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:25:31,747 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:25:31,751 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:25:31,752 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:25:31,752 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:25:31,753 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:25:31,754 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:25:31,762 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:25:31,762 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:25:31,763 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:25:31,765 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:25:31,766 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:25:31,769 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:25:31,770 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:25:31,771 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:25:31,772 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:25:31,772 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:25:31,774 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:25:31,775 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:25:31,776 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 18:25:31,824 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:25:31,825 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:25:31,826 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:25:31,826 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:25:31,827 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:25:31,827 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:25:31,837 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:25:31,837 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:25:31,837 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:25:31,838 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:25:31,839 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:25:31,839 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 18:25:31,840 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:25:31,840 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:25:31,840 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:25:31,840 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 18:25:31,841 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 18:25:31,841 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 18:25:31,841 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:25:31,842 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 18:25:31,842 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:25:31,842 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:25:31,842 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:25:31,843 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:25:31,843 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:25:31,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:25:31,844 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:25:31,844 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:25:31,845 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:25:31,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:25:31,845 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:25:31,846 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:25:31,846 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:25:31,846 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/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_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R 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 -> Automizer 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 -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2022-11-25 18:25:32,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:25:32,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:25:32,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:25:32,195 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:25:32,195 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:25:32,197 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread/queue_ok_longer.i [2022-11-25 18:25:35,434 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:25:35,776 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:25:35,777 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/sv-benchmarks/c/pthread/queue_ok_longer.i [2022-11-25 18:25:35,798 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/data/429d2d25c/b4244f3fac0c4b49a23ce91a1b1a3d89/FLAG6dbe0d424 [2022-11-25 18:25:35,816 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/data/429d2d25c/b4244f3fac0c4b49a23ce91a1b1a3d89 [2022-11-25 18:25:35,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:25:35,820 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:25:35,822 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:25:35,822 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:25:35,827 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:25:35,828 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:25:35" (1/1) ... [2022-11-25 18:25:35,829 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e3ed787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:35, skipping insertion in model container [2022-11-25 18:25:35,829 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:25:35" (1/1) ... [2022-11-25 18:25:35,838 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:25:35,921 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:25:36,567 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_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-11-25 18:25:36,574 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_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-11-25 18:25:36,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:25:36,594 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:25:36,645 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_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-11-25 18:25:36,649 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_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-11-25 18:25:36,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:25:36,716 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:25:36,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:36 WrapperNode [2022-11-25 18:25:36,716 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:25:36,718 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:25:36,718 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:25:36,718 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:25:36,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:36" (1/1) ... [2022-11-25 18:25:36,754 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:36" (1/1) ... [2022-11-25 18:25:36,820 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 202 [2022-11-25 18:25:36,820 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:25:36,821 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:25:36,821 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:25:36,822 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:25:36,835 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:36" (1/1) ... [2022-11-25 18:25:36,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:36" (1/1) ... [2022-11-25 18:25:36,857 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:36" (1/1) ... [2022-11-25 18:25:36,857 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:36" (1/1) ... [2022-11-25 18:25:36,867 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:36" (1/1) ... [2022-11-25 18:25:36,896 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:36" (1/1) ... [2022-11-25 18:25:36,898 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:36" (1/1) ... [2022-11-25 18:25:36,900 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:36" (1/1) ... [2022-11-25 18:25:36,904 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:25:36,905 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:25:36,905 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:25:36,905 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:25:36,906 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:36" (1/1) ... [2022-11-25 18:25:36,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:25:36,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:25:36,943 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:25:36,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:25:37,003 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-25 18:25:37,004 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-25 18:25:37,004 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-25 18:25:37,005 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-25 18:25:37,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:25:37,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:25:37,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 18:25:37,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 18:25:37,007 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-25 18:25:37,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:25:37,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:25:37,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:25:37,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:25:37,009 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 18:25:37,243 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:25:37,245 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:25:38,024 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:25:38,035 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:25:38,035 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 18:25:38,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:25:38 BoogieIcfgContainer [2022-11-25 18:25:38,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:25:38,042 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:25:38,042 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:25:38,046 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:25:38,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:25:35" (1/3) ... [2022-11-25 18:25:38,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1546d346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:25:38, skipping insertion in model container [2022-11-25 18:25:38,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:36" (2/3) ... [2022-11-25 18:25:38,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1546d346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:25:38, skipping insertion in model container [2022-11-25 18:25:38,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:25:38" (3/3) ... [2022-11-25 18:25:38,050 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2022-11-25 18:25:38,076 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:25:38,120 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2022-11-25 18:25:38,120 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 18:25:38,406 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-25 18:25:38,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 285 places, 291 transitions, 598 flow [2022-11-25 18:25:38,649 INFO L130 PetriNetUnfolder]: 13/289 cut-off events. [2022-11-25 18:25:38,649 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-25 18:25:38,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 289 events. 13/289 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 675 event pairs, 0 based on Foata normal form. 0/215 useless extension candidates. Maximal degree in co-relation 190. Up to 3 conditions per place. [2022-11-25 18:25:38,668 INFO L82 GeneralOperation]: Start removeDead. Operand has 285 places, 291 transitions, 598 flow [2022-11-25 18:25:38,688 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 278 places, 284 transitions, 580 flow [2022-11-25 18:25:38,694 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 18:25:38,712 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 278 places, 284 transitions, 580 flow [2022-11-25 18:25:38,721 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 278 places, 284 transitions, 580 flow [2022-11-25 18:25:38,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 278 places, 284 transitions, 580 flow [2022-11-25 18:25:38,873 INFO L130 PetriNetUnfolder]: 13/284 cut-off events. [2022-11-25 18:25:38,879 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-25 18:25:38,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 284 events. 13/284 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 656 event pairs, 0 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 190. Up to 3 conditions per place. [2022-11-25 18:25:38,896 INFO L119 LiptonReduction]: Number of co-enabled transitions 18694 [2022-11-25 18:25:59,788 INFO L134 LiptonReduction]: Checked pairs total: 57192 [2022-11-25 18:25:59,788 INFO L136 LiptonReduction]: Total number of compositions: 438 [2022-11-25 18:25:59,832 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:25:59,841 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=PETRI_NET, 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;@6919715d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:25:59,842 INFO L358 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2022-11-25 18:25:59,844 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-25 18:25:59,844 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:25:59,846 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:25:59,847 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 18:25:59,847 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-25 18:25:59,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:25:59,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 1 times [2022-11-25 18:25:59,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:25:59,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303865730] [2022-11-25 18:25:59,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:25:59,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:25:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:00,034 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-25 18:26:00,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:26:00,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303865730] [2022-11-25 18:26:00,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303865730] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:26:00,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:26:00,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 18:26:00,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839824552] [2022-11-25 18:26:00,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:26:00,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 18:26:00,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:26:00,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 18:26:00,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 18:26:00,103 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 729 [2022-11-25 18:26:00,112 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 106 transitions, 224 flow. Second operand has 2 states, 2 states have (on average 280.5) internal successors, (561), 2 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:26:00,112 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:26:00,112 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 729 [2022-11-25 18:26:00,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:26:01,402 INFO L130 PetriNetUnfolder]: 4154/6547 cut-off events. [2022-11-25 18:26:01,403 INFO L131 PetriNetUnfolder]: For 93/93 co-relation queries the response was YES. [2022-11-25 18:26:01,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12988 conditions, 6547 events. 4154/6547 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 36984 event pairs, 3633 based on Foata normal form. 0/3163 useless extension candidates. Maximal degree in co-relation 12511. Up to 6369 conditions per place. [2022-11-25 18:26:01,454 INFO L137 encePairwiseOnDemand]: 693/729 looper letters, 64 selfloop transitions, 0 changer transitions 0/70 dead transitions. [2022-11-25 18:26:01,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 70 transitions, 280 flow [2022-11-25 18:26:01,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:26:01,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 18:26:01,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 660 transitions. [2022-11-25 18:26:01,482 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45267489711934156 [2022-11-25 18:26:01,483 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 660 transitions. [2022-11-25 18:26:01,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 660 transitions. [2022-11-25 18:26:01,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:26:01,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 660 transitions. [2022-11-25 18:26:01,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 330.0) internal successors, (660), 2 states have internal predecessors, (660), 0 states have call successors, (0), 0 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-25 18:26:01,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 729.0) internal successors, (2187), 3 states have internal predecessors, (2187), 0 states have call successors, (0), 0 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-25 18:26:01,514 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 729.0) internal successors, (2187), 3 states have internal predecessors, (2187), 0 states have call successors, (0), 0 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-25 18:26:01,517 INFO L175 Difference]: Start difference. First operand has 106 places, 106 transitions, 224 flow. Second operand 2 states and 660 transitions. [2022-11-25 18:26:01,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 70 transitions, 280 flow [2022-11-25 18:26:01,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 70 transitions, 272 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-25 18:26:01,529 INFO L231 Difference]: Finished difference. Result has 67 places, 70 transitions, 144 flow [2022-11-25 18:26:01,532 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=729, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=144, PETRI_PLACES=67, PETRI_TRANSITIONS=70} [2022-11-25 18:26:01,537 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -39 predicate places. [2022-11-25 18:26:01,537 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 70 transitions, 144 flow [2022-11-25 18:26:01,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 280.5) internal successors, (561), 2 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:26:01,538 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:26:01,540 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 18:26:01,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:26:01,541 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-25 18:26:01,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:26:01,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1256455, now seen corresponding path program 1 times [2022-11-25 18:26:01,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:26:01,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089450451] [2022-11-25 18:26:01,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:01,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:26:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:01,925 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-25 18:26:01,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:26:01,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089450451] [2022-11-25 18:26:01,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089450451] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:26:01,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:26:01,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 18:26:01,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475451952] [2022-11-25 18:26:01,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:26:01,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:26:01,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:26:01,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:26:01,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:26:02,151 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 729 [2022-11-25 18:26:02,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 70 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 272.0) internal successors, (816), 3 states have internal predecessors, (816), 0 states have call successors, (0), 0 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-25 18:26:02,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:26:02,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 729 [2022-11-25 18:26:02,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:26:03,126 INFO L130 PetriNetUnfolder]: 4104/6449 cut-off events. [2022-11-25 18:26:03,126 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-11-25 18:26:03,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12746 conditions, 6449 events. 4104/6449 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 36250 event pairs, 3589 based on Foata normal form. 0/3136 useless extension candidates. Maximal degree in co-relation 12743. Up to 6272 conditions per place. [2022-11-25 18:26:03,167 INFO L137 encePairwiseOnDemand]: 725/729 looper letters, 60 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2022-11-25 18:26:03,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 68 transitions, 264 flow [2022-11-25 18:26:03,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:26:03,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:26:03,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 877 transitions. [2022-11-25 18:26:03,171 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.40100594421582075 [2022-11-25 18:26:03,172 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 877 transitions. [2022-11-25 18:26:03,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 877 transitions. [2022-11-25 18:26:03,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:26:03,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 877 transitions. [2022-11-25 18:26:03,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 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-25 18:26:03,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 729.0) internal successors, (2916), 4 states have internal predecessors, (2916), 0 states have call successors, (0), 0 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-25 18:26:03,183 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 729.0) internal successors, (2916), 4 states have internal predecessors, (2916), 0 states have call successors, (0), 0 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-25 18:26:03,183 INFO L175 Difference]: Start difference. First operand has 67 places, 70 transitions, 144 flow. Second operand 3 states and 877 transitions. [2022-11-25 18:26:03,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 68 transitions, 264 flow [2022-11-25 18:26:03,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 68 transitions, 264 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 18:26:03,186 INFO L231 Difference]: Finished difference. Result has 67 places, 68 transitions, 144 flow [2022-11-25 18:26:03,186 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=729, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=67, PETRI_TRANSITIONS=68} [2022-11-25 18:26:03,187 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -39 predicate places. [2022-11-25 18:26:03,187 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 68 transitions, 144 flow [2022-11-25 18:26:03,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 272.0) internal successors, (816), 3 states have internal predecessors, (816), 0 states have call successors, (0), 0 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-25 18:26:03,188 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:26:03,189 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 18:26:03,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:26:03,189 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-25 18:26:03,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:26:03,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1256456, now seen corresponding path program 1 times [2022-11-25 18:26:03,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:26:03,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471073494] [2022-11-25 18:26:03,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:03,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:26:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:03,364 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-25 18:26:03,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:26:03,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471073494] [2022-11-25 18:26:03,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471073494] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:26:03,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:26:03,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 18:26:03,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393755520] [2022-11-25 18:26:03,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:26:03,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:26:03,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:26:03,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:26:03,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:26:03,541 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 729 [2022-11-25 18:26:03,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 68 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 0 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-25 18:26:03,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:26:03,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 729 [2022-11-25 18:26:03,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:26:04,526 INFO L130 PetriNetUnfolder]: 4054/6351 cut-off events. [2022-11-25 18:26:04,528 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-11-25 18:26:04,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12556 conditions, 6351 events. 4054/6351 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 35451 event pairs, 3545 based on Foata normal form. 0/3109 useless extension candidates. Maximal degree in co-relation 12552. Up to 6177 conditions per place. [2022-11-25 18:26:04,584 INFO L137 encePairwiseOnDemand]: 725/729 looper letters, 58 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2022-11-25 18:26:04,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 66 transitions, 260 flow [2022-11-25 18:26:04,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:26:04,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:26:04,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 887 transitions. [2022-11-25 18:26:04,588 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.40557841792409693 [2022-11-25 18:26:04,589 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 887 transitions. [2022-11-25 18:26:04,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 887 transitions. [2022-11-25 18:26:04,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:26:04,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 887 transitions. [2022-11-25 18:26:04,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 295.6666666666667) internal successors, (887), 3 states have internal predecessors, (887), 0 states have call successors, (0), 0 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-25 18:26:04,598 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 729.0) internal successors, (2916), 4 states have internal predecessors, (2916), 0 states have call successors, (0), 0 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-25 18:26:04,600 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 729.0) internal successors, (2916), 4 states have internal predecessors, (2916), 0 states have call successors, (0), 0 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-25 18:26:04,601 INFO L175 Difference]: Start difference. First operand has 67 places, 68 transitions, 144 flow. Second operand 3 states and 887 transitions. [2022-11-25 18:26:04,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 66 transitions, 260 flow [2022-11-25 18:26:04,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 66 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 18:26:04,603 INFO L231 Difference]: Finished difference. Result has 65 places, 66 transitions, 140 flow [2022-11-25 18:26:04,604 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=729, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=65, PETRI_TRANSITIONS=66} [2022-11-25 18:26:04,606 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -41 predicate places. [2022-11-25 18:26:04,606 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 66 transitions, 140 flow [2022-11-25 18:26:04,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 0 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-25 18:26:04,607 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:26:04,608 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 18:26:04,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 18:26:04,608 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-25 18:26:04,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:26:04,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1207418865, now seen corresponding path program 1 times [2022-11-25 18:26:04,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:26:04,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596697945] [2022-11-25 18:26:04,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:04,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:26:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:04,712 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-25 18:26:04,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:26:04,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596697945] [2022-11-25 18:26:04,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596697945] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:26:04,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:26:04,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 18:26:04,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114724211] [2022-11-25 18:26:04,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:26:04,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:26:04,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:26:04,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:26:04,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:26:04,893 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 729 [2022-11-25 18:26:04,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 66 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 278.6666666666667) internal successors, (836), 3 states have internal predecessors, (836), 0 states have call successors, (0), 0 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-25 18:26:04,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:26:04,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 729 [2022-11-25 18:26:04,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:26:05,613 INFO L130 PetriNetUnfolder]: 3580/5607 cut-off events. [2022-11-25 18:26:05,613 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-11-25 18:26:05,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11079 conditions, 5607 events. 3580/5607 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 30461 event pairs, 3103 based on Foata normal form. 0/2879 useless extension candidates. Maximal degree in co-relation 11075. Up to 5445 conditions per place. [2022-11-25 18:26:05,647 INFO L137 encePairwiseOnDemand]: 724/729 looper letters, 55 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2022-11-25 18:26:05,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 63 transitions, 248 flow [2022-11-25 18:26:05,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:26:05,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:26:05,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 891 transitions. [2022-11-25 18:26:05,651 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2022-11-25 18:26:05,651 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 891 transitions. [2022-11-25 18:26:05,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 891 transitions. [2022-11-25 18:26:05,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:26:05,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 891 transitions. [2022-11-25 18:26:05,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 0 states have call successors, (0), 0 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-25 18:26:05,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 729.0) internal successors, (2916), 4 states have internal predecessors, (2916), 0 states have call successors, (0), 0 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-25 18:26:05,662 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 729.0) internal successors, (2916), 4 states have internal predecessors, (2916), 0 states have call successors, (0), 0 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-25 18:26:05,662 INFO L175 Difference]: Start difference. First operand has 65 places, 66 transitions, 140 flow. Second operand 3 states and 891 transitions. [2022-11-25 18:26:05,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 63 transitions, 248 flow [2022-11-25 18:26:05,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 63 transitions, 244 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 18:26:05,664 INFO L231 Difference]: Finished difference. Result has 62 places, 63 transitions, 134 flow [2022-11-25 18:26:05,665 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=729, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=62, PETRI_TRANSITIONS=63} [2022-11-25 18:26:05,665 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -44 predicate places. [2022-11-25 18:26:05,666 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 63 transitions, 134 flow [2022-11-25 18:26:05,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.6666666666667) internal successors, (836), 3 states have internal predecessors, (836), 0 states have call successors, (0), 0 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-25 18:26:05,667 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:26:05,667 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 18:26:05,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 18:26:05,667 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-25 18:26:05,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:26:05,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1207418864, now seen corresponding path program 1 times [2022-11-25 18:26:05,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:26:05,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36031632] [2022-11-25 18:26:05,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:05,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:26:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:05,833 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-25 18:26:05,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:26:05,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36031632] [2022-11-25 18:26:05,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36031632] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:26:05,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:26:05,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 18:26:05,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000037983] [2022-11-25 18:26:05,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:26:05,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:26:05,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:26:05,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:26:05,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:26:06,015 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 729 [2022-11-25 18:26:06,017 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 63 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 278.6666666666667) internal successors, (836), 3 states have internal predecessors, (836), 0 states have call successors, (0), 0 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-25 18:26:06,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:26:06,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 729 [2022-11-25 18:26:06,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:26:06,593 INFO L130 PetriNetUnfolder]: 3002/4701 cut-off events. [2022-11-25 18:26:06,594 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-11-25 18:26:06,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9278 conditions, 4701 events. 3002/4701 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 24549 event pairs, 2565 based on Foata normal form. 0/2585 useless extension candidates. Maximal degree in co-relation 9274. Up to 4552 conditions per place. [2022-11-25 18:26:06,625 INFO L137 encePairwiseOnDemand]: 724/729 looper letters, 52 selfloop transitions, 1 changer transitions 0/59 dead transitions. [2022-11-25 18:26:06,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 59 transitions, 232 flow [2022-11-25 18:26:06,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:26:06,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:26:06,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 888 transitions. [2022-11-25 18:26:06,628 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4060356652949246 [2022-11-25 18:26:06,629 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 888 transitions. [2022-11-25 18:26:06,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 888 transitions. [2022-11-25 18:26:06,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:26:06,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 888 transitions. [2022-11-25 18:26:06,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 296.0) internal successors, (888), 3 states have internal predecessors, (888), 0 states have call successors, (0), 0 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-25 18:26:06,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 729.0) internal successors, (2916), 4 states have internal predecessors, (2916), 0 states have call successors, (0), 0 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-25 18:26:06,639 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 729.0) internal successors, (2916), 4 states have internal predecessors, (2916), 0 states have call successors, (0), 0 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-25 18:26:06,639 INFO L175 Difference]: Start difference. First operand has 62 places, 63 transitions, 134 flow. Second operand 3 states and 888 transitions. [2022-11-25 18:26:06,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 59 transitions, 232 flow [2022-11-25 18:26:06,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 59 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 18:26:06,643 INFO L231 Difference]: Finished difference. Result has 58 places, 59 transitions, 124 flow [2022-11-25 18:26:06,643 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=729, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=58, PETRI_TRANSITIONS=59} [2022-11-25 18:26:06,647 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -48 predicate places. [2022-11-25 18:26:06,648 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 59 transitions, 124 flow [2022-11-25 18:26:06,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.6666666666667) internal successors, (836), 3 states have internal predecessors, (836), 0 states have call successors, (0), 0 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-25 18:26:06,649 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:26:06,649 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 18:26:06,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 18:26:06,649 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-25 18:26:06,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:26:06,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1207418866, now seen corresponding path program 1 times [2022-11-25 18:26:06,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:26:06,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515508406] [2022-11-25 18:26:06,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:06,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:26:06,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:08,045 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-25 18:26:08,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:26:08,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515508406] [2022-11-25 18:26:08,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515508406] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:26:08,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:26:08,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 18:26:08,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495271989] [2022-11-25 18:26:08,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:26:08,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:26:08,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:26:08,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:26:08,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:26:08,156 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 729 [2022-11-25 18:26:08,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 59 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 270.6666666666667) internal successors, (812), 3 states have internal predecessors, (812), 0 states have call successors, (0), 0 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-25 18:26:08,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:26:08,158 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 729 [2022-11-25 18:26:08,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:26:08,863 INFO L130 PetriNetUnfolder]: 3166/4950 cut-off events. [2022-11-25 18:26:08,863 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-11-25 18:26:08,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9779 conditions, 4950 events. 3166/4950 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 25748 event pairs, 2188 based on Foata normal form. 0/2670 useless extension candidates. Maximal degree in co-relation 9775. Up to 4797 conditions per place. [2022-11-25 18:26:08,893 INFO L137 encePairwiseOnDemand]: 724/729 looper letters, 59 selfloop transitions, 4 changer transitions 0/68 dead transitions. [2022-11-25 18:26:08,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 68 transitions, 268 flow [2022-11-25 18:26:08,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:26:08,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:26:08,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 871 transitions. [2022-11-25 18:26:08,898 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3982624599908551 [2022-11-25 18:26:08,898 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 871 transitions. [2022-11-25 18:26:08,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 871 transitions. [2022-11-25 18:26:08,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:26:08,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 871 transitions. [2022-11-25 18:26:08,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 290.3333333333333) internal successors, (871), 3 states have internal predecessors, (871), 0 states have call successors, (0), 0 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-25 18:26:08,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 729.0) internal successors, (2916), 4 states have internal predecessors, (2916), 0 states have call successors, (0), 0 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-25 18:26:08,909 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 729.0) internal successors, (2916), 4 states have internal predecessors, (2916), 0 states have call successors, (0), 0 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-25 18:26:08,909 INFO L175 Difference]: Start difference. First operand has 58 places, 59 transitions, 124 flow. Second operand 3 states and 871 transitions. [2022-11-25 18:26:08,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 68 transitions, 268 flow [2022-11-25 18:26:08,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 68 transitions, 267 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 18:26:08,911 INFO L231 Difference]: Finished difference. Result has 60 places, 62 transitions, 149 flow [2022-11-25 18:26:08,912 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=729, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=149, PETRI_PLACES=60, PETRI_TRANSITIONS=62} [2022-11-25 18:26:08,915 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -46 predicate places. [2022-11-25 18:26:08,916 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 62 transitions, 149 flow [2022-11-25 18:26:08,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 270.6666666666667) internal successors, (812), 3 states have internal predecessors, (812), 0 states have call successors, (0), 0 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-25 18:26:08,917 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:26:08,917 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 18:26:08,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 18:26:08,917 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-25 18:26:08,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:26:08,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1207481450, now seen corresponding path program 1 times [2022-11-25 18:26:08,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:26:08,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53518171] [2022-11-25 18:26:08,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:08,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:26:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:09,021 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-25 18:26:09,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:26:09,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53518171] [2022-11-25 18:26:09,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53518171] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:26:09,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:26:09,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:26:09,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423276932] [2022-11-25 18:26:09,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:26:09,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:26:09,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:26:09,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:26:09,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:26:09,248 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 729 [2022-11-25 18:26:09,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 62 transitions, 149 flow. Second operand has 4 states, 4 states have (on average 268.25) internal successors, (1073), 4 states have internal predecessors, (1073), 0 states have call successors, (0), 0 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-25 18:26:09,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:26:09,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 729 [2022-11-25 18:26:09,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:26:09,743 INFO L130 PetriNetUnfolder]: 2185/3484 cut-off events. [2022-11-25 18:26:09,743 INFO L131 PetriNetUnfolder]: For 165/223 co-relation queries the response was YES. [2022-11-25 18:26:09,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7047 conditions, 3484 events. 2185/3484 cut-off events. For 165/223 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 17680 event pairs, 1837 based on Foata normal form. 0/2141 useless extension candidates. Maximal degree in co-relation 7042. Up to 3369 conditions per place. [2022-11-25 18:26:09,764 INFO L137 encePairwiseOnDemand]: 726/729 looper letters, 52 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2022-11-25 18:26:09,764 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 61 transitions, 255 flow [2022-11-25 18:26:09,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:26:09,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:26:09,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 854 transitions. [2022-11-25 18:26:09,767 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3904892546867855 [2022-11-25 18:26:09,767 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 854 transitions. [2022-11-25 18:26:09,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 854 transitions. [2022-11-25 18:26:09,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:26:09,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 854 transitions. [2022-11-25 18:26:09,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 284.6666666666667) internal successors, (854), 3 states have internal predecessors, (854), 0 states have call successors, (0), 0 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-25 18:26:09,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 729.0) internal successors, (2916), 4 states have internal predecessors, (2916), 0 states have call successors, (0), 0 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-25 18:26:09,776 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 729.0) internal successors, (2916), 4 states have internal predecessors, (2916), 0 states have call successors, (0), 0 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-25 18:26:09,776 INFO L175 Difference]: Start difference. First operand has 60 places, 62 transitions, 149 flow. Second operand 3 states and 854 transitions. [2022-11-25 18:26:09,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 61 transitions, 255 flow [2022-11-25 18:26:09,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 61 transitions, 251 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 18:26:09,778 INFO L231 Difference]: Finished difference. Result has 60 places, 61 transitions, 147 flow [2022-11-25 18:26:09,779 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=729, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=60, PETRI_TRANSITIONS=61} [2022-11-25 18:26:09,779 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -46 predicate places. [2022-11-25 18:26:09,779 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 61 transitions, 147 flow [2022-11-25 18:26:09,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 268.25) internal successors, (1073), 4 states have internal predecessors, (1073), 0 states have call successors, (0), 0 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-25 18:26:09,780 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:26:09,780 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 18:26:09,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 18:26:09,781 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-25 18:26:09,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:26:09,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1207481448, now seen corresponding path program 1 times [2022-11-25 18:26:09,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:26:09,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293918320] [2022-11-25 18:26:09,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:09,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:26:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:09,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-25 18:26:09,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:26:09,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293918320] [2022-11-25 18:26:09,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293918320] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:26:09,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:26:09,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:26:09,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451193962] [2022-11-25 18:26:09,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:26:09,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:26:09,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:26:09,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:26:09,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:26:10,183 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 729 [2022-11-25 18:26:10,184 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 61 transitions, 147 flow. Second operand has 4 states, 4 states have (on average 274.25) internal successors, (1097), 4 states have internal predecessors, (1097), 0 states have call successors, (0), 0 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-25 18:26:10,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:26:10,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 729 [2022-11-25 18:26:10,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:26:10,527 INFO L130 PetriNetUnfolder]: 1362/2259 cut-off events. [2022-11-25 18:26:10,527 INFO L131 PetriNetUnfolder]: For 123/161 co-relation queries the response was YES. [2022-11-25 18:26:10,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4582 conditions, 2259 events. 1362/2259 cut-off events. For 123/161 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 11081 event pairs, 1120 based on Foata normal form. 0/1604 useless extension candidates. Maximal degree in co-relation 4577. Up to 2178 conditions per place. [2022-11-25 18:26:10,543 INFO L137 encePairwiseOnDemand]: 726/729 looper letters, 51 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2022-11-25 18:26:10,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 60 transitions, 251 flow [2022-11-25 18:26:10,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:26:10,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:26:10,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 871 transitions. [2022-11-25 18:26:10,547 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3982624599908551 [2022-11-25 18:26:10,548 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 871 transitions. [2022-11-25 18:26:10,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 871 transitions. [2022-11-25 18:26:10,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:26:10,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 871 transitions. [2022-11-25 18:26:10,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 290.3333333333333) internal successors, (871), 3 states have internal predecessors, (871), 0 states have call successors, (0), 0 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-25 18:26:10,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 729.0) internal successors, (2916), 4 states have internal predecessors, (2916), 0 states have call successors, (0), 0 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-25 18:26:10,557 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 729.0) internal successors, (2916), 4 states have internal predecessors, (2916), 0 states have call successors, (0), 0 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-25 18:26:10,557 INFO L175 Difference]: Start difference. First operand has 60 places, 61 transitions, 147 flow. Second operand 3 states and 871 transitions. [2022-11-25 18:26:10,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 60 transitions, 251 flow [2022-11-25 18:26:10,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 60 transitions, 247 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 18:26:10,560 INFO L231 Difference]: Finished difference. Result has 59 places, 60 transitions, 145 flow [2022-11-25 18:26:10,560 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=729, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=145, PETRI_PLACES=59, PETRI_TRANSITIONS=60} [2022-11-25 18:26:10,561 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -47 predicate places. [2022-11-25 18:26:10,561 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 60 transitions, 145 flow [2022-11-25 18:26:10,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 274.25) internal successors, (1097), 4 states have internal predecessors, (1097), 0 states have call successors, (0), 0 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-25 18:26:10,562 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:26:10,563 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 18:26:10,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 18:26:10,563 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-25 18:26:10,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:26:10,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1224639577, now seen corresponding path program 1 times [2022-11-25 18:26:10,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:26:10,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791808082] [2022-11-25 18:26:10,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:10,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:26:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:11,083 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-25 18:26:11,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:26:11,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791808082] [2022-11-25 18:26:11,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791808082] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:26:11,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:26:11,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:26:11,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729324827] [2022-11-25 18:26:11,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:26:11,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:26:11,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:26:11,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:26:11,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:26:11,439 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 729 [2022-11-25 18:26:11,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 60 transitions, 145 flow. Second operand has 4 states, 4 states have (on average 266.5) internal successors, (1066), 4 states have internal predecessors, (1066), 0 states have call successors, (0), 0 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-25 18:26:11,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:26:11,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 729 [2022-11-25 18:26:11,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:26:11,945 INFO L130 PetriNetUnfolder]: 1766/2914 cut-off events. [2022-11-25 18:26:11,946 INFO L131 PetriNetUnfolder]: For 131/131 co-relation queries the response was YES. [2022-11-25 18:26:11,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5963 conditions, 2914 events. 1766/2914 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 15198 event pairs, 428 based on Foata normal form. 27/2064 useless extension candidates. Maximal degree in co-relation 5958. Up to 2294 conditions per place. [2022-11-25 18:26:11,968 INFO L137 encePairwiseOnDemand]: 723/729 looper letters, 76 selfloop transitions, 7 changer transitions 0/88 dead transitions. [2022-11-25 18:26:11,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 88 transitions, 376 flow [2022-11-25 18:26:11,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:26:11,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 18:26:11,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1142 transitions. [2022-11-25 18:26:11,973 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.39163237311385457 [2022-11-25 18:26:11,973 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1142 transitions. [2022-11-25 18:26:11,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1142 transitions. [2022-11-25 18:26:11,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:26:11,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1142 transitions. [2022-11-25 18:26:11,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 285.5) internal successors, (1142), 4 states have internal predecessors, (1142), 0 states have call successors, (0), 0 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-25 18:26:11,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 729.0) internal successors, (3645), 5 states have internal predecessors, (3645), 0 states have call successors, (0), 0 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-25 18:26:11,984 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 729.0) internal successors, (3645), 5 states have internal predecessors, (3645), 0 states have call successors, (0), 0 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-25 18:26:11,984 INFO L175 Difference]: Start difference. First operand has 59 places, 60 transitions, 145 flow. Second operand 4 states and 1142 transitions. [2022-11-25 18:26:11,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 88 transitions, 376 flow [2022-11-25 18:26:11,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 88 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 18:26:11,987 INFO L231 Difference]: Finished difference. Result has 61 places, 64 transitions, 184 flow [2022-11-25 18:26:11,987 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=729, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=184, PETRI_PLACES=61, PETRI_TRANSITIONS=64} [2022-11-25 18:26:11,988 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -45 predicate places. [2022-11-25 18:26:11,989 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 64 transitions, 184 flow [2022-11-25 18:26:11,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 266.5) internal successors, (1066), 4 states have internal predecessors, (1066), 0 states have call successors, (0), 0 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-25 18:26:11,990 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:26:11,990 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 18:26:11,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 18:26:11,990 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-25 18:26:11,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:26:11,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1224719995, now seen corresponding path program 1 times [2022-11-25 18:26:11,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:26:11,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289293065] [2022-11-25 18:26:11,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:11,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:26:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:12,286 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-25 18:26:12,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:26:12,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289293065] [2022-11-25 18:26:12,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289293065] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:26:12,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:26:12,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:26:12,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595768470] [2022-11-25 18:26:12,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:26:12,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:26:12,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:26:12,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:26:12,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:26:12,645 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 729 [2022-11-25 18:26:12,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 64 transitions, 184 flow. Second operand has 4 states, 4 states have (on average 269.5) internal successors, (1078), 4 states have internal predecessors, (1078), 0 states have call successors, (0), 0 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-25 18:26:12,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:26:12,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 729 [2022-11-25 18:26:12,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:26:13,274 INFO L130 PetriNetUnfolder]: 1785/3049 cut-off events. [2022-11-25 18:26:13,275 INFO L131 PetriNetUnfolder]: For 435/435 co-relation queries the response was YES. [2022-11-25 18:26:13,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6349 conditions, 3049 events. 1785/3049 cut-off events. For 435/435 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 16586 event pairs, 747 based on Foata normal form. 72/2364 useless extension candidates. Maximal degree in co-relation 6343. Up to 1775 conditions per place. [2022-11-25 18:26:13,301 INFO L137 encePairwiseOnDemand]: 724/729 looper letters, 84 selfloop transitions, 3 changer transitions 0/95 dead transitions. [2022-11-25 18:26:13,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 95 transitions, 422 flow [2022-11-25 18:26:13,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:26:13,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 18:26:13,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1157 transitions. [2022-11-25 18:26:13,308 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3967764060356653 [2022-11-25 18:26:13,308 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1157 transitions. [2022-11-25 18:26:13,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1157 transitions. [2022-11-25 18:26:13,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:26:13,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1157 transitions. [2022-11-25 18:26:13,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 289.25) internal successors, (1157), 4 states have internal predecessors, (1157), 0 states have call successors, (0), 0 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-25 18:26:13,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 729.0) internal successors, (3645), 5 states have internal predecessors, (3645), 0 states have call successors, (0), 0 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-25 18:26:13,323 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 729.0) internal successors, (3645), 5 states have internal predecessors, (3645), 0 states have call successors, (0), 0 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-25 18:26:13,324 INFO L175 Difference]: Start difference. First operand has 61 places, 64 transitions, 184 flow. Second operand 4 states and 1157 transitions. [2022-11-25 18:26:13,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 95 transitions, 422 flow [2022-11-25 18:26:13,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 95 transitions, 417 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 18:26:13,332 INFO L231 Difference]: Finished difference. Result has 62 places, 62 transitions, 179 flow [2022-11-25 18:26:13,333 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=729, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=62, PETRI_TRANSITIONS=62} [2022-11-25 18:26:13,334 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -44 predicate places. [2022-11-25 18:26:13,334 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 62 transitions, 179 flow [2022-11-25 18:26:13,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 269.5) internal successors, (1078), 4 states have internal predecessors, (1078), 0 states have call successors, (0), 0 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-25 18:26:13,336 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:26:13,336 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:26:13,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 18:26:13,336 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-25 18:26:13,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:26:13,337 INFO L85 PathProgramCache]: Analyzing trace with hash 2105090144, now seen corresponding path program 1 times [2022-11-25 18:26:13,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:26:13,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513927782] [2022-11-25 18:26:13,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:13,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:26:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:13,439 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-25 18:26:13,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:26:13,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513927782] [2022-11-25 18:26:13,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513927782] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:26:13,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:26:13,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:26:13,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619376654] [2022-11-25 18:26:13,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:26:13,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:26:13,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:26:13,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:26:13,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:26:13,452 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 729 [2022-11-25 18:26:13,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 62 transitions, 179 flow. Second operand has 3 states, 3 states have (on average 278.0) internal successors, (834), 3 states have internal predecessors, (834), 0 states have call successors, (0), 0 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-25 18:26:13,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:26:13,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 729 [2022-11-25 18:26:13,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:26:13,752 INFO L130 PetriNetUnfolder]: 620/1228 cut-off events. [2022-11-25 18:26:13,753 INFO L131 PetriNetUnfolder]: For 134/134 co-relation queries the response was YES. [2022-11-25 18:26:13,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2548 conditions, 1228 events. 620/1228 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 6223 event pairs, 391 based on Foata normal form. 40/1048 useless extension candidates. Maximal degree in co-relation 2541. Up to 643 conditions per place. [2022-11-25 18:26:13,760 INFO L137 encePairwiseOnDemand]: 725/729 looper letters, 64 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2022-11-25 18:26:13,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 74 transitions, 342 flow [2022-11-25 18:26:13,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:26:13,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:26:13,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 887 transitions. [2022-11-25 18:26:13,765 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.40557841792409693 [2022-11-25 18:26:13,765 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 887 transitions. [2022-11-25 18:26:13,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 887 transitions. [2022-11-25 18:26:13,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:26:13,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 887 transitions. [2022-11-25 18:26:13,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 295.6666666666667) internal successors, (887), 3 states have internal predecessors, (887), 0 states have call successors, (0), 0 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-25 18:26:13,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 729.0) internal successors, (2916), 4 states have internal predecessors, (2916), 0 states have call successors, (0), 0 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-25 18:26:13,775 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 729.0) internal successors, (2916), 4 states have internal predecessors, (2916), 0 states have call successors, (0), 0 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-25 18:26:13,775 INFO L175 Difference]: Start difference. First operand has 62 places, 62 transitions, 179 flow. Second operand 3 states and 887 transitions. [2022-11-25 18:26:13,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 74 transitions, 342 flow [2022-11-25 18:26:13,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 74 transitions, 341 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 18:26:13,778 INFO L231 Difference]: Finished difference. Result has 64 places, 61 transitions, 180 flow [2022-11-25 18:26:13,779 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=729, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=64, PETRI_TRANSITIONS=61} [2022-11-25 18:26:13,779 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -42 predicate places. [2022-11-25 18:26:13,779 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 61 transitions, 180 flow [2022-11-25 18:26:13,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.0) internal successors, (834), 3 states have internal predecessors, (834), 0 states have call successors, (0), 0 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-25 18:26:13,780 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:26:13,780 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:26:13,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 18:26:13,781 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-25 18:26:13,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:26:13,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1710762929, now seen corresponding path program 1 times [2022-11-25 18:26:13,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:26:13,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696781362] [2022-11-25 18:26:13,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:13,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:26:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:15,056 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-25 18:26:15,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:26:15,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696781362] [2022-11-25 18:26:15,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696781362] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:26:15,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:26:15,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:26:15,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779395324] [2022-11-25 18:26:15,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:26:15,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:26:15,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:26:15,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:26:15,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:26:16,561 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 729 [2022-11-25 18:26:16,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 61 transitions, 180 flow. Second operand has 7 states, 7 states have (on average 260.57142857142856) internal successors, (1824), 7 states have internal predecessors, (1824), 0 states have call successors, (0), 0 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-25 18:26:16,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:26:16,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 729 [2022-11-25 18:26:16,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:26:17,030 INFO L130 PetriNetUnfolder]: 587/1169 cut-off events. [2022-11-25 18:26:17,031 INFO L131 PetriNetUnfolder]: For 167/170 co-relation queries the response was YES. [2022-11-25 18:26:17,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2490 conditions, 1169 events. 587/1169 cut-off events. For 167/170 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 5840 event pairs, 311 based on Foata normal form. 0/996 useless extension candidates. Maximal degree in co-relation 2482. Up to 566 conditions per place. [2022-11-25 18:26:17,039 INFO L137 encePairwiseOnDemand]: 724/729 looper letters, 80 selfloop transitions, 5 changer transitions 0/90 dead transitions. [2022-11-25 18:26:17,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 90 transitions, 422 flow [2022-11-25 18:26:17,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:26:17,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 18:26:17,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1119 transitions. [2022-11-25 18:26:17,044 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3837448559670782 [2022-11-25 18:26:17,044 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1119 transitions. [2022-11-25 18:26:17,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1119 transitions. [2022-11-25 18:26:17,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:26:17,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1119 transitions. [2022-11-25 18:26:17,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 279.75) internal successors, (1119), 4 states have internal predecessors, (1119), 0 states have call successors, (0), 0 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-25 18:26:17,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 729.0) internal successors, (3645), 5 states have internal predecessors, (3645), 0 states have call successors, (0), 0 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-25 18:26:17,056 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 729.0) internal successors, (3645), 5 states have internal predecessors, (3645), 0 states have call successors, (0), 0 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-25 18:26:17,056 INFO L175 Difference]: Start difference. First operand has 64 places, 61 transitions, 180 flow. Second operand 4 states and 1119 transitions. [2022-11-25 18:26:17,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 90 transitions, 422 flow [2022-11-25 18:26:17,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 90 transitions, 414 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 18:26:17,060 INFO L231 Difference]: Finished difference. Result has 63 places, 60 transitions, 184 flow [2022-11-25 18:26:17,061 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=729, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=184, PETRI_PLACES=63, PETRI_TRANSITIONS=60} [2022-11-25 18:26:17,062 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -43 predicate places. [2022-11-25 18:26:17,062 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 60 transitions, 184 flow [2022-11-25 18:26:17,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 260.57142857142856) internal successors, (1824), 7 states have internal predecessors, (1824), 0 states have call successors, (0), 0 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-25 18:26:17,063 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:26:17,063 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:26:17,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 18:26:17,064 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-25 18:26:17,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:26:17,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1710762928, now seen corresponding path program 1 times [2022-11-25 18:26:17,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:26:17,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551198697] [2022-11-25 18:26:17,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:17,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:26:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:17,274 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-25 18:26:17,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:26:17,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551198697] [2022-11-25 18:26:17,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551198697] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:26:17,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:26:17,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:26:17,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383318848] [2022-11-25 18:26:17,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:26:17,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:26:17,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:26:17,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:26:17,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:26:17,586 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 729 [2022-11-25 18:26:17,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 60 transitions, 184 flow. Second operand has 4 states, 4 states have (on average 276.5) internal successors, (1106), 4 states have internal predecessors, (1106), 0 states have call successors, (0), 0 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-25 18:26:17,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:26:17,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 729 [2022-11-25 18:26:17,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:26:17,831 INFO L130 PetriNetUnfolder]: 443/877 cut-off events. [2022-11-25 18:26:17,832 INFO L131 PetriNetUnfolder]: For 151/151 co-relation queries the response was YES. [2022-11-25 18:26:17,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1888 conditions, 877 events. 443/877 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4021 event pairs, 285 based on Foata normal form. 10/758 useless extension candidates. Maximal degree in co-relation 1880. Up to 621 conditions per place. [2022-11-25 18:26:17,837 INFO L137 encePairwiseOnDemand]: 724/729 looper letters, 62 selfloop transitions, 3 changer transitions 0/73 dead transitions. [2022-11-25 18:26:17,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 73 transitions, 339 flow [2022-11-25 18:26:17,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:26:17,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 18:26:17,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1160 transitions. [2022-11-25 18:26:17,843 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.39780521262002744 [2022-11-25 18:26:17,843 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1160 transitions. [2022-11-25 18:26:17,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1160 transitions. [2022-11-25 18:26:17,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:26:17,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1160 transitions. [2022-11-25 18:26:17,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 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-25 18:26:17,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 729.0) internal successors, (3645), 5 states have internal predecessors, (3645), 0 states have call successors, (0), 0 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-25 18:26:17,856 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 729.0) internal successors, (3645), 5 states have internal predecessors, (3645), 0 states have call successors, (0), 0 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-25 18:26:17,856 INFO L175 Difference]: Start difference. First operand has 63 places, 60 transitions, 184 flow. Second operand 4 states and 1160 transitions. [2022-11-25 18:26:17,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 73 transitions, 339 flow [2022-11-25 18:26:17,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 73 transitions, 332 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-25 18:26:17,861 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 183 flow [2022-11-25 18:26:17,862 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=729, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=183, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2022-11-25 18:26:17,864 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -41 predicate places. [2022-11-25 18:26:17,864 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 183 flow [2022-11-25 18:26:17,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 276.5) internal successors, (1106), 4 states have internal predecessors, (1106), 0 states have call successors, (0), 0 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-25 18:26:17,865 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:26:17,865 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:26:17,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 18:26:17,866 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-25 18:26:17,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:26:17,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1494038979, now seen corresponding path program 1 times [2022-11-25 18:26:17,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:26:17,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457209228] [2022-11-25 18:26:17,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:17,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:26:17,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:18,295 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-25 18:26:18,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:26:18,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457209228] [2022-11-25 18:26:18,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457209228] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:26:18,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292626001] [2022-11-25 18:26:18,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:18,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:26:18,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:26:18,302 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:26:18,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 18:26:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:18,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-25 18:26:18,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:26:18,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:26:18,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:26:18,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 18:26:18,867 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-25 18:26:18,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:26:18,989 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:26:18,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-25 18:26:19,005 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:26:19,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2022-11-25 18:26:19,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-25 18:26:19,059 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:26:19,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-25 18:26:19,067 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:26:19,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:26:19,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-25 18:26:19,163 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:26:19,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2022-11-25 18:26:19,301 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-25 18:26:19,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292626001] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:26:19,301 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:26:19,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-11-25 18:26:19,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526225839] [2022-11-25 18:26:19,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:26:19,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-25 18:26:19,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:26:19,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-25 18:26:19,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=207, Unknown=1, NotChecked=0, Total=272 [2022-11-25 18:26:21,310 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 729 [2022-11-25 18:26:21,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 183 flow. Second operand has 17 states, 17 states have (on average 189.11764705882354) internal successors, (3215), 17 states have internal predecessors, (3215), 0 states have call successors, (0), 0 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-25 18:26:21,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:26:21,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 729 [2022-11-25 18:26:21,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:26:22,541 INFO L130 PetriNetUnfolder]: 661/1285 cut-off events. [2022-11-25 18:26:22,541 INFO L131 PetriNetUnfolder]: For 284/284 co-relation queries the response was YES. [2022-11-25 18:26:22,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2865 conditions, 1285 events. 661/1285 cut-off events. For 284/284 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6656 event pairs, 161 based on Foata normal form. 10/1101 useless extension candidates. Maximal degree in co-relation 2856. Up to 683 conditions per place. [2022-11-25 18:26:22,549 INFO L137 encePairwiseOnDemand]: 720/729 looper letters, 99 selfloop transitions, 14 changer transitions 0/117 dead transitions. [2022-11-25 18:26:22,550 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 117 transitions, 569 flow [2022-11-25 18:26:22,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:26:22,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-25 18:26:22,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1795 transitions. [2022-11-25 18:26:22,557 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.2735863435451913 [2022-11-25 18:26:22,557 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1795 transitions. [2022-11-25 18:26:22,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1795 transitions. [2022-11-25 18:26:22,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:26:22,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1795 transitions. [2022-11-25 18:26:22,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 199.44444444444446) internal successors, (1795), 9 states have internal predecessors, (1795), 0 states have call successors, (0), 0 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-25 18:26:22,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 729.0) internal successors, (7290), 10 states have internal predecessors, (7290), 0 states have call successors, (0), 0 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-25 18:26:22,574 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 729.0) internal successors, (7290), 10 states have internal predecessors, (7290), 0 states have call successors, (0), 0 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-25 18:26:22,574 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 183 flow. Second operand 9 states and 1795 transitions. [2022-11-25 18:26:22,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 117 transitions, 569 flow [2022-11-25 18:26:22,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 117 transitions, 563 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 18:26:22,579 INFO L231 Difference]: Finished difference. Result has 74 places, 67 transitions, 261 flow [2022-11-25 18:26:22,579 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=729, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=261, PETRI_PLACES=74, PETRI_TRANSITIONS=67} [2022-11-25 18:26:22,580 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -32 predicate places. [2022-11-25 18:26:22,580 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 67 transitions, 261 flow [2022-11-25 18:26:22,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 189.11764705882354) internal successors, (3215), 17 states have internal predecessors, (3215), 0 states have call successors, (0), 0 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-25 18:26:22,582 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:26:22,582 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:26:22,597 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 18:26:22,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:26:22,790 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-25 18:26:22,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:26:22,790 INFO L85 PathProgramCache]: Analyzing trace with hash 929431308, now seen corresponding path program 1 times [2022-11-25 18:26:22,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:26:22,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152724010] [2022-11-25 18:26:22,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:22,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:26:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:23,389 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-25 18:26:23,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:26:23,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152724010] [2022-11-25 18:26:23,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152724010] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:26:23,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385015967] [2022-11-25 18:26:23,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:23,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:26:23,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:26:23,392 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:26:23,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 18:26:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:23,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-25 18:26:23,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:26:23,612 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 18:26:23,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-25 18:26:23,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:26:23,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:26:23,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 18:26:23,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:26:23,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 18:26:24,044 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-25 18:26:24,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:26:24,105 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_491 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_491) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_491 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_491) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-25 18:26:26,284 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:26:26,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-25 18:26:26,301 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:26:26,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 165 [2022-11-25 18:26:26,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 134 [2022-11-25 18:26:26,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 63 [2022-11-25 18:26:26,438 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:26:26,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-25 18:26:26,443 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:26:26,444 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:26:26,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:26:26,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-25 18:26:26,745 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-25 18:26:26,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385015967] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:26:26,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:26:26,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-11-25 18:26:26,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654809039] [2022-11-25 18:26:26,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:26:26,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-25 18:26:26,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:26:26,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-25 18:26:26,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=268, Unknown=6, NotChecked=34, Total=380 [2022-11-25 18:26:27,309 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 729 [2022-11-25 18:26:27,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 67 transitions, 261 flow. Second operand has 20 states, 20 states have (on average 183.95) internal successors, (3679), 20 states have internal predecessors, (3679), 0 states have call successors, (0), 0 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-25 18:26:27,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:26:27,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 729 [2022-11-25 18:26:27,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:26:28,979 INFO L130 PetriNetUnfolder]: 822/1615 cut-off events. [2022-11-25 18:26:28,980 INFO L131 PetriNetUnfolder]: For 635/638 co-relation queries the response was YES. [2022-11-25 18:26:28,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3821 conditions, 1615 events. 822/1615 cut-off events. For 635/638 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 8999 event pairs, 289 based on Foata normal form. 9/1414 useless extension candidates. Maximal degree in co-relation 3809. Up to 665 conditions per place. [2022-11-25 18:26:28,992 INFO L137 encePairwiseOnDemand]: 720/729 looper letters, 100 selfloop transitions, 16 changer transitions 0/120 dead transitions. [2022-11-25 18:26:28,992 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 120 transitions, 638 flow [2022-11-25 18:26:28,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 18:26:28,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-25 18:26:28,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1930 transitions. [2022-11-25 18:26:29,000 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.26474622770919065 [2022-11-25 18:26:29,000 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1930 transitions. [2022-11-25 18:26:29,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1930 transitions. [2022-11-25 18:26:29,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:26:29,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1930 transitions. [2022-11-25 18:26:29,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 193.0) internal successors, (1930), 10 states have internal predecessors, (1930), 0 states have call successors, (0), 0 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-25 18:26:29,017 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 729.0) internal successors, (8019), 11 states have internal predecessors, (8019), 0 states have call successors, (0), 0 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-25 18:26:29,020 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 729.0) internal successors, (8019), 11 states have internal predecessors, (8019), 0 states have call successors, (0), 0 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-25 18:26:29,020 INFO L175 Difference]: Start difference. First operand has 74 places, 67 transitions, 261 flow. Second operand 10 states and 1930 transitions. [2022-11-25 18:26:29,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 120 transitions, 638 flow [2022-11-25 18:26:29,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 120 transitions, 627 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-11-25 18:26:29,026 INFO L231 Difference]: Finished difference. Result has 82 places, 70 transitions, 312 flow [2022-11-25 18:26:29,027 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=729, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=312, PETRI_PLACES=82, PETRI_TRANSITIONS=70} [2022-11-25 18:26:29,028 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -24 predicate places. [2022-11-25 18:26:29,029 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 70 transitions, 312 flow [2022-11-25 18:26:29,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 183.95) internal successors, (3679), 20 states have internal predecessors, (3679), 0 states have call successors, (0), 0 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-25 18:26:29,031 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:26:29,031 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:26:29,038 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 18:26:29,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-25 18:26:29,238 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-25 18:26:29,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:26:29,239 INFO L85 PathProgramCache]: Analyzing trace with hash 886474174, now seen corresponding path program 1 times [2022-11-25 18:26:29,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:26:29,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801903610] [2022-11-25 18:26:29,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:29,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:26:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:30,733 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-25 18:26:30,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:26:30,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801903610] [2022-11-25 18:26:30,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801903610] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:26:30,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312250252] [2022-11-25 18:26:30,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:30,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:26:30,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:26:30,736 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:26:30,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 18:26:30,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:30,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-25 18:26:30,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:26:30,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:26:31,014 INFO L321 Elim1Store]: treesize reduction 20, result has 63.6 percent of original size [2022-11-25 18:26:31,015 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 2 case distinctions, treesize of input 28 treesize of output 40 [2022-11-25 18:26:31,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:26:31,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-25 18:26:31,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-25 18:26:31,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-25 18:26:31,377 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-25 18:26:31,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 20 treesize of output 30 [2022-11-25 18:26:35,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-25 18:26:35,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-25 18:26:38,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:26:38,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-25 18:26:40,141 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-25 18:26:40,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:26:40,189 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_585 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_585) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_585 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_585) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-25 18:26:40,205 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_585 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_585) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_585 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_585) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2022-11-25 18:26:45,264 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-25 18:26:45,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312250252] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:26:45,265 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:26:45,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-25 18:26:45,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532856398] [2022-11-25 18:26:45,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:26:45,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-25 18:26:45,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:26:45,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-25 18:26:45,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=430, Unknown=8, NotChecked=90, Total=650 [2022-11-25 18:26:45,330 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 729 [2022-11-25 18:26:45,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 70 transitions, 312 flow. Second operand has 26 states, 26 states have (on average 185.5) internal successors, (4823), 26 states have internal predecessors, (4823), 0 states have call successors, (0), 0 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-25 18:26:45,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:26:45,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 729 [2022-11-25 18:26:45,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:26:59,500 WARN L233 SmtUtils]: Spent 6.16s on a formula simplification. DAG size of input: 77 DAG size of output: 64 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:27:04,979 WARN L233 SmtUtils]: Spent 5.37s on a formula simplification. DAG size of input: 44 DAG size of output: 41 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:27:07,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:27:17,008 WARN L233 SmtUtils]: Spent 9.49s on a formula simplification. DAG size of input: 90 DAG size of output: 71 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:27:19,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:27:21,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:27:23,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:27:29,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:27:31,138 INFO L130 PetriNetUnfolder]: 951/1896 cut-off events. [2022-11-25 18:27:31,138 INFO L131 PetriNetUnfolder]: For 1063/1063 co-relation queries the response was YES. [2022-11-25 18:27:31,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4622 conditions, 1896 events. 951/1896 cut-off events. For 1063/1063 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 10844 event pairs, 700 based on Foata normal form. 12/1672 useless extension candidates. Maximal degree in co-relation 4609. Up to 1493 conditions per place. [2022-11-25 18:27:31,151 INFO L137 encePairwiseOnDemand]: 715/729 looper letters, 102 selfloop transitions, 37 changer transitions 0/143 dead transitions. [2022-11-25 18:27:31,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 143 transitions, 879 flow [2022-11-25 18:27:31,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:27:31,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-11-25 18:27:31,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3810 transitions. [2022-11-25 18:27:31,170 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.2613168724279835 [2022-11-25 18:27:31,170 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3810 transitions. [2022-11-25 18:27:31,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3810 transitions. [2022-11-25 18:27:31,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:27:31,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3810 transitions. [2022-11-25 18:27:31,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 190.5) internal successors, (3810), 20 states have internal predecessors, (3810), 0 states have call successors, (0), 0 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-25 18:27:31,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 729.0) internal successors, (15309), 21 states have internal predecessors, (15309), 0 states have call successors, (0), 0 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-25 18:27:31,211 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 729.0) internal successors, (15309), 21 states have internal predecessors, (15309), 0 states have call successors, (0), 0 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-25 18:27:31,211 INFO L175 Difference]: Start difference. First operand has 82 places, 70 transitions, 312 flow. Second operand 20 states and 3810 transitions. [2022-11-25 18:27:31,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 143 transitions, 879 flow [2022-11-25 18:27:31,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 143 transitions, 846 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-11-25 18:27:31,220 INFO L231 Difference]: Finished difference. Result has 104 places, 101 transitions, 601 flow [2022-11-25 18:27:31,220 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=729, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=601, PETRI_PLACES=104, PETRI_TRANSITIONS=101} [2022-11-25 18:27:31,221 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -2 predicate places. [2022-11-25 18:27:31,221 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 101 transitions, 601 flow [2022-11-25 18:27:31,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 185.5) internal successors, (4823), 26 states have internal predecessors, (4823), 0 states have call successors, (0), 0 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-25 18:27:31,223 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:27:31,223 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:27:31,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 18:27:31,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-25 18:27:31,437 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-25 18:27:31,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:27:31,437 INFO L85 PathProgramCache]: Analyzing trace with hash 653864131, now seen corresponding path program 1 times [2022-11-25 18:27:31,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:27:31,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770556] [2022-11-25 18:27:31,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:27:31,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:27:31,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:27:33,120 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-25 18:27:33,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:27:33,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770556] [2022-11-25 18:27:33,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770556] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:27:33,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86327739] [2022-11-25 18:27:33,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:27:33,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:27:33,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:27:33,124 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:27:33,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 18:27:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:27:33,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-25 18:27:33,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:27:33,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2022-11-25 18:27:33,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:27:33,457 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-25 18:27:33,458 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 2 case distinctions, treesize of input 12 treesize of output 24 [2022-11-25 18:27:33,487 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:27:33,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 11 [2022-11-25 18:27:33,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 18:27:33,757 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 18:27:33,758 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 1 case distinctions, treesize of input 22 treesize of output 28 [2022-11-25 18:27:34,043 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:27:34,073 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-25 18:27:34,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 39 [2022-11-25 18:27:34,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2022-11-25 18:27:34,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 22 [2022-11-25 18:27:34,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:27:34,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-25 18:27:34,904 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-25 18:27:34,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:27:34,984 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_678 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_678) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_678 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_678) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-25 18:27:35,149 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_678 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_678) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_678 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_678) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-25 18:27:35,186 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_674 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_674) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_678) |c_~#queue~0.base|) .cse4) 4)))) (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_674 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_674) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_678) |c_~#queue~0.base|) .cse4) 4)) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2022-11-25 18:27:40,145 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-25 18:27:40,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86327739] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:27:40,146 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:27:40,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 26 [2022-11-25 18:27:40,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799670072] [2022-11-25 18:27:40,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:27:40,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-25 18:27:40,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:27:40,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-25 18:27:40,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=490, Unknown=9, NotChecked=144, Total=756 [2022-11-25 18:27:40,826 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 729 [2022-11-25 18:27:40,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 101 transitions, 601 flow. Second operand has 28 states, 28 states have (on average 180.5) internal successors, (5054), 28 states have internal predecessors, (5054), 0 states have call successors, (0), 0 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-25 18:27:40,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:27:40,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 729 [2022-11-25 18:27:40,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:27:50,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:27:53,144 INFO L130 PetriNetUnfolder]: 1301/2590 cut-off events. [2022-11-25 18:27:53,144 INFO L131 PetriNetUnfolder]: For 2450/2450 co-relation queries the response was YES. [2022-11-25 18:27:53,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6698 conditions, 2590 events. 1301/2590 cut-off events. For 2450/2450 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 15749 event pairs, 409 based on Foata normal form. 27/2297 useless extension candidates. Maximal degree in co-relation 6676. Up to 1257 conditions per place. [2022-11-25 18:27:53,157 INFO L137 encePairwiseOnDemand]: 709/729 looper letters, 165 selfloop transitions, 71 changer transitions 0/240 dead transitions. [2022-11-25 18:27:53,157 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 240 transitions, 1488 flow [2022-11-25 18:27:53,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 18:27:53,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-11-25 18:27:53,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3608 transitions. [2022-11-25 18:27:53,169 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.26048660746516494 [2022-11-25 18:27:53,169 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3608 transitions. [2022-11-25 18:27:53,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3608 transitions. [2022-11-25 18:27:53,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:27:53,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3608 transitions. [2022-11-25 18:27:53,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 189.89473684210526) internal successors, (3608), 19 states have internal predecessors, (3608), 0 states have call successors, (0), 0 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-25 18:27:53,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 729.0) internal successors, (14580), 20 states have internal predecessors, (14580), 0 states have call successors, (0), 0 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-25 18:27:53,203 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 729.0) internal successors, (14580), 20 states have internal predecessors, (14580), 0 states have call successors, (0), 0 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-25 18:27:53,203 INFO L175 Difference]: Start difference. First operand has 104 places, 101 transitions, 601 flow. Second operand 19 states and 3608 transitions. [2022-11-25 18:27:53,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 240 transitions, 1488 flow [2022-11-25 18:27:53,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 240 transitions, 1368 flow, removed 56 selfloop flow, removed 3 redundant places. [2022-11-25 18:27:53,222 INFO L231 Difference]: Finished difference. Result has 128 places, 141 transitions, 943 flow [2022-11-25 18:27:53,223 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=729, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=943, PETRI_PLACES=128, PETRI_TRANSITIONS=141} [2022-11-25 18:27:53,223 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, 22 predicate places. [2022-11-25 18:27:53,223 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 141 transitions, 943 flow [2022-11-25 18:27:53,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 180.5) internal successors, (5054), 28 states have internal predecessors, (5054), 0 states have call successors, (0), 0 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-25 18:27:53,225 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:27:53,226 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:27:53,235 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 18:27:53,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-25 18:27:53,435 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-25 18:27:53,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:27:53,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1710879209, now seen corresponding path program 2 times [2022-11-25 18:27:53,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:27:53,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068857456] [2022-11-25 18:27:53,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:27:53,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:27:53,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:27:54,914 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-25 18:27:54,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:27:54,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068857456] [2022-11-25 18:27:54,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068857456] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:27:54,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404617525] [2022-11-25 18:27:54,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:27:54,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:27:54,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:27:54,920 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:27:54,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 18:27:55,162 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:27:55,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:27:55,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-25 18:27:55,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:27:55,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:27:55,241 INFO L321 Elim1Store]: treesize reduction 20, result has 63.6 percent of original size [2022-11-25 18:27:55,243 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 2 case distinctions, treesize of input 28 treesize of output 40 [2022-11-25 18:27:55,270 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:27:55,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 11 [2022-11-25 18:27:55,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2022-11-25 18:27:55,593 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-25 18:27:55,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 20 treesize of output 30 [2022-11-25 18:27:55,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-25 18:27:56,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-25 18:27:56,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:27:56,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-25 18:27:56,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:27:56,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-25 18:27:56,569 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-25 18:27:56,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:27:56,743 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_775 (Array Int Int)) (v_ArrVal_774 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_774) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|) .cse0))))) (forall ((v_ArrVal_775 (Array Int Int)) (v_ArrVal_774 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* 4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_774) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|) .cse0))) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-25 18:27:56,771 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_775 (Array Int Int)) (v_ArrVal_774 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_774) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_775 (Array Int Int)) (v_ArrVal_774 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_774) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-25 18:27:56,793 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_775 (Array Int Int)) (v_ArrVal_774 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_774) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_775 (Array Int Int)) (v_ArrVal_774 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_774) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-25 18:28:04,085 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-25 18:28:04,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404617525] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:28:04,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:28:04,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-25 18:28:04,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7025285] [2022-11-25 18:28:04,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:28:04,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-25 18:28:04,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:28:04,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-25 18:28:04,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=513, Unknown=11, NotChecked=150, Total=812 [2022-11-25 18:28:04,093 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 729 [2022-11-25 18:28:04,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 141 transitions, 943 flow. Second operand has 29 states, 29 states have (on average 180.44827586206895) internal successors, (5233), 29 states have internal predecessors, (5233), 0 states have call successors, (0), 0 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-25 18:28:04,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:28:04,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 729 [2022-11-25 18:28:04,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:28:19,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:28:21,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:28:23,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:28:23,944 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ (select .cse2 .cse4) 1)) (.cse6 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (forall ((v_ArrVal_771 Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_774 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_771) .cse4 .cse5)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_774) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset|)))) (.cse1 (forall ((v_ArrVal_771 Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_774 (Array Int Int))) (<= (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_771) .cse4 .cse5)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_774) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) (and .cse0 .cse1 (or (and .cse0 .cse1) (not (<= (+ 1612 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)))))))) is different from false [2022-11-25 18:28:27,208 INFO L130 PetriNetUnfolder]: 1704/3377 cut-off events. [2022-11-25 18:28:27,208 INFO L131 PetriNetUnfolder]: For 11902/11905 co-relation queries the response was YES. [2022-11-25 18:28:27,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14051 conditions, 3377 events. 1704/3377 cut-off events. For 11902/11905 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 21647 event pairs, 547 based on Foata normal form. 18/2998 useless extension candidates. Maximal degree in co-relation 14019. Up to 1665 conditions per place. [2022-11-25 18:28:27,235 INFO L137 encePairwiseOnDemand]: 708/729 looper letters, 183 selfloop transitions, 108 changer transitions 0/295 dead transitions. [2022-11-25 18:28:27,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 295 transitions, 2715 flow [2022-11-25 18:28:27,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-25 18:28:27,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-11-25 18:28:27,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 4158 transitions. [2022-11-25 18:28:27,246 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.25925925925925924 [2022-11-25 18:28:27,246 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 4158 transitions. [2022-11-25 18:28:27,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 4158 transitions. [2022-11-25 18:28:27,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:28:27,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 4158 transitions. [2022-11-25 18:28:27,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 189.0) internal successors, (4158), 22 states have internal predecessors, (4158), 0 states have call successors, (0), 0 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-25 18:28:27,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 729.0) internal successors, (16767), 23 states have internal predecessors, (16767), 0 states have call successors, (0), 0 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-25 18:28:27,275 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 729.0) internal successors, (16767), 23 states have internal predecessors, (16767), 0 states have call successors, (0), 0 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-25 18:28:27,275 INFO L175 Difference]: Start difference. First operand has 128 places, 141 transitions, 943 flow. Second operand 22 states and 4158 transitions. [2022-11-25 18:28:27,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 295 transitions, 2715 flow [2022-11-25 18:28:27,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 295 transitions, 2635 flow, removed 31 selfloop flow, removed 4 redundant places. [2022-11-25 18:28:27,319 INFO L231 Difference]: Finished difference. Result has 154 places, 198 transitions, 1805 flow [2022-11-25 18:28:27,319 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=729, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1805, PETRI_PLACES=154, PETRI_TRANSITIONS=198} [2022-11-25 18:28:27,320 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, 48 predicate places. [2022-11-25 18:28:27,320 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 198 transitions, 1805 flow [2022-11-25 18:28:27,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 180.44827586206895) internal successors, (5233), 29 states have internal predecessors, (5233), 0 states have call successors, (0), 0 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-25 18:28:27,321 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:28:27,321 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:28:27,327 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-25 18:28:27,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-25 18:28:27,527 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-25 18:28:27,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:28:27,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1978842436, now seen corresponding path program 1 times [2022-11-25 18:28:27,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:28:27,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975009640] [2022-11-25 18:28:27,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:28:27,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:28:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:27,658 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-25 18:28:27,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:28:27,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975009640] [2022-11-25 18:28:27,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975009640] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:28:27,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:28:27,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:28:27,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747350104] [2022-11-25 18:28:27,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:28:27,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:28:27,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:28:27,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:28:27,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:28:27,680 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 729 [2022-11-25 18:28:27,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 198 transitions, 1805 flow. Second operand has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 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-25 18:28:27,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:28:27,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 729 [2022-11-25 18:28:27,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:28:28,621 INFO L130 PetriNetUnfolder]: 1636/3292 cut-off events. [2022-11-25 18:28:28,621 INFO L131 PetriNetUnfolder]: For 35012/35219 co-relation queries the response was YES. [2022-11-25 18:28:28,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19069 conditions, 3292 events. 1636/3292 cut-off events. For 35012/35219 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 21592 event pairs, 687 based on Foata normal form. 0/2980 useless extension candidates. Maximal degree in co-relation 19028. Up to 1491 conditions per place. [2022-11-25 18:28:28,664 INFO L137 encePairwiseOnDemand]: 725/729 looper letters, 191 selfloop transitions, 3 changer transitions 0/212 dead transitions. [2022-11-25 18:28:28,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 212 transitions, 2343 flow [2022-11-25 18:28:28,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:28:28,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:28:28,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 884 transitions. [2022-11-25 18:28:28,667 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.40420667581161407 [2022-11-25 18:28:28,668 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 884 transitions. [2022-11-25 18:28:28,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 884 transitions. [2022-11-25 18:28:28,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:28:28,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 884 transitions. [2022-11-25 18:28:28,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 294.6666666666667) internal successors, (884), 3 states have internal predecessors, (884), 0 states have call successors, (0), 0 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-25 18:28:28,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 729.0) internal successors, (2916), 4 states have internal predecessors, (2916), 0 states have call successors, (0), 0 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-25 18:28:28,673 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 729.0) internal successors, (2916), 4 states have internal predecessors, (2916), 0 states have call successors, (0), 0 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-25 18:28:28,673 INFO L175 Difference]: Start difference. First operand has 154 places, 198 transitions, 1805 flow. Second operand 3 states and 884 transitions. [2022-11-25 18:28:28,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 212 transitions, 2343 flow [2022-11-25 18:28:28,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 212 transitions, 2072 flow, removed 122 selfloop flow, removed 7 redundant places. [2022-11-25 18:28:28,726 INFO L231 Difference]: Finished difference. Result has 145 places, 196 transitions, 1533 flow [2022-11-25 18:28:28,727 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=729, PETRI_DIFFERENCE_MINUEND_FLOW=1527, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1533, PETRI_PLACES=145, PETRI_TRANSITIONS=196} [2022-11-25 18:28:28,727 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, 39 predicate places. [2022-11-25 18:28:28,727 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 196 transitions, 1533 flow [2022-11-25 18:28:28,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 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-25 18:28:28,728 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:28:28,728 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:28:28,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 18:28:28,728 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-25 18:28:28,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:28:28,729 INFO L85 PathProgramCache]: Analyzing trace with hash 997593372, now seen corresponding path program 1 times [2022-11-25 18:28:28,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:28:28,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17277315] [2022-11-25 18:28:28,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:28:28,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:28:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:30,189 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:28:30,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:28:30,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17277315] [2022-11-25 18:28:30,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17277315] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:28:30,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170726625] [2022-11-25 18:28:30,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:28:30,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:28:30,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:28:30,191 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:28:30,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 18:28:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:30,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-25 18:28:30,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:28:30,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:28:30,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:28:30,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:28:30,458 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-25 18:28:30,896 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:28:30,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:28:31,217 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:28:31,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170726625] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:28:31,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:28:31,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 3, 3] total 16 [2022-11-25 18:28:31,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402330085] [2022-11-25 18:28:31,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:28:31,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-25 18:28:31,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:28:31,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-25 18:28:31,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-11-25 18:28:40,071 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 729 [2022-11-25 18:28:40,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 196 transitions, 1533 flow. Second operand has 17 states, 17 states have (on average 257.3529411764706) internal successors, (4375), 17 states have internal predecessors, (4375), 0 states have call successors, (0), 0 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-25 18:28:40,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:28:40,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 729 [2022-11-25 18:28:40,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:28:42,964 INFO L130 PetriNetUnfolder]: 2510/4962 cut-off events. [2022-11-25 18:28:42,964 INFO L131 PetriNetUnfolder]: For 59307/59442 co-relation queries the response was YES. [2022-11-25 18:28:42,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30033 conditions, 4962 events. 2510/4962 cut-off events. For 59307/59442 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 31806 event pairs, 888 based on Foata normal form. 149/4620 useless extension candidates. Maximal degree in co-relation 29992. Up to 1817 conditions per place. [2022-11-25 18:28:43,020 INFO L137 encePairwiseOnDemand]: 718/729 looper letters, 305 selfloop transitions, 45 changer transitions 0/355 dead transitions. [2022-11-25 18:28:43,020 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 355 transitions, 3736 flow [2022-11-25 18:28:43,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:28:43,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-25 18:28:43,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 4276 transitions. [2022-11-25 18:28:43,027 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3665980795610425 [2022-11-25 18:28:43,028 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 4276 transitions. [2022-11-25 18:28:43,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 4276 transitions. [2022-11-25 18:28:43,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:28:43,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 4276 transitions. [2022-11-25 18:28:43,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 267.25) internal successors, (4276), 16 states have internal predecessors, (4276), 0 states have call successors, (0), 0 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-25 18:28:43,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 729.0) internal successors, (12393), 17 states have internal predecessors, (12393), 0 states have call successors, (0), 0 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-25 18:28:43,051 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 729.0) internal successors, (12393), 17 states have internal predecessors, (12393), 0 states have call successors, (0), 0 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-25 18:28:43,051 INFO L175 Difference]: Start difference. First operand has 145 places, 196 transitions, 1533 flow. Second operand 16 states and 4276 transitions. [2022-11-25 18:28:43,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 355 transitions, 3736 flow [2022-11-25 18:28:43,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 355 transitions, 3598 flow, removed 64 selfloop flow, removed 2 redundant places. [2022-11-25 18:28:43,112 INFO L231 Difference]: Finished difference. Result has 161 places, 196 transitions, 1666 flow [2022-11-25 18:28:43,112 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=729, PETRI_DIFFERENCE_MINUEND_FLOW=1418, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1666, PETRI_PLACES=161, PETRI_TRANSITIONS=196} [2022-11-25 18:28:43,113 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, 55 predicate places. [2022-11-25 18:28:43,113 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 196 transitions, 1666 flow [2022-11-25 18:28:43,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 257.3529411764706) internal successors, (4375), 17 states have internal predecessors, (4375), 0 states have call successors, (0), 0 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-25 18:28:43,114 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:28:43,114 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-25 18:28:43,127 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 18:28:43,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:28:43,321 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-25 18:28:43,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:28:43,321 INFO L85 PathProgramCache]: Analyzing trace with hash 40774775, now seen corresponding path program 3 times [2022-11-25 18:28:43,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:28:43,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728537136] [2022-11-25 18:28:43,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:28:43,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:28:43,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:45,979 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:28:45,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:28:45,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728537136] [2022-11-25 18:28:45,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728537136] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:28:45,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172944558] [2022-11-25 18:28:45,980 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 18:28:45,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:28:45,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:28:45,984 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:28:45,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 18:28:46,331 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 18:28:46,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:28:46,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 84 conjunts are in the unsatisfiable core [2022-11-25 18:28:46,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:28:46,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2022-11-25 18:28:46,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:28:46,441 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-25 18:28:46,442 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 2 case distinctions, treesize of input 12 treesize of output 24 [2022-11-25 18:28:46,475 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:28:46,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 11 [2022-11-25 18:28:46,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 18:28:46,898 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:28:46,925 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-25 18:28:46,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 39 [2022-11-25 18:28:47,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-11-25 18:28:47,524 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 47 treesize of output 25 [2022-11-25 18:28:47,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:28:47,651 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 32 treesize of output 32 [2022-11-25 18:28:47,745 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 18:28:47,746 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 1 case distinctions, treesize of input 32 treesize of output 36 [2022-11-25 18:28:47,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2022-11-25 18:28:48,126 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:28:48,160 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-25 18:28:48,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 52 [2022-11-25 18:28:48,505 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 48 treesize of output 41 [2022-11-25 18:28:48,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 22 [2022-11-25 18:28:49,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:28:49,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-25 18:28:49,303 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:28:49,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:28:49,428 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1014 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|) .cse0))))) (forall ((v_ArrVal_1014 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|) .cse0)) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-25 18:28:49,669 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1014 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1014 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-25 18:28:58,890 WARN L233 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:29:16,889 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-25 18:29:16,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172944558] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:29:16,890 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:29:16,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 16] total 41 [2022-11-25 18:29:16,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706597225] [2022-11-25 18:29:16,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:29:16,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-25 18:29:16,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:16,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-25 18:29:16,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1387, Unknown=45, NotChecked=158, Total=1806 [2022-11-25 18:29:17,558 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 729 [2022-11-25 18:29:17,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 196 transitions, 1666 flow. Second operand has 43 states, 43 states have (on average 180.53488372093022) internal successors, (7763), 43 states have internal predecessors, (7763), 0 states have call successors, (0), 0 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-25 18:29:17,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:29:17,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 729 [2022-11-25 18:29:17,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:30:27,744 WARN L233 SmtUtils]: Spent 1.07m on a formula simplification. DAG size of input: 280 DAG size of output: 214 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:30:31,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:30:33,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:30:34,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:30:36,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:30:38,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:30:40,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:30:42,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:30:44,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:30:46,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:31:14,328 WARN L233 SmtUtils]: Spent 15.62s on a formula simplification. DAG size of input: 270 DAG size of output: 95 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:31:38,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:31:40,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:31:44,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:31:52,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:33:31,773 WARN L233 SmtUtils]: Spent 1.41m on a formula simplification. DAG size of input: 344 DAG size of output: 273 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:33:34,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:33:37,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:33:41,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:33:43,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:33:45,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:33:47,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:33:50,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:33:52,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:33:54,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:33:56,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:33:58,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:34:00,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:34:11,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:34:24,084 WARN L233 SmtUtils]: Spent 6.45s on a formula simplification. DAG size of input: 127 DAG size of output: 101 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:34:24,973 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse32 (select .cse1 .cse3))) (let ((.cse4 (+ .cse32 1)) (.cse6 (select |c_#length| |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (not (<= 0 .cse3))) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse9 (not (<= 0 .cse5))) (.cse10 (not (<= (+ |c_~#queue~0.offset| 1612) .cse6))) (.cse7 (= 400 .cse32)) (.cse14 (+ 1608 |c_~#queue~0.offset|)) (.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse3 .cse4)))) (and (or .cse0 (and (forall ((v_ArrVal_1010 Int) (v_ArrVal_1014 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_1010) .cse3 .cse4)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|) .cse5) 4)) .cse6)) (forall ((v_ArrVal_1010 Int) (v_ArrVal_1014 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_1010) .cse3 .cse4)) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|) .cse5) 4))))) .cse7 (not (<= (+ 1612 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)))) (or .cse0 .cse7 (and (forall ((v_ArrVal_1014 (Array Int Int))) (<= (+ (* (select (select (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) .cse6)) (forall ((v_ArrVal_1014 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))))) (or .cse9 .cse10 (and (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1002 Int)) (let ((.cse12 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_1002) .cse3 .cse4)) |c_~#stored_elements~0.base| v_ArrVal_1006) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1007))) (let ((.cse15 (select .cse12 |c_~#queue~0.base|))) (let ((.cse16 (+ (* (select .cse15 .cse5) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_1008 Int)) (let ((.cse13 (store .cse15 .cse16 v_ArrVal_1008))) (let ((.cse11 (select .cse13 .cse5))) (or (= 400 .cse11) (forall ((v_ArrVal_1010 Int) (v_ArrVal_1014 (Array Int Int))) (<= (+ (* (select (select (store (store .cse12 |c_~#queue~0.base| (store (store .cse13 .cse14 v_ArrVal_1010) .cse5 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) .cse6)))))) (not (<= 0 .cse16))))))) (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1002 Int)) (let ((.cse19 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_1002) .cse3 .cse4)) |c_~#stored_elements~0.base| v_ArrVal_1006) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1007))) (let ((.cse21 (select .cse19 |c_~#queue~0.base|))) (let ((.cse17 (+ (* (select .cse21 .cse5) 4) |c_~#queue~0.offset|))) (or (not (<= 0 .cse17)) (forall ((v_ArrVal_1008 Int)) (let ((.cse20 (store .cse21 .cse17 v_ArrVal_1008))) (let ((.cse18 (select .cse20 .cse5))) (or (= 400 .cse18) (forall ((v_ArrVal_1010 Int) (v_ArrVal_1014 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse19 |c_~#queue~0.base| (store (store .cse20 .cse14 v_ArrVal_1010) .cse5 (+ .cse18 1))) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))))))))))))) .cse7) (or .cse9 .cse10 .cse7 (and (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1006 (Array Int Int))) (let ((.cse24 (store (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1006) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1007))) (let ((.cse26 (select .cse24 |c_~#queue~0.base|))) (let ((.cse22 (+ (* (select .cse26 .cse5) 4) |c_~#queue~0.offset|))) (or (not (<= 0 .cse22)) (forall ((v_ArrVal_1008 Int)) (let ((.cse25 (store .cse26 .cse22 v_ArrVal_1008))) (let ((.cse23 (select .cse25 .cse5))) (or (= 400 .cse23) (forall ((v_ArrVal_1010 Int) (v_ArrVal_1014 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse24 |c_~#queue~0.base| (store (store .cse25 .cse14 v_ArrVal_1010) .cse5 (+ .cse23 1))) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|)))))))))))) (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1006 (Array Int Int))) (let ((.cse29 (store (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1006) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1007))) (let ((.cse31 (select .cse29 |c_~#queue~0.base|))) (let ((.cse27 (+ (* (select .cse31 .cse5) 4) |c_~#queue~0.offset|))) (or (not (<= 0 .cse27)) (forall ((v_ArrVal_1008 Int)) (let ((.cse30 (store .cse31 .cse27 v_ArrVal_1008))) (let ((.cse28 (select .cse30 .cse5))) (or (= 400 .cse28) (forall ((v_ArrVal_1010 Int) (v_ArrVal_1014 (Array Int Int))) (<= (+ (* (select (select (store (store .cse29 |c_~#queue~0.base| (store (store .cse30 .cse14 v_ArrVal_1010) .cse5 (+ .cse28 1))) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) .cse6)))))))))))))))))) is different from false [2022-11-25 18:34:25,049 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse0 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (select .cse6 .cse0))) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse6 .cse0 (+ .cse1 1)))) (.cse5 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (forall ((v_ArrVal_1014 (Array Int Int))) (<= (+ (* (select (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))) (.cse3 (forall ((v_ArrVal_1014 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))))) (and (or (not (<= 0 .cse0)) (= 400 .cse1) (and .cse2 .cse3)) .cse2 .cse3))))) is different from false [2022-11-25 18:34:27,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:34:37,081 WARN L233 SmtUtils]: Spent 6.78s on a formula simplification. DAG size of input: 155 DAG size of output: 114 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:34:54,962 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse20 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse0 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse19 (select .cse20 .cse0))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse20 .cse0 (+ .cse19 1)))) (.cse4 (select |c_#length| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse1 (= 400 .cse19)) (.cse5 (not (<= 0 .cse3))) (.cse6 (not (<= (+ |c_~#queue~0.offset| 1612) .cse4))) (.cse7 (let ((.cse12 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1006 (Array Int Int))) (let ((.cse10 (store (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1006) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1007))) (let ((.cse13 (select .cse10 |c_~#queue~0.base|))) (let ((.cse8 (+ (* (select .cse13 .cse3) 4) |c_~#queue~0.offset|))) (or (not (<= 0 .cse8)) (forall ((v_ArrVal_1008 Int)) (let ((.cse11 (store .cse13 .cse8 v_ArrVal_1008))) (let ((.cse9 (select .cse11 .cse3))) (or (= 400 .cse9) (forall ((v_ArrVal_1010 Int) (v_ArrVal_1014 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse12 v_ArrVal_1010) .cse3 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|)))))))))))) (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1006 (Array Int Int))) (let ((.cse16 (store (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1006) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1007))) (let ((.cse18 (select .cse16 |c_~#queue~0.base|))) (let ((.cse14 (+ (* (select .cse18 .cse3) 4) |c_~#queue~0.offset|))) (or (not (<= 0 .cse14)) (forall ((v_ArrVal_1008 Int)) (let ((.cse17 (store .cse18 .cse14 v_ArrVal_1008))) (let ((.cse15 (select .cse17 .cse3))) (or (= 400 .cse15) (forall ((v_ArrVal_1010 Int) (v_ArrVal_1014 (Array Int Int))) (<= (+ (* (select (select (store (store .cse16 |c_~#queue~0.base| (store (store .cse17 .cse12 v_ArrVal_1010) .cse3 (+ .cse15 1))) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse4))))))))))))))) (and (or (not (<= 0 .cse0)) .cse1 (and (forall ((v_ArrVal_1014 (Array Int Int))) (<= (+ (* (select (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse4)) (forall ((v_ArrVal_1014 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))))) (or .cse5 .cse6 .cse1 .cse7) (or .cse5 .cse6 .cse7)))))) is different from false [2022-11-25 18:34:57,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:34:58,463 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604)) (.cse1 (select |c_#length| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_1014 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|) .cse0))))) (or (not (<= 0 .cse0)) (not (<= (+ |c_~#queue~0.offset| 1612) .cse1)) (let ((.cse5 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1006 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1006) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1007))) (let ((.cse7 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (+ (* (select .cse7 .cse0) 4) |c_~#queue~0.offset|))) (or (not (<= 0 .cse2)) (forall ((v_ArrVal_1008 Int)) (let ((.cse4 (store .cse7 .cse2 v_ArrVal_1008))) (let ((.cse6 (select .cse4 .cse0))) (or (forall ((v_ArrVal_1010 Int) (v_ArrVal_1014 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1010) .cse0 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (= 400 .cse6)))))))))) (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1006 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1006) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1007))) (let ((.cse12 (select .cse9 |c_~#queue~0.base|))) (let ((.cse8 (+ (* (select .cse12 .cse0) 4) |c_~#queue~0.offset|))) (or (not (<= 0 .cse8)) (forall ((v_ArrVal_1008 Int)) (let ((.cse10 (store .cse12 .cse8 v_ArrVal_1008))) (let ((.cse11 (select .cse10 .cse0))) (or (forall ((v_ArrVal_1010 Int) (v_ArrVal_1014 (Array Int Int))) (<= (+ (* (select (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse5 v_ArrVal_1010) .cse0 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) .cse1)) (= 400 .cse11))))))))))))) (forall ((v_ArrVal_1014 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1014) |c_~#queue~0.base|) .cse0)) 4) .cse1)))) is different from false [2022-11-25 18:35:06,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:35:08,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:35:11,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:35:12,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:35:18,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:35:20,932 INFO L130 PetriNetUnfolder]: 3433/6725 cut-off events. [2022-11-25 18:35:20,932 INFO L131 PetriNetUnfolder]: For 68251/68307 co-relation queries the response was YES. [2022-11-25 18:35:20,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38568 conditions, 6725 events. 3433/6725 cut-off events. For 68251/68307 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 46375 event pairs, 951 based on Foata normal form. 73/6068 useless extension candidates. Maximal degree in co-relation 38522. Up to 3083 conditions per place. [2022-11-25 18:35:20,988 INFO L137 encePairwiseOnDemand]: 701/729 looper letters, 368 selfloop transitions, 164 changer transitions 0/536 dead transitions. [2022-11-25 18:35:20,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 536 transitions, 6671 flow [2022-11-25 18:35:20,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-25 18:35:20,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2022-11-25 18:35:20,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 7934 transitions. [2022-11-25 18:35:21,002 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.25912861715330854 [2022-11-25 18:35:21,003 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 7934 transitions. [2022-11-25 18:35:21,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 7934 transitions. [2022-11-25 18:35:21,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:35:21,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 7934 transitions. [2022-11-25 18:35:21,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 188.9047619047619) internal successors, (7934), 42 states have internal predecessors, (7934), 0 states have call successors, (0), 0 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-25 18:35:21,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 729.0) internal successors, (31347), 43 states have internal predecessors, (31347), 0 states have call successors, (0), 0 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-25 18:35:21,045 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 729.0) internal successors, (31347), 43 states have internal predecessors, (31347), 0 states have call successors, (0), 0 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-25 18:35:21,045 INFO L175 Difference]: Start difference. First operand has 161 places, 196 transitions, 1666 flow. Second operand 42 states and 7934 transitions. [2022-11-25 18:35:21,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 536 transitions, 6671 flow [2022-11-25 18:35:21,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 536 transitions, 6613 flow, removed 18 selfloop flow, removed 7 redundant places. [2022-11-25 18:35:21,109 INFO L231 Difference]: Finished difference. Result has 216 places, 304 transitions, 3605 flow [2022-11-25 18:35:21,109 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=729, PETRI_DIFFERENCE_MINUEND_FLOW=1605, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=3605, PETRI_PLACES=216, PETRI_TRANSITIONS=304} [2022-11-25 18:35:21,109 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, 110 predicate places. [2022-11-25 18:35:21,110 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 304 transitions, 3605 flow [2022-11-25 18:35:21,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 180.53488372093022) internal successors, (7763), 43 states have internal predecessors, (7763), 0 states have call successors, (0), 0 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-25 18:35:21,110 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:35:21,111 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-25 18:35:21,119 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 18:35:21,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:35:21,317 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-25 18:35:21,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:35:21,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1097805663, now seen corresponding path program 4 times [2022-11-25 18:35:21,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:35:21,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112533345] [2022-11-25 18:35:21,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:35:21,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:35:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:23,993 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:35:23,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:35:23,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112533345] [2022-11-25 18:35:23,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112533345] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:35:23,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78360143] [2022-11-25 18:35:23,994 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 18:35:23,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:35:23,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:35:23,996 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:35:23,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 18:35:24,190 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 18:35:24,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:35:24,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 87 conjunts are in the unsatisfiable core [2022-11-25 18:35:24,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:35:24,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2022-11-25 18:35:24,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:35:24,290 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-25 18:35:24,291 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 2 case distinctions, treesize of input 12 treesize of output 24 [2022-11-25 18:35:24,321 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:35:24,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 11 [2022-11-25 18:35:24,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 18:35:24,694 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:35:24,721 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-25 18:35:24,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 39 [2022-11-25 18:35:25,010 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 23 treesize of output 22 [2022-11-25 18:35:25,234 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 31 treesize of output 15 [2022-11-25 18:35:25,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:35:25,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 18:35:25,534 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:35:25,561 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-25 18:35:25,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 34 [2022-11-25 18:35:25,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2022-11-25 18:35:26,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 22 [2022-11-25 18:35:26,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:35:26,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-25 18:35:26,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:35:26,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-25 18:35:26,524 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:35:26,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:35:26,674 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1130 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1130) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1130 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1130) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-25 18:35:26,706 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1130 (Array Int Int))) (<= (+ (* 4 (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1129) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1130) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1130 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1129) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1130) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset|))))) is different from false [2022-11-25 18:35:26,999 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1130 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1129) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1130) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1130 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1129) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1130) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-25 18:35:34,941 WARN L233 SmtUtils]: Spent 6.10s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:35:34,999 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1122))) (let ((.cse6 (select .cse2 |c_~#queue~0.base|))) (let ((.cse0 (+ (* 4 (select .cse6 .cse5)) |c_~#queue~0.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_1123 Int)) (let ((.cse3 (store .cse6 .cse0 v_ArrVal_1123))) (let ((.cse1 (select .cse3 .cse5))) (or (= 400 .cse1) (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1125 Int) (v_ArrVal_1130 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1125) .cse5 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_1129) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1130) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|)))))))))))) (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1122))) (let ((.cse10 (select .cse7 |c_~#queue~0.base|))) (let ((.cse11 (+ (* 4 (select .cse10 .cse5)) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_1123 Int)) (let ((.cse8 (store .cse10 .cse11 v_ArrVal_1123))) (let ((.cse9 (select .cse8 .cse5))) (or (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1125 Int) (v_ArrVal_1130 (Array Int Int))) (<= (+ (* (select (select (store (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse4 v_ArrVal_1125) .cse5 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_1129) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1130) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (= 400 .cse9))))) (not (<= 0 .cse11))))))))) is different from false [2022-11-25 18:35:35,079 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))))) (and (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse1 (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1122))) (let ((.cse6 (select .cse1 |c_~#queue~0.base|))) (let ((.cse0 (+ (* (select .cse6 .cse4) 4) |c_~#queue~0.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_1123 Int)) (let ((.cse2 (store .cse6 .cse0 v_ArrVal_1123))) (let ((.cse5 (select .cse2 .cse4))) (or (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1125 Int) (v_ArrVal_1130 (Array Int Int))) (<= (+ (* 4 (select (select (store (store (store .cse1 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_1125) .cse4 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1129) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1130) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (= 400 .cse5)))))))))) (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse9 (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1122))) (let ((.cse12 (select .cse9 |c_~#queue~0.base|))) (let ((.cse8 (+ (* (select .cse12 .cse4) 4) |c_~#queue~0.offset|))) (or (not (<= 0 .cse8)) (forall ((v_ArrVal_1123 Int)) (let ((.cse10 (store .cse12 .cse8 v_ArrVal_1123))) (let ((.cse11 (select .cse10 .cse4))) (or (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1125 Int) (v_ArrVal_1130 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse3 v_ArrVal_1125) .cse4 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_1129) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1130) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset|))) (= 400 .cse11)))))))))))) is different from false [2022-11-25 18:35:35,160 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse13 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse14 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse13 .cse14 (+ (select .cse13 .cse14) 1)))))) (and (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse0 (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1122))) (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (let ((.cse6 (+ (* (select .cse5 .cse3) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_1123 Int)) (let ((.cse1 (store .cse5 .cse6 v_ArrVal_1123))) (let ((.cse4 (select .cse1 .cse3))) (or (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1125 Int) (v_ArrVal_1130 (Array Int Int))) (<= (+ (* (select (select (store (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_1125) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1129) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1130) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (= 400 .cse4))))) (not (<= 0 .cse6))))))) (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse9 (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1122))) (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (let ((.cse12 (+ (* (select .cse11 .cse3) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_1123 Int)) (let ((.cse10 (store .cse11 .cse12 v_ArrVal_1123))) (let ((.cse8 (select .cse10 .cse3))) (or (= 400 .cse8) (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1125 Int) (v_ArrVal_1130 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse2 v_ArrVal_1125) .cse3 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_1129) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1130) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))))))) (not (<= 0 .cse12))))))))) is different from false [2022-11-25 18:35:42,656 WARN L233 SmtUtils]: Spent 5.63s on a formula simplification that was a NOOP. DAG size: 81 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:35:45,412 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 2 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-25 18:35:45,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78360143] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:35:45,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:35:45,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 17] total 41 [2022-11-25 18:35:45,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300607324] [2022-11-25 18:35:45,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:35:45,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-25 18:35:45,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:35:45,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-25 18:35:45,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1143, Unknown=20, NotChecked=450, Total=1806 [2022-11-25 18:35:47,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:35:49,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:35:51,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:35:53,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:35:55,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:35:55,766 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 729 [2022-11-25 18:35:55,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 304 transitions, 3605 flow. Second operand has 43 states, 43 states have (on average 180.53488372093022) internal successors, (7763), 43 states have internal predecessors, (7763), 0 states have call successors, (0), 0 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-25 18:35:55,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:35:55,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 729 [2022-11-25 18:35:55,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:36:06,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:37:14,569 WARN L233 SmtUtils]: Spent 1.00m on a formula simplification. DAG size of input: 190 DAG size of output: 59 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:37:25,048 WARN L233 SmtUtils]: Spent 6.59s on a formula simplification that was a NOOP. DAG size: 216 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:37:27,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:37:37,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:37:39,220 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse18 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse11 (select .cse17 .cse18))) (let ((.cse5 (select |c_#length| |c_~#queue~0.base|)) (.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse17 .cse18 (+ .cse11 1)))) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse9 (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1130 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1129) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1130) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|)))) (.cse10 (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1130 (Array Int Int))) (<= (+ (* (select (select (store (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1129) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1130) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse5))) (.cse2 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse0 (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1122))) (let ((.cse6 (select .cse0 |c_~#queue~0.base|))) (let ((.cse7 (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_1123 Int)) (let ((.cse1 (store .cse6 .cse7 v_ArrVal_1123))) (let ((.cse4 (select .cse1 .cse3))) (or (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1125 Int) (v_ArrVal_1130 (Array Int Int))) (<= (+ (* (select (select (store (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_1125) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1129) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1130) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse5)) (= 400 .cse4))))) (not (<= 0 .cse7))))))) .cse9 .cse10 (or (and .cse9 .cse10) (= 400 .cse11)) (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse13 (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1122))) (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (let ((.cse16 (+ (* (select .cse15 .cse3) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_1123 Int)) (let ((.cse14 (store .cse15 .cse16 v_ArrVal_1123))) (let ((.cse12 (select .cse14 .cse3))) (or (= 400 .cse12) (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1125 Int) (v_ArrVal_1130 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store .cse13 |c_~#queue~0.base| (store (store .cse14 .cse2 v_ArrVal_1125) .cse3 (+ .cse12 1))) |c_~#stored_elements~0.base| v_ArrVal_1129) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1130) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))))))) (not (<= 0 .cse16)))))))))))) is different from false [2022-11-25 18:37:39,426 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#length| |c_~#queue~0.base|)) (.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))))) (and (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1130 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* 4 (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1129) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1130) |c_~#queue~0.base|) .cse1))) .cse2)) (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1130 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1129) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1130) |c_~#queue~0.base|) .cse1))))) (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse4 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1122))) (let ((.cse8 (select .cse4 |c_~#queue~0.base|))) (let ((.cse3 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|))) (or (not (<= 0 .cse3)) (forall ((v_ArrVal_1123 Int)) (let ((.cse5 (store .cse8 .cse3 v_ArrVal_1123))) (let ((.cse7 (select .cse5 .cse1))) (or (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1125 Int) (v_ArrVal_1130 (Array Int Int))) (<= (+ (* 4 (select (select (store (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_1125) .cse1 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_1129) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1130) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) .cse2)) (= 400 .cse7)))))))))) (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse10 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1122))) (let ((.cse13 (select .cse10 |c_~#queue~0.base|))) (let ((.cse9 (+ (* (select .cse13 .cse1) 4) |c_~#queue~0.offset|))) (or (not (<= 0 .cse9)) (forall ((v_ArrVal_1123 Int)) (let ((.cse11 (store .cse13 .cse9 v_ArrVal_1123))) (let ((.cse12 (select .cse11 .cse1))) (or (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1125 Int) (v_ArrVal_1130 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse6 v_ArrVal_1125) .cse1 (+ .cse12 1))) |c_~#stored_elements~0.base| v_ArrVal_1129) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1130) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))) (= 400 .cse12)))))))))))) is different from false [2022-11-25 18:37:39,765 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (select |c_#length| |c_~#queue~0.base|)) (.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1130 (Array Int Int))) (<= (+ (* 4 (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1129) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1130) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset| 4) .cse1)) (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1122))) (let ((.cse7 (select .cse4 |c_~#queue~0.base|))) (let ((.cse2 (+ (* 4 (select .cse7 .cse0)) |c_~#queue~0.offset|))) (or (not (<= 0 .cse2)) (forall ((v_ArrVal_1123 Int)) (let ((.cse5 (store .cse7 .cse2 v_ArrVal_1123))) (let ((.cse3 (select .cse5 .cse0))) (or (= 400 .cse3) (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1125 Int) (v_ArrVal_1130 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_1125) .cse0 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_1129) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1130) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|)))))))))))) (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1130 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1129) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1130) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1122))) (let ((.cse11 (select .cse8 |c_~#queue~0.base|))) (let ((.cse12 (+ (* 4 (select .cse11 .cse0)) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_1123 Int)) (let ((.cse9 (store .cse11 .cse12 v_ArrVal_1123))) (let ((.cse10 (select .cse9 .cse0))) (or (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1125 Int) (v_ArrVal_1130 (Array Int Int))) (<= (+ (* (select (select (store (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse6 v_ArrVal_1125) .cse0 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_1129) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1130) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) .cse1)) (= 400 .cse10))))) (not (<= 0 .cse12))))))))) is different from false [2022-11-25 18:37:40,198 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse5 (select |c_#length| |c_~#queue~0.base|))) (and (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|))) (or (not (<= 0 .cse0)) (let ((.cse2 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1123 Int)) (let ((.cse1 (store .cse6 .cse0 v_ArrVal_1123))) (let ((.cse4 (select .cse1 .cse3))) (or (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1125 Int) (v_ArrVal_1130 (Array Int Int))) (<= (+ (* (select (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_1125) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1129) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1130) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse5)) (= 400 .cse4))))) (forall ((v_ArrVal_1123 Int)) (let ((.cse8 (store .cse6 .cse0 v_ArrVal_1123))) (let ((.cse7 (select .cse8 .cse3))) (or (= 400 .cse7) (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1125 Int) (v_ArrVal_1130 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse8 .cse2 v_ArrVal_1125) .cse3 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_1129) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1130) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|)))))))))))) (forall ((v_ArrVal_1130 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1130) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1130 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1130) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse5)))) is different from false [2022-11-25 18:37:43,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:37:45,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:37:47,851 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select .cse5 .cse6))) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse5 .cse6 (+ .cse2 1)))) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1130 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1129) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1130) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))) (.cse1 (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1130 (Array Int Int))) (<= (+ (* (select (select (store (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1129) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1130) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) (and .cse0 .cse1 (or (and .cse0 .cse1) (= 400 .cse2))))))) is different from false [2022-11-25 18:37:52,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:37:54,021 INFO L130 PetriNetUnfolder]: 4022/7801 cut-off events. [2022-11-25 18:37:54,021 INFO L131 PetriNetUnfolder]: For 262395/262511 co-relation queries the response was YES. [2022-11-25 18:37:54,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69826 conditions, 7801 events. 4022/7801 cut-off events. For 262395/262511 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 54849 event pairs, 1245 based on Foata normal form. 27/6994 useless extension candidates. Maximal degree in co-relation 69761. Up to 3717 conditions per place. [2022-11-25 18:37:54,118 INFO L137 encePairwiseOnDemand]: 707/729 looper letters, 320 selfloop transitions, 191 changer transitions 0/515 dead transitions. [2022-11-25 18:37:54,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 515 transitions, 9714 flow [2022-11-25 18:37:54,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-25 18:37:54,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-11-25 18:37:54,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 5291 transitions. [2022-11-25 18:37:54,127 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.2592102684695277 [2022-11-25 18:37:54,128 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 5291 transitions. [2022-11-25 18:37:54,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 5291 transitions. [2022-11-25 18:37:54,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:37:54,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 5291 transitions. [2022-11-25 18:37:54,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 188.96428571428572) internal successors, (5291), 28 states have internal predecessors, (5291), 0 states have call successors, (0), 0 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-25 18:37:54,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 729.0) internal successors, (21141), 29 states have internal predecessors, (21141), 0 states have call successors, (0), 0 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-25 18:37:54,158 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 729.0) internal successors, (21141), 29 states have internal predecessors, (21141), 0 states have call successors, (0), 0 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-25 18:37:54,159 INFO L175 Difference]: Start difference. First operand has 216 places, 304 transitions, 3605 flow. Second operand 28 states and 5291 transitions. [2022-11-25 18:37:54,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 515 transitions, 9714 flow [2022-11-25 18:37:54,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 515 transitions, 8541 flow, removed 575 selfloop flow, removed 6 redundant places. [2022-11-25 18:37:54,428 INFO L231 Difference]: Finished difference. Result has 253 places, 395 transitions, 5281 flow [2022-11-25 18:37:54,429 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=729, PETRI_DIFFERENCE_MINUEND_FLOW=2637, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=5281, PETRI_PLACES=253, PETRI_TRANSITIONS=395} [2022-11-25 18:37:54,430 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, 147 predicate places. [2022-11-25 18:37:54,430 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 395 transitions, 5281 flow [2022-11-25 18:37:54,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 180.53488372093022) internal successors, (7763), 43 states have internal predecessors, (7763), 0 states have call successors, (0), 0 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-25 18:37:54,431 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:37:54,431 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:37:54,437 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 18:37:54,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-25 18:37:54,633 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-25 18:37:54,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:37:54,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1442141764, now seen corresponding path program 1 times [2022-11-25 18:37:54,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:37:54,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047225699] [2022-11-25 18:37:54,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:37:54,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:37:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:37:54,797 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 18:37:54,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:37:54,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047225699] [2022-11-25 18:37:54,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047225699] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:37:54,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:37:54,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:37:54,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801210148] [2022-11-25 18:37:54,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:37:54,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:37:54,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:37:54,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:37:54,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:37:54,838 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 729 [2022-11-25 18:37:54,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 395 transitions, 5281 flow. Second operand has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 0 states have call successors, (0), 0 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-25 18:37:54,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:37:54,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 729 [2022-11-25 18:37:54,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:37:57,131 INFO L130 PetriNetUnfolder]: 2766/5868 cut-off events. [2022-11-25 18:37:57,131 INFO L131 PetriNetUnfolder]: For 415228/415228 co-relation queries the response was YES. [2022-11-25 18:37:57,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56873 conditions, 5868 events. 2766/5868 cut-off events. For 415228/415228 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 40811 event pairs, 468 based on Foata normal form. 350/5747 useless extension candidates. Maximal degree in co-relation 56792. Up to 4322 conditions per place. [2022-11-25 18:37:57,197 INFO L137 encePairwiseOnDemand]: 724/729 looper letters, 304 selfloop transitions, 5 changer transitions 0/341 dead transitions. [2022-11-25 18:37:57,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 341 transitions, 5070 flow [2022-11-25 18:37:57,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:37:57,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:37:57,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 880 transitions. [2022-11-25 18:37:57,199 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4023776863283036 [2022-11-25 18:37:57,199 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 880 transitions. [2022-11-25 18:37:57,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 880 transitions. [2022-11-25 18:37:57,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:37:57,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 880 transitions. [2022-11-25 18:37:57,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 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-25 18:37:57,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 729.0) internal successors, (2916), 4 states have internal predecessors, (2916), 0 states have call successors, (0), 0 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-25 18:37:57,203 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 729.0) internal successors, (2916), 4 states have internal predecessors, (2916), 0 states have call successors, (0), 0 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-25 18:37:57,203 INFO L175 Difference]: Start difference. First operand has 253 places, 395 transitions, 5281 flow. Second operand 3 states and 880 transitions. [2022-11-25 18:37:57,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 341 transitions, 5070 flow [2022-11-25 18:37:57,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 341 transitions, 3977 flow, removed 497 selfloop flow, removed 12 redundant places. [2022-11-25 18:37:57,406 INFO L231 Difference]: Finished difference. Result has 243 places, 327 transitions, 3135 flow [2022-11-25 18:37:57,406 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=729, PETRI_DIFFERENCE_MINUEND_FLOW=3125, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3135, PETRI_PLACES=243, PETRI_TRANSITIONS=327} [2022-11-25 18:37:57,407 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, 137 predicate places. [2022-11-25 18:37:57,407 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 327 transitions, 3135 flow [2022-11-25 18:37:57,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 0 states have call successors, (0), 0 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-25 18:37:57,408 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:37:57,408 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2022-11-25 18:37:57,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-25 18:37:57,408 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-25 18:37:57,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:37:57,409 INFO L85 PathProgramCache]: Analyzing trace with hash -364716951, now seen corresponding path program 5 times [2022-11-25 18:37:57,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:37:57,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766534596] [2022-11-25 18:37:57,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:37:57,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:37:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:38:01,795 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:38:01,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:38:01,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766534596] [2022-11-25 18:38:01,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766534596] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:38:01,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725377547] [2022-11-25 18:38:01,796 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 18:38:01,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:38:01,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:38:01,797 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:38:01,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4173f06b-a4cd-4d6e-909a-6d89d7109fe8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 18:38:02,164 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-11-25 18:38:02,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:38:02,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 101 conjunts are in the unsatisfiable core [2022-11-25 18:38:02,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:38:02,255 INFO L321 Elim1Store]: treesize reduction 37, result has 32.7 percent of original size [2022-11-25 18:38:02,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 15 treesize of output 26 [2022-11-25 18:38:03,397 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 32 treesize of output 16 [2022-11-25 18:38:03,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:38:03,564 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 22 treesize of output 21 [2022-11-25 18:38:03,926 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:38:03,947 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-25 18:38:03,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 35 [2022-11-25 18:38:04,232 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 37 treesize of output 30 [2022-11-25 18:38:04,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 27 [2022-11-25 18:38:04,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:38:04,931 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 40 treesize of output 38 [2022-11-25 18:38:05,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:38:05,149 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 40 treesize of output 38 [2022-11-25 18:38:05,459 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:38:05,480 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-25 18:38:05,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 49 [2022-11-25 18:38:05,822 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 63 treesize of output 44 [2022-11-25 18:38:06,478 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 81 treesize of output 41 [2022-11-25 18:38:06,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:38:06,753 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 65 treesize of output 59 [2022-11-25 18:38:06,988 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:38:06,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:38:07,124 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1304 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1304) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_1304 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1304) |c_~#queue~0.base|) .cse0) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-25 18:38:14,163 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (select |c_#length| |c_~#queue~0.base|)) (.cse6 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1296) |c_~#stored_elements~0.base| v_ArrVal_1297))) (let ((.cse7 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (* 4 (select .cse7 .cse6)))) (or (not (<= (+ .cse0 |c_~#queue~0.offset| 4) .cse1)) (forall ((v_ArrVal_1298 Int)) (let ((.cse4 (store .cse7 (+ .cse0 |c_~#queue~0.offset|) v_ArrVal_1298))) (let ((.cse2 (select .cse4 .cse6))) (or (= 400 .cse2) (forall ((v_ArrVal_1304 (Array Int Int)) (v_ArrVal_1301 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1301) .cse6 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_1304) |c_~#queue~0.base|) .cse6) 4))))))))))))) (forall ((v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1296) |c_~#stored_elements~0.base| v_ArrVal_1297))) (let ((.cse12 (select .cse9 |c_~#queue~0.base|))) (let ((.cse8 (* 4 (select .cse12 .cse6)))) (or (not (<= (+ .cse8 |c_~#queue~0.offset| 4) .cse1)) (forall ((v_ArrVal_1298 Int)) (let ((.cse10 (store .cse12 (+ .cse8 |c_~#queue~0.offset|) v_ArrVal_1298))) (let ((.cse11 (select .cse10 .cse6))) (or (forall ((v_ArrVal_1304 (Array Int Int)) (v_ArrVal_1301 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse5 v_ArrVal_1301) .cse6 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_1304) |c_~#queue~0.base|) .cse6) 4) 4) .cse1)) (= 400 .cse11)))))))))))) is different from false [2022-11-25 18:38:14,916 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (select |c_#length| |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 1604)) (.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse14 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse15 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse14 .cse15 (+ (select .cse14 .cse15) 1)))))) (and (forall ((v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int))) (let ((.cse2 (store (store .cse8 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1296) |c_~#stored_elements~0.base| v_ArrVal_1297))) (let ((.cse7 (select .cse2 |c_~#queue~0.base|))) (let ((.cse0 (* (select .cse7 .cse5) 4))) (or (not (<= (+ |c_~#queue~0.offset| .cse0 4) .cse1)) (forall ((v_ArrVal_1298 Int)) (let ((.cse3 (store .cse7 (+ |c_~#queue~0.offset| .cse0) v_ArrVal_1298))) (let ((.cse6 (select .cse3 .cse5))) (or (forall ((v_ArrVal_1304 (Array Int Int)) (v_ArrVal_1301 Int)) (<= 0 (+ (* (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1301) .cse5 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1304) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (= 400 .cse6)))))))))) (forall ((v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int))) (let ((.cse10 (store (store .cse8 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1296) |c_~#stored_elements~0.base| v_ArrVal_1297))) (let ((.cse13 (select .cse10 |c_~#queue~0.base|))) (let ((.cse9 (* (select .cse13 .cse5) 4))) (or (not (<= (+ |c_~#queue~0.offset| .cse9 4) .cse1)) (forall ((v_ArrVal_1298 Int)) (let ((.cse11 (store .cse13 (+ |c_~#queue~0.offset| .cse9) v_ArrVal_1298))) (let ((.cse12 (select .cse11 .cse5))) (or (forall ((v_ArrVal_1304 (Array Int Int)) (v_ArrVal_1301 Int)) (<= (+ (* (select (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse4 v_ArrVal_1301) .cse5 (+ .cse12 1))) |c_~#stored_elements~0.base| v_ArrVal_1304) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) .cse1)) (= 400 .cse12)))))))))))) is different from false [2022-11-25 18:38:27,708 WARN L233 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:39:19,233 WARN L233 SmtUtils]: Spent 28.86s on a formula simplification. DAG size of input: 461 DAG size of output: 279 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-25 18:39:19,234 INFO L321 Elim1Store]: treesize reduction 2228, result has 35.0 percent of original size [2022-11-25 18:39:19,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 8 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 12 new quantified variables, introduced 51 case distinctions, treesize of input 14643 treesize of output 4305 [2022-11-25 18:39:20,604 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:39:23,329 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:39:23,722 INFO L217 Elim1Store]: Index analysis took 4065 ms [2022-11-25 18:39:29,048 WARN L233 SmtUtils]: Spent 5.32s on a formula simplification. DAG size of input: 112 DAG size of output: 19 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-25 18:39:29,048 INFO L321 Elim1Store]: treesize reduction 280, result has 8.2 percent of original size [2022-11-25 18:39:29,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 7 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 31 case distinctions, treesize of input 3251 treesize of output 4301 [2022-11-25 18:39:33,061 INFO L217 Elim1Store]: Index analysis took 1505 ms