./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2bf204635285748ea2bd88f763410b9afff54eeccde3aa0a970ff723633af9c2 --- 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-8393723 [2022-11-18 19:35:12,857 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 19:35:12,859 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 19:35:12,886 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 19:35:12,887 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 19:35:12,888 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 19:35:12,889 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 19:35:12,891 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 19:35:12,893 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 19:35:12,894 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 19:35:12,895 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 19:35:12,896 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 19:35:12,897 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 19:35:12,898 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 19:35:12,900 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 19:35:12,901 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 19:35:12,902 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 19:35:12,903 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 19:35:12,905 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 19:35:12,907 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 19:35:12,909 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 19:35:12,910 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 19:35:12,912 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 19:35:12,913 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 19:35:12,916 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 19:35:12,917 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 19:35:12,917 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 19:35:12,918 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 19:35:12,919 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 19:35:12,920 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 19:35:12,920 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 19:35:12,921 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 19:35:12,922 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 19:35:12,923 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 19:35:12,924 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 19:35:12,924 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 19:35:12,925 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 19:35:12,926 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 19:35:12,926 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 19:35:12,927 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 19:35:12,928 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 19:35:12,929 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 19:35:12,955 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 19:35:12,960 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 19:35:12,961 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 19:35:12,962 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 19:35:12,963 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 19:35:12,964 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 19:35:12,964 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 19:35:12,965 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 19:35:12,965 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 19:35:12,965 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 19:35:12,966 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 19:35:12,966 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 19:35:12,967 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 19:35:12,967 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 19:35:12,967 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 19:35:12,967 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 19:35:12,967 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 19:35:12,968 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 19:35:12,968 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 19:35:12,968 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 19:35:12,968 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 19:35:12,969 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 19:35:12,969 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 19:35:12,969 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 19:35:12,969 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:35:12,969 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 19:35:12,971 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 19:35:12,971 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 19:35:12,972 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 19:35:12,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 19:35:12,972 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 19:35:12,972 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 19:35:12,973 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 19:35:12,973 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/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_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> 2bf204635285748ea2bd88f763410b9afff54eeccde3aa0a970ff723633af9c2 [2022-11-18 19:35:13,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 19:35:13,280 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 19:35:13,284 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 19:35:13,285 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 19:35:13,286 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 19:35:13,287 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c [2022-11-18 19:35:13,365 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/data/3aa459a31/b5b76c9693b24d629201932e31ca8f4c/FLAGdf58640ae [2022-11-18 19:35:13,889 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 19:35:13,889 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c [2022-11-18 19:35:13,899 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/data/3aa459a31/b5b76c9693b24d629201932e31ca8f4c/FLAGdf58640ae [2022-11-18 19:35:14,237 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/data/3aa459a31/b5b76c9693b24d629201932e31ca8f4c [2022-11-18 19:35:14,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 19:35:14,245 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 19:35:14,250 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 19:35:14,251 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 19:35:14,255 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 19:35:14,255 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:35:14" (1/1) ... [2022-11-18 19:35:14,258 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a8813ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:35:14, skipping insertion in model container [2022-11-18 19:35:14,258 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:35:14" (1/1) ... [2022-11-18 19:35:14,266 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 19:35:14,291 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 19:35:14,569 WARN L234 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_453a8c36-fad5-4a53-8080-640bdc45003a/sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c[2618,2631] [2022-11-18 19:35:14,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:35:14,586 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 19:35:14,610 WARN L234 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_453a8c36-fad5-4a53-8080-640bdc45003a/sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c[2618,2631] [2022-11-18 19:35:14,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:35:14,628 INFO L208 MainTranslator]: Completed translation [2022-11-18 19:35:14,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:35:14 WrapperNode [2022-11-18 19:35:14,629 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 19:35:14,630 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 19:35:14,630 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 19:35:14,630 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 19:35:14,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:35:14" (1/1) ... [2022-11-18 19:35:14,670 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:35:14" (1/1) ... [2022-11-18 19:35:14,704 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 186 [2022-11-18 19:35:14,711 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 19:35:14,712 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 19:35:14,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 19:35:14,713 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 19:35:14,722 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:35:14" (1/1) ... [2022-11-18 19:35:14,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:35:14" (1/1) ... [2022-11-18 19:35:14,743 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:35:14" (1/1) ... [2022-11-18 19:35:14,744 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:35:14" (1/1) ... [2022-11-18 19:35:14,754 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:35:14" (1/1) ... [2022-11-18 19:35:14,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:35:14" (1/1) ... [2022-11-18 19:35:14,773 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:35:14" (1/1) ... [2022-11-18 19:35:14,787 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:35:14" (1/1) ... [2022-11-18 19:35:14,790 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 19:35:14,791 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 19:35:14,791 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 19:35:14,791 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 19:35:14,792 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:35:14" (1/1) ... [2022-11-18 19:35:14,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:35:14,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:35:14,837 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 19:35:14,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 19:35:14,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 19:35:14,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 19:35:14,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 19:35:14,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 19:35:14,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 19:35:14,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 19:35:14,897 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-18 19:35:14,897 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-18 19:35:14,898 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-18 19:35:14,898 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-18 19:35:14,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 19:35:14,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 19:35:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 19:35:14,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 19:35:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 19:35:14,900 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 19:35:15,053 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 19:35:15,056 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 19:35:15,629 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 19:35:15,641 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 19:35:15,641 INFO L300 CfgBuilder]: Removed 7 assume(true) statements. [2022-11-18 19:35:15,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:35:15 BoogieIcfgContainer [2022-11-18 19:35:15,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 19:35:15,647 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 19:35:15,647 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 19:35:15,650 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 19:35:15,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:35:14" (1/3) ... [2022-11-18 19:35:15,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ed1c16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:35:15, skipping insertion in model container [2022-11-18 19:35:15,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:35:14" (2/3) ... [2022-11-18 19:35:15,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ed1c16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:35:15, skipping insertion in model container [2022-11-18 19:35:15,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:35:15" (3/3) ... [2022-11-18 19:35:15,654 INFO L112 eAbstractionObserver]: Analyzing ICFG loop-tiling-eq.wvr.c [2022-11-18 19:35:15,663 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 19:35:15,674 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 19:35:15,674 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 19:35:15,674 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 19:35:15,798 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-18 19:35:15,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 260 places, 279 transitions, 574 flow [2022-11-18 19:35:16,076 INFO L130 PetriNetUnfolder]: 26/277 cut-off events. [2022-11-18 19:35:16,076 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-18 19:35:16,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 277 events. 26/277 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 267 event pairs, 0 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 211. Up to 2 conditions per place. [2022-11-18 19:35:16,086 INFO L82 GeneralOperation]: Start removeDead. Operand has 260 places, 279 transitions, 574 flow [2022-11-18 19:35:16,102 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 249 places, 268 transitions, 548 flow [2022-11-18 19:35:16,126 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 19:35:16,138 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@13000b3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 19:35:16,138 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-11-18 19:35:16,212 INFO L130 PetriNetUnfolder]: 26/267 cut-off events. [2022-11-18 19:35:16,212 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-18 19:35:16,212 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:35:16,213 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:35:16,214 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-18 19:35:16,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:35:16,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1271548424, now seen corresponding path program 1 times [2022-11-18 19:35:16,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:35:16,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301592139] [2022-11-18 19:35:16,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:35:16,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:35:16,427 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 19:35:16,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [580743859] [2022-11-18 19:35:16,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:35:16,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:35:16,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:35:16,435 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:35:16,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 19:35:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:35:16,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-18 19:35:16,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:35:16,731 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-18 19:35:16,732 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:35:16,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:35:16,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301592139] [2022-11-18 19:35:16,733 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 19:35:16,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580743859] [2022-11-18 19:35:16,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580743859] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:35:16,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:35:16,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:35:16,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631865686] [2022-11-18 19:35:16,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:35:16,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 19:35:16,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:35:16,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 19:35:16,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 19:35:16,788 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 279 [2022-11-18 19:35:16,792 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 268 transitions, 548 flow. Second operand has 2 states, 2 states have (on average 259.5) internal successors, (519), 2 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:35:16,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:35:16,793 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 279 [2022-11-18 19:35:16,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:35:16,852 INFO L130 PetriNetUnfolder]: 7/249 cut-off events. [2022-11-18 19:35:16,852 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-11-18 19:35:16,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 249 events. 7/249 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 243 event pairs, 0 based on Foata normal form. 22/252 useless extension candidates. Maximal degree in co-relation 197. Up to 5 conditions per place. [2022-11-18 19:35:16,856 INFO L137 encePairwiseOnDemand]: 260/279 looper letters, 4 selfloop transitions, 0 changer transitions 12/249 dead transitions. [2022-11-18 19:35:16,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 249 transitions, 518 flow [2022-11-18 19:35:16,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 19:35:16,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-18 19:35:16,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 533 transitions. [2022-11-18 19:35:16,880 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9551971326164874 [2022-11-18 19:35:16,881 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 533 transitions. [2022-11-18 19:35:16,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 533 transitions. [2022-11-18 19:35:16,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:35:16,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 533 transitions. [2022-11-18 19:35:16,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 266.5) internal successors, (533), 2 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:35:16,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:35:16,907 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:35:16,909 INFO L175 Difference]: Start difference. First operand has 249 places, 268 transitions, 548 flow. Second operand 2 states and 533 transitions. [2022-11-18 19:35:16,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 249 transitions, 518 flow [2022-11-18 19:35:16,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 249 transitions, 510 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-18 19:35:16,923 INFO L231 Difference]: Finished difference. Result has 246 places, 237 transitions, 478 flow [2022-11-18 19:35:16,925 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=478, PETRI_PLACES=246, PETRI_TRANSITIONS=237} [2022-11-18 19:35:16,931 INFO L288 CegarLoopForPetriNet]: 249 programPoint places, -3 predicate places. [2022-11-18 19:35:16,932 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 237 transitions, 478 flow [2022-11-18 19:35:16,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 259.5) internal successors, (519), 2 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:35:16,933 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:35:16,933 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:35:16,946 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 19:35:17,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-11-18 19:35:17,141 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-18 19:35:17,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:35:17,141 INFO L85 PathProgramCache]: Analyzing trace with hash 210670543, now seen corresponding path program 1 times [2022-11-18 19:35:17,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:35:17,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179767023] [2022-11-18 19:35:17,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:35:17,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:35:17,197 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 19:35:17,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [458305384] [2022-11-18 19:35:17,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:35:17,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:35:17,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:35:17,206 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:35:17,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 19:35:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:35:17,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 19:35:17,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:35:17,596 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-18 19:35:17,597 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:35:17,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:35:17,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179767023] [2022-11-18 19:35:17,597 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 19:35:17,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458305384] [2022-11-18 19:35:17,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458305384] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:35:17,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:35:17,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:35:17,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659554169] [2022-11-18 19:35:17,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:35:17,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:35:17,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:35:17,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:35:17,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:35:17,604 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 279 [2022-11-18 19:35:17,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 237 transitions, 478 flow. Second operand has 6 states, 6 states have (on average 190.66666666666666) internal successors, (1144), 6 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:35:17,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:35:17,607 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 279 [2022-11-18 19:35:17,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:35:17,880 INFO L130 PetriNetUnfolder]: 21/377 cut-off events. [2022-11-18 19:35:17,880 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-11-18 19:35:17,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 377 events. 21/377 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 680 event pairs, 4 based on Foata normal form. 1/356 useless extension candidates. Maximal degree in co-relation 480. Up to 66 conditions per place. [2022-11-18 19:35:17,882 INFO L137 encePairwiseOnDemand]: 271/279 looper letters, 73 selfloop transitions, 4 changer transitions 10/259 dead transitions. [2022-11-18 19:35:17,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 259 transitions, 700 flow [2022-11-18 19:35:17,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 19:35:17,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-18 19:35:17,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1362 transitions. [2022-11-18 19:35:17,887 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6973886328725039 [2022-11-18 19:35:17,887 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1362 transitions. [2022-11-18 19:35:17,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1362 transitions. [2022-11-18 19:35:17,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:35:17,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1362 transitions. [2022-11-18 19:35:17,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 194.57142857142858) internal successors, (1362), 7 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:35:17,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:35:17,898 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:35:17,898 INFO L175 Difference]: Start difference. First operand has 246 places, 237 transitions, 478 flow. Second operand 7 states and 1362 transitions. [2022-11-18 19:35:17,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 259 transitions, 700 flow [2022-11-18 19:35:17,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 259 transitions, 700 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-18 19:35:17,904 INFO L231 Difference]: Finished difference. Result has 244 places, 238 transitions, 500 flow [2022-11-18 19:35:17,905 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=500, PETRI_PLACES=244, PETRI_TRANSITIONS=238} [2022-11-18 19:35:17,906 INFO L288 CegarLoopForPetriNet]: 249 programPoint places, -5 predicate places. [2022-11-18 19:35:17,906 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 238 transitions, 500 flow [2022-11-18 19:35:17,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 190.66666666666666) internal successors, (1144), 6 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:35:17,907 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:35:17,908 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:35:17,914 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-18 19:35:18,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:35:18,114 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-18 19:35:18,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:35:18,115 INFO L85 PathProgramCache]: Analyzing trace with hash -755944282, now seen corresponding path program 1 times [2022-11-18 19:35:18,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:35:18,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220257588] [2022-11-18 19:35:18,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:35:18,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:35:18,167 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 19:35:18,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1698989201] [2022-11-18 19:35:18,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:35:18,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:35:18,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:35:18,172 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:35:18,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 19:35:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:35:18,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 19:35:18,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:35:18,505 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-18 19:35:18,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:35:18,608 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-18 19:35:18,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:35:18,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220257588] [2022-11-18 19:35:18,612 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 19:35:18,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698989201] [2022-11-18 19:35:18,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698989201] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:35:18,614 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:35:18,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2022-11-18 19:35:18,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882871848] [2022-11-18 19:35:18,615 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:35:18,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:35:18,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:35:18,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:35:18,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:35:18,621 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 279 [2022-11-18 19:35:18,623 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 238 transitions, 500 flow. Second operand has 6 states, 6 states have (on average 236.83333333333334) internal successors, (1421), 6 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:35:18,623 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:35:18,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 279 [2022-11-18 19:35:18,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:35:18,764 INFO L130 PetriNetUnfolder]: 23/334 cut-off events. [2022-11-18 19:35:18,764 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-11-18 19:35:18,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 334 events. 23/334 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 630 event pairs, 4 based on Foata normal form. 0/322 useless extension candidates. Maximal degree in co-relation 404. Up to 17 conditions per place. [2022-11-18 19:35:18,771 INFO L137 encePairwiseOnDemand]: 271/279 looper letters, 29 selfloop transitions, 8 changer transitions 0/248 dead transitions. [2022-11-18 19:35:18,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 248 transitions, 596 flow [2022-11-18 19:35:18,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 19:35:18,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-18 19:35:18,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1669 transitions. [2022-11-18 19:35:18,775 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8545826932923707 [2022-11-18 19:35:18,775 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1669 transitions. [2022-11-18 19:35:18,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1669 transitions. [2022-11-18 19:35:18,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:35:18,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1669 transitions. [2022-11-18 19:35:18,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 238.42857142857142) internal successors, (1669), 7 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:35:18,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:35:18,786 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:35:18,786 INFO L175 Difference]: Start difference. First operand has 244 places, 238 transitions, 500 flow. Second operand 7 states and 1669 transitions. [2022-11-18 19:35:18,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 248 transitions, 596 flow [2022-11-18 19:35:18,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 248 transitions, 584 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-11-18 19:35:18,793 INFO L231 Difference]: Finished difference. Result has 245 places, 241 transitions, 527 flow [2022-11-18 19:35:18,794 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=527, PETRI_PLACES=245, PETRI_TRANSITIONS=241} [2022-11-18 19:35:18,796 INFO L288 CegarLoopForPetriNet]: 249 programPoint places, -4 predicate places. [2022-11-18 19:35:18,796 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 241 transitions, 527 flow [2022-11-18 19:35:18,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 236.83333333333334) internal successors, (1421), 6 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:35:18,797 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:35:18,798 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:35:18,812 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 19:35:19,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:35:19,007 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-18 19:35:19,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:35:19,008 INFO L85 PathProgramCache]: Analyzing trace with hash -2067148472, now seen corresponding path program 1 times [2022-11-18 19:35:19,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:35:19,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612836860] [2022-11-18 19:35:19,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:35:19,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:35:19,066 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 19:35:19,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [422933115] [2022-11-18 19:35:19,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:35:19,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:35:19,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:35:19,073 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:35:19,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 19:35:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:35:19,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-18 19:35:19,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:35:19,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 19:35:19,476 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:35:19,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:35:19,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612836860] [2022-11-18 19:35:19,476 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 19:35:19,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422933115] [2022-11-18 19:35:19,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422933115] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:35:19,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:35:19,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 19:35:19,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592240376] [2022-11-18 19:35:19,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:35:19,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 19:35:19,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:35:19,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 19:35:19,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-18 19:35:19,482 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 279 [2022-11-18 19:35:19,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 241 transitions, 527 flow. Second operand has 8 states, 8 states have (on average 167.375) internal successors, (1339), 8 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:35:19,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:35:19,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 279 [2022-11-18 19:35:19,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:35:19,987 INFO L130 PetriNetUnfolder]: 51/627 cut-off events. [2022-11-18 19:35:19,988 INFO L131 PetriNetUnfolder]: For 53/53 co-relation queries the response was YES. [2022-11-18 19:35:19,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 921 conditions, 627 events. 51/627 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2155 event pairs, 18 based on Foata normal form. 2/603 useless extension candidates. Maximal degree in co-relation 913. Up to 66 conditions per place. [2022-11-18 19:35:19,991 INFO L137 encePairwiseOnDemand]: 268/279 looper letters, 88 selfloop transitions, 7 changer transitions 46/293 dead transitions. [2022-11-18 19:35:19,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 293 transitions, 921 flow [2022-11-18 19:35:19,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 19:35:19,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 19:35:19,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2197 transitions. [2022-11-18 19:35:19,996 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6057347670250897 [2022-11-18 19:35:19,996 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2197 transitions. [2022-11-18 19:35:19,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2197 transitions. [2022-11-18 19:35:19,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:35:19,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2197 transitions. [2022-11-18 19:35:20,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 169.0) internal successors, (2197), 13 states have internal predecessors, (2197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:35:20,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 279.0) internal successors, (3906), 14 states have internal predecessors, (3906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:35:20,010 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 279.0) internal successors, (3906), 14 states have internal predecessors, (3906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:35:20,011 INFO L175 Difference]: Start difference. First operand has 245 places, 241 transitions, 527 flow. Second operand 13 states and 2197 transitions. [2022-11-18 19:35:20,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 293 transitions, 921 flow [2022-11-18 19:35:20,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 293 transitions, 920 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 19:35:20,018 INFO L231 Difference]: Finished difference. Result has 265 places, 244 transitions, 581 flow [2022-11-18 19:35:20,018 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=581, PETRI_PLACES=265, PETRI_TRANSITIONS=244} [2022-11-18 19:35:20,019 INFO L288 CegarLoopForPetriNet]: 249 programPoint places, 16 predicate places. [2022-11-18 19:35:20,019 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 244 transitions, 581 flow [2022-11-18 19:35:20,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 167.375) internal successors, (1339), 8 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:35:20,020 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:35:20,020 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:35:20,031 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 19:35:20,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:35:20,227 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-18 19:35:20,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:35:20,227 INFO L85 PathProgramCache]: Analyzing trace with hash -311763073, now seen corresponding path program 1 times [2022-11-18 19:35:20,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:35:20,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303139739] [2022-11-18 19:35:20,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:35:20,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:35:20,257 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 19:35:20,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1422781133] [2022-11-18 19:35:20,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:35:20,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:35:20,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:35:20,269 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:35:20,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 19:35:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:35:20,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 19:35:20,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:35:20,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:35:20,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:35:20,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:35:20,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:35:20,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303139739] [2022-11-18 19:35:20,807 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 19:35:20,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422781133] [2022-11-18 19:35:20,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422781133] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-18 19:35:20,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 19:35:20,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2022-11-18 19:35:20,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309455096] [2022-11-18 19:35:20,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:35:20,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:35:20,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:35:20,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:35:20,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:35:20,812 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 279 [2022-11-18 19:35:20,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 244 transitions, 581 flow. Second operand has 7 states, 7 states have (on average 210.85714285714286) internal successors, (1476), 7 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:35:20,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:35:20,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 279 [2022-11-18 19:35:20,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:35:21,055 INFO L130 PetriNetUnfolder]: 26/349 cut-off events. [2022-11-18 19:35:21,055 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2022-11-18 19:35:21,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 349 events. 26/349 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 576 event pairs, 4 based on Foata normal form. 0/342 useless extension candidates. Maximal degree in co-relation 523. Up to 43 conditions per place. [2022-11-18 19:35:21,058 INFO L137 encePairwiseOnDemand]: 267/279 looper letters, 54 selfloop transitions, 11 changer transitions 0/252 dead transitions. [2022-11-18 19:35:21,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 252 transitions, 735 flow [2022-11-18 19:35:21,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 19:35:21,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 19:35:21,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1910 transitions. [2022-11-18 19:35:21,063 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7606531262445241 [2022-11-18 19:35:21,063 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1910 transitions. [2022-11-18 19:35:21,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1910 transitions. [2022-11-18 19:35:21,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:35:21,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1910 transitions. [2022-11-18 19:35:21,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 212.22222222222223) internal successors, (1910), 9 states have internal predecessors, (1910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:35:21,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 279.0) internal successors, (2790), 10 states have internal predecessors, (2790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:35:21,075 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 279.0) internal successors, (2790), 10 states have internal predecessors, (2790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:35:21,075 INFO L175 Difference]: Start difference. First operand has 265 places, 244 transitions, 581 flow. Second operand 9 states and 1910 transitions. [2022-11-18 19:35:21,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 252 transitions, 735 flow [2022-11-18 19:35:21,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 252 transitions, 711 flow, removed 9 selfloop flow, removed 8 redundant places. [2022-11-18 19:35:21,083 INFO L231 Difference]: Finished difference. Result has 263 places, 248 transitions, 617 flow [2022-11-18 19:35:21,083 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=617, PETRI_PLACES=263, PETRI_TRANSITIONS=248} [2022-11-18 19:35:21,084 INFO L288 CegarLoopForPetriNet]: 249 programPoint places, 14 predicate places. [2022-11-18 19:35:21,084 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 248 transitions, 617 flow [2022-11-18 19:35:21,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 210.85714285714286) internal successors, (1476), 7 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:35:21,085 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:35:21,086 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:35:21,098 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-18 19:35:21,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:35:21,292 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-18 19:35:21,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:35:21,293 INFO L85 PathProgramCache]: Analyzing trace with hash -770632144, now seen corresponding path program 1 times [2022-11-18 19:35:21,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:35:21,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868988045] [2022-11-18 19:35:21,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:35:21,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:35:21,341 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 19:35:21,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [807507868] [2022-11-18 19:35:21,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:35:21,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:35:21,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:35:21,346 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:35:21,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 19:35:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:35:21,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-18 19:35:21,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:35:22,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 19:35:22,284 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:35:22,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:35:22,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868988045] [2022-11-18 19:35:22,285 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 19:35:22,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807507868] [2022-11-18 19:35:22,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807507868] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:35:22,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:35:22,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-18 19:35:22,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539493941] [2022-11-18 19:35:22,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:35:22,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-18 19:35:22,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:35:22,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-18 19:35:22,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-18 19:35:22,290 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 279 [2022-11-18 19:35:22,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 248 transitions, 617 flow. Second operand has 12 states, 12 states have (on average 196.83333333333334) internal successors, (2362), 12 states have internal predecessors, (2362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:35:22,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:35:22,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 279 [2022-11-18 19:35:22,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:35:22,855 INFO L130 PetriNetUnfolder]: 67/594 cut-off events. [2022-11-18 19:35:22,856 INFO L131 PetriNetUnfolder]: For 145/166 co-relation queries the response was YES. [2022-11-18 19:35:22,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 972 conditions, 594 events. 67/594 cut-off events. For 145/166 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1510 event pairs, 29 based on Foata normal form. 22/581 useless extension candidates. Maximal degree in co-relation 956. Up to 150 conditions per place. [2022-11-18 19:35:22,859 INFO L137 encePairwiseOnDemand]: 260/279 looper letters, 73 selfloop transitions, 12 changer transitions 35/291 dead transitions. [2022-11-18 19:35:22,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 291 transitions, 996 flow [2022-11-18 19:35:22,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-18 19:35:22,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-11-18 19:35:22,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3377 transitions. [2022-11-18 19:35:22,867 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7119966266076323 [2022-11-18 19:35:22,867 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3377 transitions. [2022-11-18 19:35:22,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3377 transitions. [2022-11-18 19:35:22,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:35:22,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3377 transitions. [2022-11-18 19:35:22,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 198.64705882352942) internal successors, (3377), 17 states have internal predecessors, (3377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:35:22,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 279.0) internal successors, (5022), 18 states have internal predecessors, (5022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:35:22,889 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 279.0) internal successors, (5022), 18 states have internal predecessors, (5022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:35:22,889 INFO L175 Difference]: Start difference. First operand has 263 places, 248 transitions, 617 flow. Second operand 17 states and 3377 transitions. [2022-11-18 19:35:22,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 291 transitions, 996 flow [2022-11-18 19:35:22,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 291 transitions, 968 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-11-18 19:35:22,897 INFO L231 Difference]: Finished difference. Result has 283 places, 250 transitions, 656 flow [2022-11-18 19:35:22,898 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=656, PETRI_PLACES=283, PETRI_TRANSITIONS=250} [2022-11-18 19:35:22,898 INFO L288 CegarLoopForPetriNet]: 249 programPoint places, 34 predicate places. [2022-11-18 19:35:22,899 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 250 transitions, 656 flow [2022-11-18 19:35:22,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 196.83333333333334) internal successors, (2362), 12 states have internal predecessors, (2362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:35:22,900 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:35:22,901 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:35:22,914 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-18 19:35:23,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-18 19:35:23,108 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-18 19:35:23,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:35:23,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1621696110, now seen corresponding path program 1 times [2022-11-18 19:35:23,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:35:23,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340453052] [2022-11-18 19:35:23,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:35:23,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:35:23,138 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 19:35:23,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1509032061] [2022-11-18 19:35:23,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:35:23,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:35:23,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:35:23,140 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:35:23,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 19:35:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:35:23,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 19:35:23,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:35:23,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-18 19:35:23,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:35:23,932 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-18 19:35:23,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:35:23,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340453052] [2022-11-18 19:35:23,933 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 19:35:23,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509032061] [2022-11-18 19:35:23,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509032061] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-18 19:35:23,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 19:35:23,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2022-11-18 19:35:23,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17651972] [2022-11-18 19:35:23,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:35:23,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:35:23,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:35:23,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:35:23,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:35:23,938 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 279 [2022-11-18 19:35:23,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 250 transitions, 656 flow. Second operand has 7 states, 7 states have (on average 216.28571428571428) internal successors, (1514), 7 states have internal predecessors, (1514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:35:23,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:35:23,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 279 [2022-11-18 19:35:23,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:35:24,085 INFO L130 PetriNetUnfolder]: 17/334 cut-off events. [2022-11-18 19:35:24,085 INFO L131 PetriNetUnfolder]: For 72/80 co-relation queries the response was YES. [2022-11-18 19:35:24,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 334 events. 17/334 cut-off events. For 72/80 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 372 event pairs, 2 based on Foata normal form. 1/330 useless extension candidates. Maximal degree in co-relation 524. Up to 67 conditions per place. [2022-11-18 19:35:24,088 INFO L137 encePairwiseOnDemand]: 271/279 looper letters, 53 selfloop transitions, 7 changer transitions 0/253 dead transitions. [2022-11-18 19:35:24,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 253 transitions, 783 flow [2022-11-18 19:35:24,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 19:35:24,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-18 19:35:24,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1523 transitions. [2022-11-18 19:35:24,092 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7798259088581669 [2022-11-18 19:35:24,093 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1523 transitions. [2022-11-18 19:35:24,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1523 transitions. [2022-11-18 19:35:24,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:35:24,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1523 transitions. [2022-11-18 19:35:24,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 217.57142857142858) internal successors, (1523), 7 states have internal predecessors, (1523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:35:24,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:35:24,102 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:35:24,102 INFO L175 Difference]: Start difference. First operand has 283 places, 250 transitions, 656 flow. Second operand 7 states and 1523 transitions. [2022-11-18 19:35:24,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 253 transitions, 783 flow [2022-11-18 19:35:24,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 253 transitions, 747 flow, removed 8 selfloop flow, removed 12 redundant places. [2022-11-18 19:35:24,109 INFO L231 Difference]: Finished difference. Result has 270 places, 252 transitions, 653 flow [2022-11-18 19:35:24,110 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=653, PETRI_PLACES=270, PETRI_TRANSITIONS=252} [2022-11-18 19:35:24,110 INFO L288 CegarLoopForPetriNet]: 249 programPoint places, 21 predicate places. [2022-11-18 19:35:24,111 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 252 transitions, 653 flow [2022-11-18 19:35:24,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 216.28571428571428) internal successors, (1514), 7 states have internal predecessors, (1514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:35:24,112 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:35:24,112 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:35:24,125 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-18 19:35:24,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:35:24,320 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-18 19:35:24,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:35:24,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1080394574, now seen corresponding path program 1 times [2022-11-18 19:35:24,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:35:24,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248130309] [2022-11-18 19:35:24,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:35:24,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:35:24,366 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 19:35:24,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1786708199] [2022-11-18 19:35:24,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:35:24,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:35:24,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:35:24,379 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:35:24,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-18 19:35:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:35:24,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 134 conjunts are in the unsatisfiable core [2022-11-18 19:35:24,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:35:25,326 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 19:35:25,964 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 19:35:25,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 21 [2022-11-18 19:35:26,531 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 19:35:26,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-18 19:35:27,499 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-18 19:35:27,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-18 19:35:28,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-18 19:35:29,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:35:29,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-18 19:35:29,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:35:29,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-18 19:35:29,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-18 19:35:29,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 [2022-11-18 19:35:30,900 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 19:35:30,901 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 59 [2022-11-18 19:35:30,922 INFO L321 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-11-18 19:35:30,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 33 [2022-11-18 19:35:30,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 32 [2022-11-18 19:35:32,677 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:35:32,678 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 45 treesize of output 27 [2022-11-18 19:35:32,692 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:35:32,693 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 25 treesize of output 15 [2022-11-18 19:35:32,903 INFO L321 Elim1Store]: treesize reduction 48, result has 12.7 percent of original size [2022-11-18 19:35:32,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 19 [2022-11-18 19:35:33,123 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 19:35:33,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:35:34,903 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:35:34,903 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 322 treesize of output 294 [2022-11-18 19:35:34,915 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 143 treesize of output 137 [2022-11-18 19:36:31,606 WARN L233 SmtUtils]: Spent 51.80s on a formula simplification. DAG size of input: 96 DAG size of output: 82 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:37:06,827 WARN L233 SmtUtils]: Spent 20.20s on a formula simplification. DAG size of input: 78 DAG size of output: 71 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:37:29,645 WARN L233 SmtUtils]: Spent 10.09s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:37:39,612 INFO L321 Elim1Store]: treesize reduction 4, result has 97.6 percent of original size [2022-11-18 19:37:39,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1705 treesize of output 1505 [2022-11-18 19:37:46,763 INFO L321 Elim1Store]: treesize reduction 4, result has 97.6 percent of original size [2022-11-18 19:37:46,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1673 treesize of output 1473 [2022-11-18 19:38:04,932 INFO L321 Elim1Store]: treesize reduction 4, result has 97.6 percent of original size [2022-11-18 19:38:04,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1705 treesize of output 1505 [2022-11-18 19:38:20,334 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:38:20,334 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-18 19:38:20,356 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:38:20,356 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 263 treesize of output 251 [2022-11-18 19:38:20,367 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 6 treesize of output 4 [2022-11-18 19:38:20,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-18 19:38:20,383 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 6 treesize of output 4 [2022-11-18 19:38:20,403 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 6 treesize of output 4 [2022-11-18 19:38:20,410 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 6 treesize of output 4 [2022-11-18 19:38:20,416 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 6 treesize of output 4 [2022-11-18 19:38:20,424 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 6 treesize of output 4 [2022-11-18 19:38:29,655 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 19:38:29,655 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 22 treesize of output 18 [2022-11-18 19:38:29,669 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 19:38:29,669 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 22 treesize of output 18 [2022-11-18 19:38:31,254 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 19:38:31,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:31,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248130309] [2022-11-18 19:38:31,255 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 19:38:31,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786708199] [2022-11-18 19:38:31,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786708199] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:38:31,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:38:31,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 52] total 106 [2022-11-18 19:38:31,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589245538] [2022-11-18 19:38:31,256 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:38:31,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 106 states [2022-11-18 19:38:31,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:31,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2022-11-18 19:38:31,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=579, Invalid=10514, Unknown=37, NotChecked=0, Total=11130 [2022-11-18 19:38:31,271 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 279 [2022-11-18 19:38:31,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 252 transitions, 653 flow. Second operand has 106 states, 106 states have (on average 76.0) internal successors, (8056), 106 states have internal predecessors, (8056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:31,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:38:31,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 279 [2022-11-18 19:38:31,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:39:10,452 INFO L130 PetriNetUnfolder]: 3847/7494 cut-off events. [2022-11-18 19:39:10,452 INFO L131 PetriNetUnfolder]: For 4186/4187 co-relation queries the response was YES. [2022-11-18 19:39:10,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18079 conditions, 7494 events. 3847/7494 cut-off events. For 4186/4187 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 49540 event pairs, 1633 based on Foata normal form. 2/7453 useless extension candidates. Maximal degree in co-relation 18061. Up to 1473 conditions per place. [2022-11-18 19:39:10,566 INFO L137 encePairwiseOnDemand]: 184/279 looper letters, 443 selfloop transitions, 181 changer transitions 13/704 dead transitions. [2022-11-18 19:39:10,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 704 transitions, 3252 flow [2022-11-18 19:39:10,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2022-11-18 19:39:10,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2022-11-18 19:39:10,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 9602 transitions. [2022-11-18 19:39:10,599 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.27980301308389427 [2022-11-18 19:39:10,599 INFO L72 ComplementDD]: Start complementDD. Operand 123 states and 9602 transitions. [2022-11-18 19:39:10,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 9602 transitions. [2022-11-18 19:39:10,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:39:10,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 123 states and 9602 transitions. [2022-11-18 19:39:10,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 124 states, 123 states have (on average 78.0650406504065) internal successors, (9602), 123 states have internal predecessors, (9602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:39:10,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 124 states, 124 states have (on average 279.0) internal successors, (34596), 124 states have internal predecessors, (34596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:39:10,683 INFO L81 ComplementDD]: Finished complementDD. Result has 124 states, 124 states have (on average 279.0) internal successors, (34596), 124 states have internal predecessors, (34596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:39:10,683 INFO L175 Difference]: Start difference. First operand has 270 places, 252 transitions, 653 flow. Second operand 123 states and 9602 transitions. [2022-11-18 19:39:10,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 704 transitions, 3252 flow [2022-11-18 19:39:10,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 704 transitions, 3219 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-18 19:39:10,715 INFO L231 Difference]: Finished difference. Result has 429 places, 381 transitions, 1731 flow [2022-11-18 19:39:10,716 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=123, PETRI_FLOW=1731, PETRI_PLACES=429, PETRI_TRANSITIONS=381} [2022-11-18 19:39:10,716 INFO L288 CegarLoopForPetriNet]: 249 programPoint places, 180 predicate places. [2022-11-18 19:39:10,717 INFO L495 AbstractCegarLoop]: Abstraction has has 429 places, 381 transitions, 1731 flow [2022-11-18 19:39:10,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 106 states, 106 states have (on average 76.0) internal successors, (8056), 106 states have internal predecessors, (8056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:39:10,719 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:39:10,720 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:39:10,729 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-18 19:39:10,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:39:10,929 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-18 19:39:10,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:39:10,929 INFO L85 PathProgramCache]: Analyzing trace with hash 272625930, now seen corresponding path program 2 times [2022-11-18 19:39:10,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:39:10,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305898345] [2022-11-18 19:39:10,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:39:10,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:39:10,972 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 19:39:10,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1989673869] [2022-11-18 19:39:10,973 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:39:10,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:39:10,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:39:10,975 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:39:10,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_453a8c36-fad5-4a53-8080-640bdc45003a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-18 19:39:11,312 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 19:39:11,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:39:11,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 128 conjunts are in the unsatisfiable core [2022-11-18 19:39:11,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:39:11,940 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 19:39:12,731 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 19:39:12,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 21 [2022-11-18 19:39:13,839 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-18 19:39:13,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-18 19:39:15,350 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-18 19:39:15,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2022-11-18 19:39:16,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-18 19:39:16,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-18 19:39:17,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:39:17,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-18 19:39:17,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 19:39:17,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:39:17,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-18 19:39:17,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 19:39:19,297 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:39:19,321 INFO L321 Elim1Store]: treesize reduction 63, result has 14.9 percent of original size [2022-11-18 19:39:19,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 21 [2022-11-18 19:39:19,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 19:39:19,353 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 30 treesize of output 28 [2022-11-18 19:39:20,093 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 19:39:20,094 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 63 [2022-11-18 19:39:20,120 INFO L321 Elim1Store]: treesize reduction 61, result has 10.3 percent of original size [2022-11-18 19:39:20,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 37 [2022-11-18 19:39:20,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 36 [2022-11-18 19:39:22,763 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:39:22,764 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 29 treesize of output 19 [2022-11-18 19:39:22,772 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:39:22,775 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 41 treesize of output 23 [2022-11-18 19:39:23,029 INFO L321 Elim1Store]: treesize reduction 81, result has 8.0 percent of original size [2022-11-18 19:39:23,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 19 [2022-11-18 19:39:23,388 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 19:39:23,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:39:34,993 INFO L321 Elim1Store]: treesize reduction 4, result has 98.1 percent of original size [2022-11-18 19:39:34,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2220 treesize of output 1773 [2022-11-18 19:40:47,186 WARN L233 SmtUtils]: Spent 1.08m on a formula simplification that was a NOOP. DAG size: 196 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:41:45,383 WARN L233 SmtUtils]: Spent 50.78s on a formula simplification that was a NOOP. DAG size: 200 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:42:41,540 WARN L233 SmtUtils]: Spent 52.70s on a formula simplification that was a NOOP. DAG size: 202 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:44:00,823 WARN L233 SmtUtils]: Spent 1.27m on a formula simplification. DAG size of input: 168 DAG size of output: 161 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:44:26,162 WARN L233 SmtUtils]: Spent 18.33s on a formula simplification that was a NOOP. DAG size: 149 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:44:30,806 WARN L837 $PredicateComparison]: unable to prove that (or (< 1 c_~M~0) (not (< 0 c_~M~0)) (let ((.cse9 (- c_~A~0.offset)) (.cse42 (* 4 c_~M~0))) (and (forall ((v_ArrVal_737 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse5 (select (select .cse4 c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse1 (div (+ c_~A~0.offset (- .cse5)) (- 4))) (.cse0 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (<= (+ .cse0 c_~M~0) .cse1) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse2 (select (select (store (store .cse4 c_~A~0.base v_ArrVal_739) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (.cse3 (+ c_~A~0.offset (* .cse0 4)))) (or (= .cse2 .cse3) (= (+ (* .cse1 4) .cse2) .cse3)))) (< .cse1 .cse0) (<= c_~N~0 ~a~0)))) (not (= (mod (+ c_~A~0.offset (* .cse5 3)) 4) 0)))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_743 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736)) (.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse10 (select (select .cse11 c_~B~0.base) c_~B~0.offset)) (.cse7 (select (select .cse6 c_~B~0.base) c_~B~0.offset)) (.cse8 (+ (* ~a~0 4) c_~B~0.offset))) (or (< ~a~0 0) (= (select (select (store (store .cse6 c_~A~0.base v_ArrVal_740) .cse7 v_ArrVal_743) c_~B~0.base) .cse8) c_~A~0.base) (< (+ (* ~a~0 c_~M~0) c_~M~0) (+ (div (+ .cse9 .cse10) 4) 2)) (< .cse10 (+ (select (select (store (store .cse11 c_~A~0.base v_ArrVal_739) .cse7 v_ArrVal_744) c_~B~0.base) .cse8) 1)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736)) (.cse16 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse12 (select (select .cse16 c_~B~0.base) c_~B~0.offset)) (.cse14 (select (select .cse13 c_~B~0.base) c_~B~0.offset)) (.cse15 (+ (* ~a~0 4) c_~B~0.offset))) (or (< .cse12 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)) (< ~a~0 0) (= (select (select (store (store .cse13 c_~A~0.base v_ArrVal_740) .cse14 v_ArrVal_743) c_~B~0.base) .cse15) c_~A~0.base) (< .cse12 (+ (select (select (store (store .cse16 c_~A~0.base v_ArrVal_739) .cse14 v_ArrVal_744) c_~B~0.base) .cse15) 1)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_736 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse18 (select (select .cse17 c_~B~0.base) c_~B~0.offset))) (or (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse19 (+ (* ~a~0 4) c_~B~0.offset))) (or (< ~a~0 0) (= (select (select (store (store .cse17 c_~A~0.base v_ArrVal_740) .cse18 v_ArrVal_743) c_~B~0.base) .cse19) .cse18) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737) c_~A~0.base v_ArrVal_739) .cse18 v_ArrVal_744) c_~B~0.base) .cse19) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (<= c_~N~0 ~a~0)))) (= .cse18 c_~A~0.base))))) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse22 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse20 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737)) (.cse23 (select (select .cse22 c_~B~0.base) c_~B~0.offset)) (.cse24 (+ (* ~a~0 4) c_~B~0.offset)) (.cse21 (* (* ~a~0 c_~M~0) 4))) (or (< (select (select .cse20 c_~B~0.base) c_~B~0.offset) (+ c_~A~0.offset .cse21 1)) (< ~a~0 0) (= (select (select (store (store .cse22 c_~A~0.base v_ArrVal_740) .cse23 v_ArrVal_743) c_~B~0.base) .cse24) .cse23) (= (select (select (store (store .cse20 c_~A~0.base v_ArrVal_739) .cse23 v_ArrVal_744) c_~B~0.base) .cse24) (+ c_~A~0.offset .cse21)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_737 (Array Int Int))) (let ((.cse31 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse25 (select (select .cse31 c_~B~0.base) c_~B~0.offset))) (or (not (= (mod (+ c_~A~0.offset (* .cse25 3)) 4) 0)) (forall ((~a~0 Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse26 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse27 (select (select .cse26 c_~B~0.base) c_~B~0.offset)) (.cse28 (+ (* ~a~0 4) c_~B~0.offset)) (.cse30 (div (+ c_~A~0.offset (- .cse25)) (- 4))) (.cse29 (* ~a~0 c_~M~0))) (or (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (= (select (select (store (store .cse26 c_~A~0.base v_ArrVal_740) .cse27 v_ArrVal_743) c_~B~0.base) .cse28) .cse27)) (< ~a~0 0) (<= (+ .cse29 c_~M~0) .cse30) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (= (select (select (store (store .cse31 c_~A~0.base v_ArrVal_739) .cse27 v_ArrVal_744) c_~B~0.base) .cse28) (+ c_~A~0.offset (* .cse29 4)))) (< .cse30 .cse29) (<= c_~N~0 ~a~0))))))))) (forall ((v_ArrVal_736 (Array Int Int))) (let ((.cse34 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset))) (or (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse33 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse32 (select (select (store (store .cse33 c_~A~0.base v_ArrVal_739) .cse34 v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse32 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< (select (select .cse33 c_~B~0.base) c_~B~0.offset) (+ .cse32 1)) (<= c_~N~0 ~a~0))))) (= .cse34 c_~A~0.base)))) (forall ((v_ArrVal_736 (Array Int Int))) (let ((.cse36 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse35 (select (select .cse36 c_~B~0.base) c_~B~0.offset))) (or (= .cse35 c_~A~0.base) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse37 (+ (* ~a~0 4) c_~B~0.offset))) (or (< ~a~0 0) (= (select (select (store (store .cse36 c_~A~0.base v_ArrVal_740) .cse35 v_ArrVal_743) c_~B~0.base) .cse37) c_~A~0.base) (let ((.cse38 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (< (select (select .cse38 c_~B~0.base) c_~B~0.offset) (+ (select (select (store (store .cse38 c_~A~0.base v_ArrVal_739) .cse35 v_ArrVal_744) c_~B~0.base) .cse37) 1))) (<= c_~N~0 ~a~0)))))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_743 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse43 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737)) (.cse39 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse40 (select (select .cse39 c_~B~0.base) c_~B~0.offset)) (.cse41 (+ (* ~a~0 4) c_~B~0.offset)) (.cse44 (select (select .cse43 c_~B~0.base) c_~B~0.offset))) (or (< ~a~0 0) (= (select (select (store (store .cse39 c_~A~0.base v_ArrVal_740) .cse40 v_ArrVal_743) c_~B~0.base) .cse41) c_~A~0.base) (< (+ .cse42 (select (select (store (store .cse43 c_~A~0.base v_ArrVal_739) .cse40 v_ArrVal_744) c_~B~0.base) .cse41)) (+ .cse44 5)) (< (div (+ (- 1) .cse9 .cse44) 4) (* ~a~0 c_~M~0)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse47 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse46 (select (select .cse47 c_~B~0.base) c_~B~0.offset))) (let ((.cse45 (select (select (store (store .cse47 c_~A~0.base v_ArrVal_740) .cse46 v_ArrVal_743) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737) c_~B~0.base) c_~B~0.offset) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)) (< ~a~0 0) (= .cse45 .cse46) (= .cse45 c_~A~0.base) (<= c_~N~0 ~a~0)))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse48 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse49 (select (select .cse48 c_~B~0.base) c_~B~0.offset))) (or (< ~a~0 0) (< (+ .cse42 (select (select (store (store .cse48 c_~A~0.base v_ArrVal_739) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse49 5)) (< (div (+ (- 1) .cse9 .cse49) 4) (* ~a~0 c_~M~0)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_736 (Array Int Int))) (let ((.cse50 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse51 (select (select .cse50 c_~B~0.base) c_~B~0.offset))) (or (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse52 (+ (* ~a~0 4) c_~B~0.offset))) (or (< ~a~0 0) (= (select (select (store (store .cse50 c_~A~0.base v_ArrVal_740) .cse51 v_ArrVal_743) c_~B~0.base) .cse52) c_~A~0.base) (let ((.cse53 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (< (+ .cse42 (select (select (store (store .cse53 c_~A~0.base v_ArrVal_739) .cse51 v_ArrVal_744) c_~B~0.base) .cse52)) (+ (select (select .cse53 c_~B~0.base) c_~B~0.offset) 5))) (<= c_~N~0 ~a~0)))) (= .cse51 c_~A~0.base))))) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse57 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737)) (.cse54 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse55 (select (select .cse54 c_~B~0.base) c_~B~0.offset)) (.cse56 (+ (* ~a~0 4) c_~B~0.offset)) (.cse58 (+ (select (select .cse57 c_~B~0.base) c_~B~0.offset) 5))) (or (< ~a~0 0) (= (select (select (store (store .cse54 c_~A~0.base v_ArrVal_740) .cse55 v_ArrVal_743) c_~B~0.base) .cse56) c_~A~0.base) (< (+ .cse42 (select (select (store (store .cse57 c_~A~0.base v_ArrVal_739) .cse55 v_ArrVal_744) c_~B~0.base) .cse56)) .cse58) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse42) .cse58) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse60 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse59 (select (select .cse60 c_~B~0.base) c_~B~0.offset))) (or (< ~a~0 0) (< (+ (* ~a~0 c_~M~0) c_~M~0) (+ (div (+ .cse9 .cse59) 4) 2)) (< .cse59 (+ (select (select (store (store .cse60 c_~A~0.base v_ArrVal_739) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) 1)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse61 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse62 (select (select .cse61 c_~B~0.base) c_~B~0.offset)) (.cse63 (+ (* ~a~0 4) c_~B~0.offset)) (.cse65 (* (* ~a~0 c_~M~0) 4)) (.cse64 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (or (< ~a~0 0) (= (select (select (store (store .cse61 c_~A~0.base v_ArrVal_740) .cse62 v_ArrVal_743) c_~B~0.base) .cse63) .cse62) (= (select (select (store (store .cse64 c_~A~0.base v_ArrVal_739) .cse62 v_ArrVal_744) c_~B~0.base) .cse63) (+ c_~A~0.offset .cse65)) (< (+ c_~A~0.offset .cse65 .cse42) (+ (select (select .cse64 c_~B~0.base) c_~B~0.offset) 5)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse69 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse67 (* (* ~a~0 c_~M~0) 4)) (.cse66 (select (select .cse69 c_~B~0.base) c_~B~0.offset)) (.cse68 (select (select (store (store .cse69 c_~A~0.base v_ArrVal_739) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< .cse66 (+ c_~A~0.offset .cse67 1)) (< ~a~0 0) (= .cse68 (+ c_~A~0.offset .cse67)) (< .cse66 (+ .cse68 1)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse73 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse70 (select (select (store (store .cse73 c_~A~0.base v_ArrVal_739) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (.cse72 (* (* ~a~0 c_~M~0) 4)) (.cse71 (+ (select (select .cse73 c_~B~0.base) c_~B~0.offset) 5))) (or (< ~a~0 0) (< (+ .cse42 .cse70) .cse71) (= .cse70 (+ c_~A~0.offset .cse72)) (< (+ c_~A~0.offset .cse72 .cse42) .cse71) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_736 (Array Int Int))) (let ((.cse76 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse75 (select (select .cse76 c_~B~0.base) c_~B~0.offset))) (or (forall ((v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_740 (Array Int Int))) (let ((.cse74 (select (select (store (store .cse76 c_~A~0.base v_ArrVal_740) .cse75 v_ArrVal_743) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse74 .cse75) (= .cse74 c_~A~0.base) (<= c_~N~0 ~a~0)))) (= .cse75 c_~A~0.base))))) (forall ((v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse79 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse78 (select (select .cse79 c_~B~0.base) c_~B~0.offset))) (let ((.cse77 (select (select (store (store .cse79 c_~A~0.base v_ArrVal_740) .cse78 v_ArrVal_743) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse77 .cse78) (= .cse77 c_~A~0.base) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse42) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737) c_~B~0.base) c_~B~0.offset) 5)) (<= c_~N~0 ~a~0)))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse82 (* ~a~0 c_~M~0))) (let ((.cse80 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737)) (.cse81 (* .cse82 4))) (or (< (select (select .cse80 c_~B~0.base) c_~B~0.offset) (+ c_~A~0.offset .cse81 1)) (< (+ .cse82 c_~M~0) 2) (= (select (select (store (store .cse80 c_~A~0.base v_ArrVal_739) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) (+ c_~A~0.offset .cse81)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_737 (Array Int Int))) (let ((.cse84 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse89 (select (select .cse84 c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse88 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse85 (select (select .cse88 c_~B~0.base) c_~B~0.offset)) (.cse86 (+ (* ~a~0 4) c_~B~0.offset)) (.cse83 (div (+ c_~A~0.offset (- .cse89)) (- 4))) (.cse87 (* ~a~0 c_~M~0))) (or (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (= (+ (* .cse83 4) (select (select (store (store .cse84 c_~A~0.base v_ArrVal_739) .cse85 v_ArrVal_744) c_~B~0.base) .cse86)) (+ c_~A~0.offset (* .cse87 4)))) (< ~a~0 0) (<= (+ .cse87 c_~M~0) .cse83) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (= (select (select (store (store .cse88 c_~A~0.base v_ArrVal_740) .cse85 v_ArrVal_743) c_~B~0.base) .cse86) c_~A~0.base)) (< .cse83 .cse87) (<= c_~N~0 ~a~0))))) (not (= (mod (+ c_~A~0.offset (* .cse89 3)) 4) 0)))))) (forall ((v_ArrVal_737 (Array Int Int))) (let ((.cse95 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737) c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse91 (div (+ c_~A~0.offset (- .cse95)) (- 4))) (.cse90 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (<= (+ .cse90 c_~M~0) .cse91) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse94 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse93 (select (select .cse94 c_~B~0.base) c_~B~0.offset))) (let ((.cse92 (select (select (store (store .cse94 c_~A~0.base v_ArrVal_740) .cse93 v_ArrVal_743) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= .cse92 .cse93) (= .cse92 c_~A~0.base)))))) (< .cse91 .cse90) (<= c_~N~0 ~a~0)))) (not (= (mod (+ c_~A~0.offset (* .cse95 3)) 4) 0))))) (forall ((v_ArrVal_736 (Array Int Int))) (let ((.cse98 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset))) (or (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse97 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse96 (select (select (store (store .cse97 c_~A~0.base v_ArrVal_739) .cse98 v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (< (+ .cse42 .cse96) (+ (select (select .cse97 c_~B~0.base) c_~B~0.offset) 5)) (= .cse96 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (<= c_~N~0 ~a~0))))) (= .cse98 c_~A~0.base)))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse99 (* ~a~0 c_~M~0))) (let ((.cse101 (* .cse99 4)) (.cse100 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (or (< (+ .cse99 c_~M~0) 2) (= (select (select (store (store .cse100 c_~A~0.base v_ArrVal_739) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) (+ c_~A~0.offset .cse101)) (< (+ c_~A~0.offset .cse101 .cse42) (+ (select (select .cse100 c_~B~0.base) c_~B~0.offset) 5)) (<= c_~N~0 ~a~0)))))))) is different from false [2022-11-18 19:44:37,294 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse0 (- c_~A~0.offset)) (.cse34 (* 4 c_~M~0))) (and (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse1 (select (select .cse2 c_~B~0.base) c_~B~0.offset))) (or (< ~a~0 0) (< (+ (* ~a~0 c_~M~0) c_~M~0) (+ 2 (div (+ .cse0 .cse1) 4))) (< .cse1 (+ (select (select (store (store .cse2 c_~A~0.base v_ArrVal_739) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) 1)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736)) (.cse7 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse3 (select (select .cse7 c_~B~0.base) c_~B~0.offset)) (.cse5 (select (select .cse4 c_~B~0.base) c_~B~0.offset)) (.cse6 (+ (* ~a~0 4) c_~B~0.offset))) (or (< .cse3 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)) (< ~a~0 0) (= (select (select (store (store .cse4 c_~A~0.base v_ArrVal_740) .cse5 v_ArrVal_743) c_~B~0.base) .cse6) c_~A~0.base) (< .cse3 (+ (select (select (store (store .cse7 c_~A~0.base v_ArrVal_739) .cse5 v_ArrVal_744) c_~B~0.base) .cse6) 1)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_736 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse8 (select (select .cse10 c_~B~0.base) c_~B~0.offset))) (or (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse9 (+ (* ~a~0 4) c_~B~0.offset))) (or (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737) c_~A~0.base v_ArrVal_739) .cse8 v_ArrVal_744) c_~B~0.base) .cse9) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< ~a~0 0) (= .cse8 (select (select (store (store .cse10 c_~A~0.base v_ArrVal_740) .cse8 v_ArrVal_743) c_~B~0.base) .cse9)) (<= c_~N~0 ~a~0)))) (= .cse8 c_~A~0.base))))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int))) (let ((.cse16 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse17 (select (select .cse16 c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse11 (div (+ c_~A~0.offset (- .cse17)) (- 4))) (.cse13 (select (select .cse14 c_~B~0.base) c_~B~0.offset)) (.cse15 (+ (* ~a~0 4) c_~B~0.offset)) (.cse12 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< .cse11 .cse12) (<= (+ .cse12 c_~M~0) .cse11) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (= .cse13 (select (select (store (store .cse14 c_~A~0.base v_ArrVal_740) .cse13 v_ArrVal_743) c_~B~0.base) .cse15))) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (= (select (select (store (store .cse16 c_~A~0.base v_ArrVal_739) .cse13 v_ArrVal_744) c_~B~0.base) .cse15) (+ c_~A~0.offset (* .cse12 4)))) (<= c_~N~0 ~a~0))))) (not (= (mod (+ c_~A~0.offset (* 3 .cse17)) 4) 0)))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse20 (* ~a~0 c_~M~0))) (let ((.cse18 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737)) (.cse19 (* .cse20 4))) (or (< (select (select .cse18 c_~B~0.base) c_~B~0.offset) (+ c_~A~0.offset .cse19 1)) (= (select (select (store (store .cse18 c_~A~0.base v_ArrVal_739) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) (+ c_~A~0.offset .cse19)) (< (+ .cse20 c_~M~0) 2) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int))) (let ((.cse21 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse27 (select (select .cse21 c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse26 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse22 (select (select .cse26 c_~B~0.base) c_~B~0.offset)) (.cse23 (+ (* ~a~0 4) c_~B~0.offset)) (.cse25 (* ~a~0 c_~M~0)) (.cse24 (div (+ c_~A~0.offset (- .cse27)) (- 4)))) (or (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (= (+ (select (select (store (store .cse21 c_~A~0.base v_ArrVal_739) .cse22 v_ArrVal_744) c_~B~0.base) .cse23) (* .cse24 4)) (+ c_~A~0.offset (* .cse25 4)))) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (= (select (select (store (store .cse26 c_~A~0.base v_ArrVal_740) .cse22 v_ArrVal_743) c_~B~0.base) .cse23) c_~A~0.base)) (< ~a~0 0) (< .cse24 .cse25) (<= (+ .cse25 c_~M~0) .cse24) (<= c_~N~0 ~a~0))))) (not (= (mod (+ c_~A~0.offset (* 3 .cse27)) 4) 0)))))) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse32 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse28 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737)) (.cse29 (* (* ~a~0 c_~M~0) 4)) (.cse30 (select (select .cse32 c_~B~0.base) c_~B~0.offset)) (.cse31 (+ (* ~a~0 4) c_~B~0.offset))) (or (< (select (select .cse28 c_~B~0.base) c_~B~0.offset) (+ c_~A~0.offset .cse29 1)) (= (select (select (store (store .cse28 c_~A~0.base v_ArrVal_739) .cse30 v_ArrVal_744) c_~B~0.base) .cse31) (+ c_~A~0.offset .cse29)) (< ~a~0 0) (= .cse30 (select (select (store (store .cse32 c_~A~0.base v_ArrVal_740) .cse30 v_ArrVal_743) c_~B~0.base) .cse31)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse36 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse35 (select (select .cse36 c_~B~0.base) c_~B~0.offset))) (let ((.cse33 (select (select (store (store .cse36 c_~A~0.base v_ArrVal_740) .cse35 v_ArrVal_743) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse33 c_~A~0.base) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse34) (+ 5 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737) c_~B~0.base) c_~B~0.offset))) (= .cse35 .cse33) (<= c_~N~0 ~a~0)))))) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse37 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737)) (.cse41 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse38 (select (select .cse41 c_~B~0.base) c_~B~0.offset)) (.cse39 (+ (* ~a~0 4) c_~B~0.offset)) (.cse40 (+ 5 (select (select .cse37 c_~B~0.base) c_~B~0.offset)))) (or (< (+ (select (select (store (store .cse37 c_~A~0.base v_ArrVal_739) .cse38 v_ArrVal_744) c_~B~0.base) .cse39) .cse34) .cse40) (< ~a~0 0) (= (select (select (store (store .cse41 c_~A~0.base v_ArrVal_740) .cse38 v_ArrVal_743) c_~B~0.base) .cse39) c_~A~0.base) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse34) .cse40) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int))) (let ((.cse47 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737) c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse43 (* ~a~0 c_~M~0)) (.cse42 (div (+ c_~A~0.offset (- .cse47)) (- 4)))) (or (< ~a~0 0) (< .cse42 .cse43) (<= (+ .cse43 c_~M~0) .cse42) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse46 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse45 (select (select .cse46 c_~B~0.base) c_~B~0.offset))) (let ((.cse44 (select (select (store (store .cse46 c_~A~0.base v_ArrVal_740) .cse45 v_ArrVal_743) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= .cse44 c_~A~0.base) (= .cse45 .cse44)))))) (<= c_~N~0 ~a~0)))) (not (= (mod (+ c_~A~0.offset (* 3 .cse47)) 4) 0))))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_736 (Array Int Int))) (let ((.cse51 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse49 (select (select .cse51 c_~B~0.base) c_~B~0.offset))) (or (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse50 (+ (* ~a~0 4) c_~B~0.offset))) (or (let ((.cse48 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (< (+ (select (select (store (store .cse48 c_~A~0.base v_ArrVal_739) .cse49 v_ArrVal_744) c_~B~0.base) .cse50) .cse34) (+ 5 (select (select .cse48 c_~B~0.base) c_~B~0.offset)))) (< ~a~0 0) (= (select (select (store (store .cse51 c_~A~0.base v_ArrVal_740) .cse49 v_ArrVal_743) c_~B~0.base) .cse50) c_~A~0.base) (<= c_~N~0 ~a~0)))) (= .cse49 c_~A~0.base))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_743 (Array Int Int)) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse52 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737)) (.cse56 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse53 (select (select .cse56 c_~B~0.base) c_~B~0.offset)) (.cse54 (+ (* ~a~0 4) c_~B~0.offset)) (.cse55 (select (select .cse52 c_~B~0.base) c_~B~0.offset))) (or (< (+ (select (select (store (store .cse52 c_~A~0.base v_ArrVal_739) .cse53 v_ArrVal_744) c_~B~0.base) .cse54) .cse34) (+ 5 .cse55)) (< ~a~0 0) (= (select (select (store (store .cse56 c_~A~0.base v_ArrVal_740) .cse53 v_ArrVal_743) c_~B~0.base) .cse54) c_~A~0.base) (< (div (+ (- 1) .cse0 .cse55) 4) (* ~a~0 c_~M~0)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_736 (Array Int Int))) (let ((.cse57 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse58 (select (select .cse57 c_~B~0.base) c_~B~0.offset))) (or (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse59 (+ (* ~a~0 4) c_~B~0.offset))) (or (< ~a~0 0) (= (select (select (store (store .cse57 c_~A~0.base v_ArrVal_740) .cse58 v_ArrVal_743) c_~B~0.base) .cse59) c_~A~0.base) (let ((.cse60 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (< (select (select .cse60 c_~B~0.base) c_~B~0.offset) (+ (select (select (store (store .cse60 c_~A~0.base v_ArrVal_739) .cse58 v_ArrVal_744) c_~B~0.base) .cse59) 1))) (<= c_~N~0 ~a~0)))) (= .cse58 c_~A~0.base))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse61 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse62 (select (select .cse61 c_~B~0.base) c_~B~0.offset))) (or (< (+ (select (select (store (store .cse61 c_~A~0.base v_ArrVal_739) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) .cse34) (+ 5 .cse62)) (< ~a~0 0) (< (div (+ (- 1) .cse0 .cse62) 4) (* ~a~0 c_~M~0)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse65 (* ~a~0 c_~M~0))) (let ((.cse64 (* .cse65 4)) (.cse63 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (or (= (select (select (store (store .cse63 c_~A~0.base v_ArrVal_739) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) (+ c_~A~0.offset .cse64)) (< (+ .cse65 c_~M~0) 2) (< (+ c_~A~0.offset .cse64 .cse34) (+ 5 (select (select .cse63 c_~B~0.base) c_~B~0.offset))) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse70 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse69 (* (* ~a~0 c_~M~0) 4)) (.cse66 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737)) (.cse67 (select (select .cse70 c_~B~0.base) c_~B~0.offset)) (.cse68 (+ (* ~a~0 4) c_~B~0.offset))) (or (= (select (select (store (store .cse66 c_~A~0.base v_ArrVal_739) .cse67 v_ArrVal_744) c_~B~0.base) .cse68) (+ c_~A~0.offset .cse69)) (< ~a~0 0) (< (+ c_~A~0.offset .cse69 .cse34) (+ 5 (select (select .cse66 c_~B~0.base) c_~B~0.offset))) (= .cse67 (select (select (store (store .cse70 c_~A~0.base v_ArrVal_740) .cse67 v_ArrVal_743) c_~B~0.base) .cse68)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_743 (Array Int Int)) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse71 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736)) (.cse75 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse74 (select (select .cse75 c_~B~0.base) c_~B~0.offset)) (.cse72 (select (select .cse71 c_~B~0.base) c_~B~0.offset)) (.cse73 (+ (* ~a~0 4) c_~B~0.offset))) (or (< ~a~0 0) (= (select (select (store (store .cse71 c_~A~0.base v_ArrVal_740) .cse72 v_ArrVal_743) c_~B~0.base) .cse73) c_~A~0.base) (< (+ (* ~a~0 c_~M~0) c_~M~0) (+ 2 (div (+ .cse0 .cse74) 4))) (< .cse74 (+ (select (select (store (store .cse75 c_~A~0.base v_ArrVal_739) .cse72 v_ArrVal_744) c_~B~0.base) .cse73) 1)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse79 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse77 (* (* ~a~0 c_~M~0) 4)) (.cse76 (select (select .cse79 c_~B~0.base) c_~B~0.offset)) (.cse78 (select (select (store (store .cse79 c_~A~0.base v_ArrVal_739) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< .cse76 (+ c_~A~0.offset .cse77 1)) (= .cse78 (+ c_~A~0.offset .cse77)) (< ~a~0 0) (< .cse76 (+ .cse78 1)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse82 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse81 (select (select .cse82 c_~B~0.base) c_~B~0.offset))) (let ((.cse80 (select (select (store (store .cse82 c_~A~0.base v_ArrVal_740) .cse81 v_ArrVal_743) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737) c_~B~0.base) c_~B~0.offset) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)) (< ~a~0 0) (= .cse80 c_~A~0.base) (= .cse81 .cse80) (<= c_~N~0 ~a~0)))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse86 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse83 (select (select (store (store .cse86 c_~A~0.base v_ArrVal_739) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (.cse84 (* (* ~a~0 c_~M~0) 4)) (.cse85 (+ 5 (select (select .cse86 c_~B~0.base) c_~B~0.offset)))) (or (= .cse83 (+ c_~A~0.offset .cse84)) (< (+ .cse83 .cse34) .cse85) (< ~a~0 0) (< (+ c_~A~0.offset .cse84 .cse34) .cse85) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_736 (Array Int Int))) (let ((.cse87 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset))) (or (= .cse87 c_~A~0.base) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse89 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse88 (select (select (store (store .cse89 c_~A~0.base v_ArrVal_739) .cse87 v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= .cse88 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< ~a~0 0) (< (select (select .cse89 c_~B~0.base) c_~B~0.offset) (+ .cse88 1)) (<= c_~N~0 ~a~0)))))))) (forall ((v_ArrVal_734 (Array Int Int)) (v_ArrVal_736 (Array Int Int))) (let ((.cse92 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse91 (select (select .cse92 c_~B~0.base) c_~B~0.offset))) (or (forall ((v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_740 (Array Int Int))) (let ((.cse90 (select (select (store (store .cse92 c_~A~0.base v_ArrVal_740) .cse91 v_ArrVal_743) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse90 c_~A~0.base) (= .cse91 .cse90) (<= c_~N~0 ~a~0)))) (= .cse91 c_~A~0.base))))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int))) (let ((.cse97 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse98 (select (select .cse97 c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse93 (div (+ c_~A~0.offset (- .cse98)) (- 4))) (.cse94 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< .cse93 .cse94) (<= (+ .cse94 c_~M~0) .cse93) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse95 (select (select (store (store .cse97 c_~A~0.base v_ArrVal_739) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (.cse96 (+ c_~A~0.offset (* .cse94 4)))) (or (= .cse95 .cse96) (= (+ .cse95 (* .cse93 4)) .cse96)))) (<= c_~N~0 ~a~0)))) (not (= (mod (+ c_~A~0.offset (* 3 .cse98)) 4) 0)))))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_736 (Array Int Int))) (let ((.cse101 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset))) (or (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse100 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse99 (select (select (store (store .cse100 c_~A~0.base v_ArrVal_739) .cse101 v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= .cse99 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< (+ .cse99 .cse34) (+ 5 (select (select .cse100 c_~B~0.base) c_~B~0.offset))) (< ~a~0 0) (<= c_~N~0 ~a~0))))) (= .cse101 c_~A~0.base)))))) (< 1 c_~M~0) (not (< 0 c_~M~0))) is different from false [2022-11-18 19:45:43,225 WARN L233 SmtUtils]: Spent 55.08s on a formula simplification that was a NOOP. DAG size: 173 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:46:56,891 WARN L233 SmtUtils]: Spent 1.01m on a formula simplification that was a NOOP. DAG size: 174 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:48:00,606 WARN L233 SmtUtils]: Spent 49.57s on a formula simplification that was a NOOP. DAG size: 174 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:48:02,263 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:48:02,264 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 63 treesize of output 64 [2022-11-18 19:48:02,281 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:48:02,282 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 156 treesize of output 108 [2022-11-18 19:48:02,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29198 treesize of output 28686 [2022-11-18 19:48:02,457 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 28686 treesize of output 27150 [2022-11-18 19:48:02,606 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 27150 treesize of output 24078 [2022-11-18 19:48:02,754 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 24078 treesize of output 23694 [2022-11-18 19:48:02,892 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 23694 treesize of output 22926 [2022-11-18 19:48:03,049 INFO L321 Elim1Store]: treesize reduction 10, result has 69.7 percent of original size [2022-11-18 19:48:03,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71584 treesize of output 67526 [2022-11-18 19:48:03,609 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:48:03,611 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 67500 treesize of output 65410 [2022-11-18 19:48:03,918 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:48:03,919 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 65400 treesize of output 61210 [2022-11-18 19:48:04,216 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 8950 treesize of output 7414 [2022-11-18 19:48:04,518 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 7414 treesize of output 6646