./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4a4af3-ccf6-4956-8739-e80886bbe441/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4a4af3-ccf6-4956-8739-e80886bbe441/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4a4af3-ccf6-4956-8739-e80886bbe441/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4a4af3-ccf6-4956-8739-e80886bbe441/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4a4af3-ccf6-4956-8739-e80886bbe441/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4a4af3-ccf6-4956-8739-e80886bbe441/bin/uautomizer-vX5HgA9Q3a --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 9eb5d9094342cfaa74d8ea4903febd735be5757c093d69b0f8dbb2a26886fda6 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 16:42:36,161 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:42:36,163 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:42:36,230 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:42:36,230 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:42:36,231 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:42:36,233 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:42:36,234 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:42:36,236 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:42:36,237 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:42:36,238 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:42:36,239 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:42:36,240 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:42:36,241 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:42:36,242 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:42:36,247 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:42:36,250 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:42:36,255 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:42:36,259 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:42:36,266 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:42:36,281 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:42:36,282 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:42:36,283 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:42:36,284 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:42:36,287 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:42:36,287 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:42:36,288 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:42:36,289 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:42:36,289 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:42:36,290 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:42:36,290 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:42:36,295 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:42:36,297 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:42:36,298 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:42:36,300 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:42:36,301 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:42:36,301 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:42:36,301 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:42:36,302 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:42:36,305 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:42:36,306 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:42:36,307 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4a4af3-ccf6-4956-8739-e80886bbe441/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-21 16:42:36,345 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:42:36,345 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:42:36,346 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:42:36,346 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:42:36,347 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:42:36,347 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:42:36,347 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:42:36,348 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:42:36,348 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:42:36,348 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:42:36,349 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:42:36,349 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:42:36,349 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:42:36,350 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:42:36,350 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 16:42:36,350 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:42:36,350 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 16:42:36,350 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:42:36,350 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 16:42:36,351 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:42:36,351 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 16:42:36,351 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:42:36,351 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:42:36,351 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:42:36,352 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:42:36,352 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:42:36,352 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:42:36,352 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 16:42:36,352 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:42:36,353 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:42:36,353 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 16:42:36,353 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 16:42:36,353 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 16:42:36,353 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_5e4a4af3-ccf6-4956-8739-e80886bbe441/bin/uautomizer-vX5HgA9Q3a/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_5e4a4af3-ccf6-4956-8739-e80886bbe441/bin/uautomizer-vX5HgA9Q3a 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 -> 9eb5d9094342cfaa74d8ea4903febd735be5757c093d69b0f8dbb2a26886fda6 [2022-11-21 16:42:36,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:42:36,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:42:36,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:42:36,682 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:42:36,683 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:42:36,684 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4a4af3-ccf6-4956-8739-e80886bbe441/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c [2022-11-21 16:42:39,672 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:42:39,915 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:42:39,916 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4a4af3-ccf6-4956-8739-e80886bbe441/sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c [2022-11-21 16:42:39,923 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4a4af3-ccf6-4956-8739-e80886bbe441/bin/uautomizer-vX5HgA9Q3a/data/bbc3690dc/413b85b0b43e46abbff43be5e32fb227/FLAGd9f471fd4 [2022-11-21 16:42:39,937 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4a4af3-ccf6-4956-8739-e80886bbe441/bin/uautomizer-vX5HgA9Q3a/data/bbc3690dc/413b85b0b43e46abbff43be5e32fb227 [2022-11-21 16:42:39,940 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:42:39,941 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:42:39,942 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:42:39,942 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:42:39,946 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:42:39,947 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:42:39" (1/1) ... [2022-11-21 16:42:39,948 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eec5c06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:42:39, skipping insertion in model container [2022-11-21 16:42:39,948 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:42:39" (1/1) ... [2022-11-21 16:42:39,955 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:42:39,979 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:42:40,234 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4a4af3-ccf6-4956-8739-e80886bbe441/sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c[2599,2612] [2022-11-21 16:42:40,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:42:40,277 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:42:40,299 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4a4af3-ccf6-4956-8739-e80886bbe441/sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c[2599,2612] [2022-11-21 16:42:40,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:42:40,323 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:42:40,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:42:40 WrapperNode [2022-11-21 16:42:40,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:42:40,325 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:42:40,325 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:42:40,326 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:42:40,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:42:40" (1/1) ... [2022-11-21 16:42:40,340 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:42:40" (1/1) ... [2022-11-21 16:42:40,379 INFO L138 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 271 [2022-11-21 16:42:40,379 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:42:40,380 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:42:40,380 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:42:40,380 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:42:40,389 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:42:40" (1/1) ... [2022-11-21 16:42:40,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:42:40" (1/1) ... [2022-11-21 16:42:40,396 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:42:40" (1/1) ... [2022-11-21 16:42:40,399 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:42:40" (1/1) ... [2022-11-21 16:42:40,407 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:42:40" (1/1) ... [2022-11-21 16:42:40,427 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:42:40" (1/1) ... [2022-11-21 16:42:40,429 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:42:40" (1/1) ... [2022-11-21 16:42:40,431 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:42:40" (1/1) ... [2022-11-21 16:42:40,434 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:42:40,450 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:42:40,450 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:42:40,450 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:42:40,451 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:42:40" (1/1) ... [2022-11-21 16:42:40,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:42:40,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4a4af3-ccf6-4956-8739-e80886bbe441/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:42:40,480 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4a4af3-ccf6-4956-8739-e80886bbe441/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:42:40,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4a4af3-ccf6-4956-8739-e80886bbe441/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:42:40,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:42:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 16:42:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 16:42:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 16:42:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-21 16:42:40,515 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-21 16:42:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-21 16:42:40,516 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-21 16:42:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-21 16:42:40,516 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-21 16:42:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:42:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-21 16:42:40,517 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-21 16:42:40,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 16:42:40,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:42:40,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:42:40,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:42:40,519 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 16:42:40,631 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:42:40,633 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:42:41,281 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:42:41,577 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:42:41,577 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-21 16:42:41,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:42:41 BoogieIcfgContainer [2022-11-21 16:42:41,580 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:42:41,582 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:42:41,582 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:42:41,585 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:42:41,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:42:39" (1/3) ... [2022-11-21 16:42:41,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e98e5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:42:41, skipping insertion in model container [2022-11-21 16:42:41,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:42:40" (2/3) ... [2022-11-21 16:42:41,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e98e5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:42:41, skipping insertion in model container [2022-11-21 16:42:41,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:42:41" (3/3) ... [2022-11-21 16:42:41,588 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum2.wvr.c [2022-11-21 16:42:41,597 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-21 16:42:41,608 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:42:41,608 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-21 16:42:41,608 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 16:42:41,687 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-21 16:42:41,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 187 places, 193 transitions, 410 flow [2022-11-21 16:42:41,924 INFO L130 PetriNetUnfolder]: 16/190 cut-off events. [2022-11-21 16:42:41,924 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-21 16:42:41,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 190 events. 16/190 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 108 event pairs, 0 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 152. Up to 2 conditions per place. [2022-11-21 16:42:41,929 INFO L82 GeneralOperation]: Start removeDead. Operand has 187 places, 193 transitions, 410 flow [2022-11-21 16:42:41,939 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 173 places, 179 transitions, 376 flow [2022-11-21 16:42:41,959 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:42:41,972 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;@582651fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:42:41,973 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-21 16:42:42,045 INFO L130 PetriNetUnfolder]: 16/178 cut-off events. [2022-11-21 16:42:42,045 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-21 16:42:42,046 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:42:42,047 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] [2022-11-21 16:42:42,048 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-21 16:42:42,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:42:42,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1680605842, now seen corresponding path program 1 times [2022-11-21 16:42:42,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:42:42,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897380625] [2022-11-21 16:42:42,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:42:42,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:42:42,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:42:42,455 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-21 16:42:42,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:42:42,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897380625] [2022-11-21 16:42:42,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897380625] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:42:42,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:42:42,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:42:42,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246677714] [2022-11-21 16:42:42,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:42:42,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 16:42:42,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:42:42,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 16:42:42,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:42:42,505 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 193 [2022-11-21 16:42:42,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 179 transitions, 376 flow. Second operand has 2 states, 2 states have (on average 177.5) internal successors, (355), 2 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:42,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:42:42,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 193 [2022-11-21 16:42:42,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:42:42,627 INFO L130 PetriNetUnfolder]: 42/301 cut-off events. [2022-11-21 16:42:42,627 INFO L131 PetriNetUnfolder]: For 49/50 co-relation queries the response was YES. [2022-11-21 16:42:42,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 392 conditions, 301 events. 42/301 cut-off events. For 49/50 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 706 event pairs, 15 based on Foata normal form. 45/313 useless extension candidates. Maximal degree in co-relation 216. Up to 59 conditions per place. [2022-11-21 16:42:42,631 INFO L137 encePairwiseOnDemand]: 182/193 looper letters, 9 selfloop transitions, 0 changer transitions 6/168 dead transitions. [2022-11-21 16:42:42,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 168 transitions, 372 flow [2022-11-21 16:42:42,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 16:42:42,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-21 16:42:42,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 364 transitions. [2022-11-21 16:42:42,652 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9430051813471503 [2022-11-21 16:42:42,653 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 364 transitions. [2022-11-21 16:42:42,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 364 transitions. [2022-11-21 16:42:42,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:42:42,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 364 transitions. [2022-11-21 16:42:42,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 182.0) internal successors, (364), 2 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:42,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:42,676 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:42,678 INFO L175 Difference]: Start difference. First operand has 173 places, 179 transitions, 376 flow. Second operand 2 states and 364 transitions. [2022-11-21 16:42:42,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 168 transitions, 372 flow [2022-11-21 16:42:42,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 168 transitions, 360 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-21 16:42:42,688 INFO L231 Difference]: Finished difference. Result has 168 places, 162 transitions, 330 flow [2022-11-21 16:42:42,690 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=330, PETRI_PLACES=168, PETRI_TRANSITIONS=162} [2022-11-21 16:42:42,696 INFO L288 CegarLoopForPetriNet]: 173 programPoint places, -5 predicate places. [2022-11-21 16:42:42,697 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 162 transitions, 330 flow [2022-11-21 16:42:42,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 177.5) internal successors, (355), 2 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:42,697 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:42:42,698 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] [2022-11-21 16:42:42,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:42:42,699 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-21 16:42:42,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:42:42,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1190650759, now seen corresponding path program 1 times [2022-11-21 16:42:42,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:42:42,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99061586] [2022-11-21 16:42:42,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:42:42,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:42:42,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:42:43,415 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-21 16:42:43,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:42:43,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99061586] [2022-11-21 16:42:43,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99061586] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:42:43,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:42:43,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:42:43,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771532396] [2022-11-21 16:42:43,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:42:43,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:42:43,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:42:43,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:42:43,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:42:43,428 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 193 [2022-11-21 16:42:43,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 162 transitions, 330 flow. Second operand has 6 states, 6 states have (on average 133.66666666666666) internal successors, (802), 6 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:43,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:42:43,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 193 [2022-11-21 16:42:43,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:42:43,787 INFO L130 PetriNetUnfolder]: 396/820 cut-off events. [2022-11-21 16:42:43,787 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-11-21 16:42:43,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1434 conditions, 820 events. 396/820 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3297 event pairs, 104 based on Foata normal form. 0/629 useless extension candidates. Maximal degree in co-relation 1431. Up to 305 conditions per place. [2022-11-21 16:42:43,799 INFO L137 encePairwiseOnDemand]: 186/193 looper letters, 51 selfloop transitions, 6 changer transitions 0/171 dead transitions. [2022-11-21 16:42:43,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 171 transitions, 464 flow [2022-11-21 16:42:43,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:42:43,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-21 16:42:43,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 820 transitions. [2022-11-21 16:42:43,804 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7081174438687392 [2022-11-21 16:42:43,804 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 820 transitions. [2022-11-21 16:42:43,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 820 transitions. [2022-11-21 16:42:43,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:42:43,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 820 transitions. [2022-11-21 16:42:43,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.66666666666666) internal successors, (820), 6 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:43,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:43,843 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:43,843 INFO L175 Difference]: Start difference. First operand has 168 places, 162 transitions, 330 flow. Second operand 6 states and 820 transitions. [2022-11-21 16:42:43,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 171 transitions, 464 flow [2022-11-21 16:42:43,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 171 transitions, 464 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-21 16:42:43,848 INFO L231 Difference]: Finished difference. Result has 169 places, 163 transitions, 355 flow [2022-11-21 16:42:43,849 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=355, PETRI_PLACES=169, PETRI_TRANSITIONS=163} [2022-11-21 16:42:43,850 INFO L288 CegarLoopForPetriNet]: 173 programPoint places, -4 predicate places. [2022-11-21 16:42:43,850 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 163 transitions, 355 flow [2022-11-21 16:42:43,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.66666666666666) internal successors, (802), 6 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:43,851 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:42:43,851 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] [2022-11-21 16:42:43,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:42:43,852 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-21 16:42:43,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:42:43,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1689496800, now seen corresponding path program 1 times [2022-11-21 16:42:43,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:42:43,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130149914] [2022-11-21 16:42:43,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:42:43,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:42:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:42:44,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:42:44,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:42:44,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130149914] [2022-11-21 16:42:44,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130149914] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:42:44,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:42:44,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-21 16:42:44,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288365255] [2022-11-21 16:42:44,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:42:44,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:42:44,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:42:44,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:42:44,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:42:44,499 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 193 [2022-11-21 16:42:44,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 163 transitions, 355 flow. Second operand has 9 states, 9 states have (on average 115.0) internal successors, (1035), 9 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:44,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:42:44,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 193 [2022-11-21 16:42:44,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:42:44,930 INFO L130 PetriNetUnfolder]: 398/875 cut-off events. [2022-11-21 16:42:44,930 INFO L131 PetriNetUnfolder]: For 204/204 co-relation queries the response was YES. [2022-11-21 16:42:44,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1714 conditions, 875 events. 398/875 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3418 event pairs, 199 based on Foata normal form. 1/695 useless extension candidates. Maximal degree in co-relation 1708. Up to 525 conditions per place. [2022-11-21 16:42:44,937 INFO L137 encePairwiseOnDemand]: 177/193 looper letters, 72 selfloop transitions, 11 changer transitions 23/202 dead transitions. [2022-11-21 16:42:44,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 202 transitions, 651 flow [2022-11-21 16:42:44,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:42:44,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-21 16:42:44,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1087 transitions. [2022-11-21 16:42:44,940 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6257915947035118 [2022-11-21 16:42:44,941 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1087 transitions. [2022-11-21 16:42:44,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1087 transitions. [2022-11-21 16:42:44,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:42:44,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1087 transitions. [2022-11-21 16:42:44,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.77777777777777) internal successors, (1087), 9 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:44,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 193.0) internal successors, (1930), 10 states have internal predecessors, (1930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:44,949 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 193.0) internal successors, (1930), 10 states have internal predecessors, (1930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:44,949 INFO L175 Difference]: Start difference. First operand has 169 places, 163 transitions, 355 flow. Second operand 9 states and 1087 transitions. [2022-11-21 16:42:44,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 202 transitions, 651 flow [2022-11-21 16:42:44,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 202 transitions, 639 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-21 16:42:44,955 INFO L231 Difference]: Finished difference. Result has 177 places, 165 transitions, 393 flow [2022-11-21 16:42:44,956 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=393, PETRI_PLACES=177, PETRI_TRANSITIONS=165} [2022-11-21 16:42:44,956 INFO L288 CegarLoopForPetriNet]: 173 programPoint places, 4 predicate places. [2022-11-21 16:42:44,957 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 165 transitions, 393 flow [2022-11-21 16:42:44,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.0) internal successors, (1035), 9 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:44,958 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:42:44,958 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] [2022-11-21 16:42:44,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 16:42:44,959 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-21 16:42:44,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:42:44,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1856952462, now seen corresponding path program 1 times [2022-11-21 16:42:44,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:42:44,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741475533] [2022-11-21 16:42:44,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:42:44,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:42:44,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:42:45,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 16:42:45,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:42:45,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741475533] [2022-11-21 16:42:45,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741475533] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:42:45,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913703072] [2022-11-21 16:42:45,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:42:45,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:42:45,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4a4af3-ccf6-4956-8739-e80886bbe441/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:42:45,199 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4a4af3-ccf6-4956-8739-e80886bbe441/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:42:45,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4a4af3-ccf6-4956-8739-e80886bbe441/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 16:42:45,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:42:45,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 16:42:45,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:42:45,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 16:42:45,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:42:45,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 16:42:45,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913703072] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-21 16:42:45,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-21 16:42:45,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-11-21 16:42:45,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386372819] [2022-11-21 16:42:45,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:42:45,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:42:45,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:42:45,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:42:45,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-21 16:42:45,935 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 193 [2022-11-21 16:42:45,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 165 transitions, 393 flow. Second operand has 7 states, 7 states have (on average 143.42857142857142) internal successors, (1004), 7 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:45,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:42:45,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 193 [2022-11-21 16:42:45,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:42:46,166 INFO L130 PetriNetUnfolder]: 168/525 cut-off events. [2022-11-21 16:42:46,166 INFO L131 PetriNetUnfolder]: For 180/212 co-relation queries the response was YES. [2022-11-21 16:42:46,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 955 conditions, 525 events. 168/525 cut-off events. For 180/212 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1922 event pairs, 45 based on Foata normal form. 32/501 useless extension candidates. Maximal degree in co-relation 945. Up to 146 conditions per place. [2022-11-21 16:42:46,171 INFO L137 encePairwiseOnDemand]: 185/193 looper letters, 48 selfloop transitions, 7 changer transitions 0/174 dead transitions. [2022-11-21 16:42:46,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 174 transitions, 532 flow [2022-11-21 16:42:46,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:42:46,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-21 16:42:46,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1018 transitions. [2022-11-21 16:42:46,175 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7535159141376758 [2022-11-21 16:42:46,175 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1018 transitions. [2022-11-21 16:42:46,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1018 transitions. [2022-11-21 16:42:46,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:42:46,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1018 transitions. [2022-11-21 16:42:46,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 145.42857142857142) internal successors, (1018), 7 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:46,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:46,182 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:46,182 INFO L175 Difference]: Start difference. First operand has 177 places, 165 transitions, 393 flow. Second operand 7 states and 1018 transitions. [2022-11-21 16:42:46,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 174 transitions, 532 flow [2022-11-21 16:42:46,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 174 transitions, 506 flow, removed 3 selfloop flow, removed 7 redundant places. [2022-11-21 16:42:46,188 INFO L231 Difference]: Finished difference. Result has 177 places, 167 transitions, 401 flow [2022-11-21 16:42:46,188 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=401, PETRI_PLACES=177, PETRI_TRANSITIONS=167} [2022-11-21 16:42:46,189 INFO L288 CegarLoopForPetriNet]: 173 programPoint places, 4 predicate places. [2022-11-21 16:42:46,189 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 167 transitions, 401 flow [2022-11-21 16:42:46,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 143.42857142857142) internal successors, (1004), 7 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:46,190 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:42:46,191 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] [2022-11-21 16:42:46,203 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4a4af3-ccf6-4956-8739-e80886bbe441/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 16:42:46,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4a4af3-ccf6-4956-8739-e80886bbe441/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:42:46,398 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-21 16:42:46,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:42:46,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1028802405, now seen corresponding path program 1 times [2022-11-21 16:42:46,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:42:46,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039319758] [2022-11-21 16:42:46,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:42:46,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:42:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:42:49,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 16:42:49,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:42:49,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039319758] [2022-11-21 16:42:49,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039319758] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:42:49,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085994051] [2022-11-21 16:42:49,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:42:49,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:42:49,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4a4af3-ccf6-4956-8739-e80886bbe441/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:42:49,503 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4a4af3-ccf6-4956-8739-e80886bbe441/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:42:49,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4a4af3-ccf6-4956-8739-e80886bbe441/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 16:42:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:42:49,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 98 conjunts are in the unsatisfiable core [2022-11-21 16:42:49,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:42:49,836 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-21 16:42:50,372 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 16:42:50,373 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-21 16:42:50,808 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-21 16:42:52,028 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-21 16:42:52,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 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-21 16:42:52,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 16:42:53,112 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-21 16:42:53,301 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-21 16:42:53,471 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 6 treesize of output 5 [2022-11-21 16:42:54,174 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:42:54,175 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 33 treesize of output 85 [2022-11-21 16:42:54,490 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:42:54,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:42:55,304 WARN L837 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (~B~0.base Int) (v_ArrVal_136 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136))) (let ((.cse1 (select .cse3 c_~A~0.base)) (.cse0 (select .cse3 ~B~0.base))) (= (+ (select .cse0 c_~B~0.offset) (select .cse1 c_~A~0.offset) c_~res1~0) (let ((.cse2 (* ~M~0 4))) (+ c_~res2~0 (select .cse1 (+ c_~A~0.offset .cse2)) (select .cse0 (+ .cse2 c_~B~0.offset))))))))) is different from false [2022-11-21 16:42:55,450 WARN L837 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (~B~0.base Int) (v_ArrVal_135 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136))) (let ((.cse0 (select .cse3 ~B~0.base)) (.cse2 (select .cse3 c_~A~0.base))) (= (let ((.cse1 (* ~M~0 4))) (+ (select .cse0 (+ .cse1 c_~B~0.offset)) c_~res2~0 (select .cse2 (+ c_~A~0.offset .cse1)))) (+ (select .cse0 c_~B~0.offset) c_~res1~0 (select .cse2 c_~A~0.offset))))))) is different from false [2022-11-21 16:42:55,577 WARN L837 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (~B~0.base Int) (v_ArrVal_135 (Array Int Int)) (v_ArrVal_134 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_134) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136))) (let ((.cse2 (select .cse3 ~B~0.base)) (.cse0 (select .cse3 c_~A~0.base))) (= (let ((.cse1 (* ~M~0 4))) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset .cse1)) (select .cse2 (+ .cse1 c_~B~0.offset)))) (+ (select .cse2 c_~B~0.offset) c_~res1~0 (select .cse0 c_~A~0.offset))))))) is different from false [2022-11-21 16:42:55,780 WARN L837 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (~B~0.base Int) (v_ArrVal_135 (Array Int Int)) (v_ArrVal_134 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_134) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136))) (let ((.cse2 (select .cse3 c_~A~0.base)) (.cse0 (select .cse3 ~B~0.base))) (= (let ((.cse1 (* ~M~0 4))) (+ c_~res2~0 (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_#t~ret19#1.offset|)) (select .cse2 (+ c_~A~0.offset .cse1)))) (+ c_~res1~0 (select .cse2 c_~A~0.offset) (select .cse0 |c_ULTIMATE.start_main_#t~ret19#1.offset|))))))) is different from false [2022-11-21 16:42:55,832 WARN L837 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (~B~0.base Int) (v_ArrVal_135 (Array Int Int)) (v_ArrVal_134 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_134) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136))) (let ((.cse0 (select .cse3 ~B~0.base)) (.cse1 (select .cse3 c_~A~0.base))) (= (+ c_~res1~0 (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (select .cse1 c_~A~0.offset)) (let ((.cse2 (* ~M~0 4))) (+ (select .cse0 (+ .cse2 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~res2~0 (select .cse1 (+ c_~A~0.offset .cse2))))))))) is different from false [2022-11-21 16:42:55,861 WARN L837 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (~B~0.base Int) (v_ArrVal_135 (Array Int Int)) (v_ArrVal_134 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_134) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136))) (let ((.cse1 (select .cse3 ~B~0.base)) (.cse0 (select .cse3 c_~A~0.base))) (= (+ c_~res1~0 (select .cse0 c_~A~0.offset) (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (let ((.cse2 (* ~M~0 4))) (+ c_~res2~0 (select .cse1 (+ .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse0 (+ c_~A~0.offset .cse2))))))))) is different from false [2022-11-21 16:42:55,982 WARN L837 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_133 (Array Int Int)) (~B~0.base Int) (v_ArrVal_135 (Array Int Int)) (v_ArrVal_134 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (let ((.cse3 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_133) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_134) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136))) (let ((.cse0 (select .cse3 ~B~0.base)) (.cse2 (select .cse3 c_~A~0.base))) (= (let ((.cse1 (* ~M~0 4))) (+ (select .cse0 (+ .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse2 (+ c_~A~0.offset .cse1)) c_~res2~0)) (+ c_~res1~0 (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select .cse2 c_~A~0.offset))))) (not (< ~M~0 c_~N~0)))) is different from false [2022-11-21 16:42:56,103 WARN L837 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_133 (Array Int Int)) (~B~0.base Int) (v_ArrVal_135 (Array Int Int)) (v_ArrVal_134 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (or (let ((.cse3 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base| v_ArrVal_133) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_134) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136))) (let ((.cse2 (select .cse3 ~B~0.base)) (.cse0 (select .cse3 c_~A~0.base))) (= (let ((.cse1 (* ~M~0 4))) (+ (select .cse0 (+ c_~A~0.offset .cse1)) c_~res2~0 (select .cse2 (+ |c_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset| .cse1)))) (+ (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset|) c_~res1~0 (select .cse0 c_~A~0.offset))))) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))) is different from false [2022-11-21 16:42:57,844 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:42:57,844 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 127 treesize of output 92 [2022-11-21 16:42:57,947 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:42:57,948 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 137206 treesize of output 131644 [2022-11-21 16:42:58,718 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:42:58,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 131574 treesize of output 102960 [2022-11-21 16:42:59,256 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:42:59,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 102902 treesize of output 95792 [2022-11-21 16:42:59,739 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:42:59,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 95734 treesize of output 81456 [2022-11-21 16:43:00,266 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:43:00,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 81398 treesize of output 77872 [2022-11-21 16:43:40,669 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 16:43:40,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-21 16:43:40,688 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-21 16:43:40,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085994051] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:43:40,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:43:40,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 37, 35] total 88 [2022-11-21 16:43:40,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871314434] [2022-11-21 16:43:40,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:43:40,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2022-11-21 16:43:40,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:43:40,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2022-11-21 16:43:40,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=959, Invalid=5331, Unknown=62, NotChecked=1304, Total=7656 [2022-11-21 16:43:40,701 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 193 [2022-11-21 16:43:40,708 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 167 transitions, 401 flow. Second operand has 88 states, 88 states have (on average 70.02272727272727) internal successors, (6162), 88 states have internal predecessors, (6162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:43:40,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:43:40,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 193 [2022-11-21 16:43:40,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:43:54,001 INFO L130 PetriNetUnfolder]: 1642/3667 cut-off events. [2022-11-21 16:43:54,002 INFO L131 PetriNetUnfolder]: For 1185/1185 co-relation queries the response was YES. [2022-11-21 16:43:54,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7382 conditions, 3667 events. 1642/3667 cut-off events. For 1185/1185 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 25672 event pairs, 304 based on Foata normal form. 1/3462 useless extension candidates. Maximal degree in co-relation 7372. Up to 1273 conditions per place. [2022-11-21 16:43:54,034 INFO L137 encePairwiseOnDemand]: 143/193 looper letters, 239 selfloop transitions, 124 changer transitions 6/429 dead transitions. [2022-11-21 16:43:54,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 429 transitions, 1898 flow [2022-11-21 16:43:54,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-11-21 16:43:54,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2022-11-21 16:43:54,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 4786 transitions. [2022-11-21 16:43:54,050 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3757261736536348 [2022-11-21 16:43:54,050 INFO L72 ComplementDD]: Start complementDD. Operand 66 states and 4786 transitions. [2022-11-21 16:43:54,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 4786 transitions. [2022-11-21 16:43:54,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:43:54,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 66 states and 4786 transitions. [2022-11-21 16:43:54,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 67 states, 66 states have (on average 72.51515151515152) internal successors, (4786), 66 states have internal predecessors, (4786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:43:54,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 67 states, 67 states have (on average 193.0) internal successors, (12931), 67 states have internal predecessors, (12931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:43:54,091 INFO L81 ComplementDD]: Finished complementDD. Result has 67 states, 67 states have (on average 193.0) internal successors, (12931), 67 states have internal predecessors, (12931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:43:54,091 INFO L175 Difference]: Start difference. First operand has 177 places, 167 transitions, 401 flow. Second operand 66 states and 4786 transitions. [2022-11-21 16:43:54,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 429 transitions, 1898 flow [2022-11-21 16:43:54,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 429 transitions, 1863 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-21 16:43:54,103 INFO L231 Difference]: Finished difference. Result has 261 places, 272 transitions, 1084 flow [2022-11-21 16:43:54,104 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=66, PETRI_FLOW=1084, PETRI_PLACES=261, PETRI_TRANSITIONS=272} [2022-11-21 16:43:54,105 INFO L288 CegarLoopForPetriNet]: 173 programPoint places, 88 predicate places. [2022-11-21 16:43:54,105 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 272 transitions, 1084 flow [2022-11-21 16:43:54,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 88 states have (on average 70.02272727272727) internal successors, (6162), 88 states have internal predecessors, (6162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:43:54,108 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:43:54,108 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] [2022-11-21 16:43:54,115 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4a4af3-ccf6-4956-8739-e80886bbe441/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 16:43:54,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4a4af3-ccf6-4956-8739-e80886bbe441/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:43:54,315 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-21 16:43:54,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:43:54,316 INFO L85 PathProgramCache]: Analyzing trace with hash -2029301371, now seen corresponding path program 2 times [2022-11-21 16:43:54,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:43:54,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055389299] [2022-11-21 16:43:54,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:43:54,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:43:54,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:43:57,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 16:43:57,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:43:57,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055389299] [2022-11-21 16:43:57,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055389299] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:43:57,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576225629] [2022-11-21 16:43:57,410 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:43:57,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:43:57,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4a4af3-ccf6-4956-8739-e80886bbe441/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:43:57,414 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4a4af3-ccf6-4956-8739-e80886bbe441/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:43:57,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4a4af3-ccf6-4956-8739-e80886bbe441/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 16:43:57,585 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 16:43:57,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:43:57,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 84 conjunts are in the unsatisfiable core [2022-11-21 16:43:57,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:43:59,382 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 15 treesize of output 11 [2022-11-21 16:44:00,251 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-21 16:44:00,541 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-21 16:44:00,735 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-21 16:44:01,195 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:44:01,195 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 33 treesize of output 85 [2022-11-21 16:44:01,584 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 16:44:01,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:44:55,379 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_180 (Array Int Int)) (|thread3Thread1of1ForFork1_~i~2#1| Int) (v_ArrVal_181 (Array Int Int)) (~A~0.base Int)) (or (not (< |thread3Thread1of1ForFork1_~i~2#1| c_~N~0)) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) c_~N~0) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181))) (let ((.cse0 (select .cse4 c_~B~0.base)) (.cse2 (select .cse4 ~A~0.base))) (= (let ((.cse1 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (+ (select .cse0 (+ c_~B~0.offset .cse1)) c_~res1~0 (select .cse2 (+ c_~A~0.offset .cse1)))) (let ((.cse3 (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) (+ (select .cse0 (+ .cse3 c_~B~0.offset)) c_~res2~0 (select .cse2 (+ c_~A~0.offset .cse3))))))))) is different from false [2022-11-21 16:44:57,465 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_180 (Array Int Int)) (|thread3Thread1of1ForFork1_~i~2#1| Int) (v_ArrVal_181 (Array Int Int)) (~A~0.base Int)) (or (not (< |thread3Thread1of1ForFork1_~i~2#1| c_~N~0)) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) c_~N~0) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181))) (let ((.cse1 (select .cse3 c_~B~0.base)) (.cse0 (select .cse3 ~A~0.base))) (= (+ (select .cse0 c_~A~0.offset) c_~res1~0 (select .cse1 c_~B~0.offset)) (let ((.cse2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) (+ (select .cse1 (+ .cse2 c_~B~0.offset)) c_~res2~0 (select .cse0 (+ c_~A~0.offset .cse2))))))))) is different from false [2022-11-21 16:44:57,503 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_180 (Array Int Int)) (|thread3Thread1of1ForFork1_~i~2#1| Int) (v_ArrVal_181 (Array Int Int)) (v_ArrVal_179 (Array Int Int)) (~A~0.base Int)) (or (not (< |thread3Thread1of1ForFork1_~i~2#1| c_~N~0)) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) c_~N~0) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_179) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181))) (let ((.cse2 (select .cse3 c_~B~0.base)) (.cse0 (select .cse3 ~A~0.base))) (= (let ((.cse1 (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset .cse1)) (select .cse2 (+ .cse1 c_~B~0.offset)))) (+ (select .cse2 c_~B~0.offset) (select .cse0 c_~A~0.offset) c_~res1~0)))))) is different from false [2022-11-21 16:44:59,692 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_180 (Array Int Int)) (|thread3Thread1of1ForFork1_~i~2#1| Int) (v_ArrVal_181 (Array Int Int)) (v_ArrVal_179 (Array Int Int)) (~A~0.base Int)) (or (not (< |thread3Thread1of1ForFork1_~i~2#1| c_~N~0)) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) c_~N~0) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_179) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181))) (let ((.cse1 (select .cse3 ~A~0.base)) (.cse0 (select .cse3 |c_ULTIMATE.start_main_#t~ret19#1.base|))) (= (+ (select .cse0 |c_ULTIMATE.start_main_#t~ret19#1.offset|) (select .cse1 c_~A~0.offset) c_~res1~0) (let ((.cse2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) (+ c_~res2~0 (select .cse1 (+ c_~A~0.offset .cse2)) (select .cse0 (+ .cse2 |c_ULTIMATE.start_main_#t~ret19#1.offset|))))))))) is different from false [2022-11-21 16:45:01,735 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_180 (Array Int Int)) (|thread3Thread1of1ForFork1_~i~2#1| Int) (v_ArrVal_181 (Array Int Int)) (v_ArrVal_179 (Array Int Int)) (~A~0.base Int)) (or (not (< |thread3Thread1of1ForFork1_~i~2#1| c_~N~0)) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) c_~N~0) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_179) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse0 (select .cse3 ~A~0.base))) (= (let ((.cse1 (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset .cse1)) (select .cse2 (+ .cse1 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (+ (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (select .cse0 c_~A~0.offset) c_~res1~0)))))) is different from false [2022-11-21 16:45:03,767 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_180 (Array Int Int)) (|thread3Thread1of1ForFork1_~i~2#1| Int) (v_ArrVal_181 (Array Int Int)) (v_ArrVal_179 (Array Int Int)) (~A~0.base Int)) (or (not (< |thread3Thread1of1ForFork1_~i~2#1| c_~N~0)) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) c_~N~0) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_179) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181))) (let ((.cse0 (select .cse3 ~A~0.base)) (.cse1 (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (= (+ (select .cse0 c_~A~0.offset) (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0) (let ((.cse2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset .cse2)) (select .cse1 (+ .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))))) is different from false [2022-11-21 16:45:04,325 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:45:04,326 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 117 treesize of output 82 [2022-11-21 16:45:04,405 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:45:04,406 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 73718 treesize of output 67646 [2022-11-21 16:45:04,653 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:45:04,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 67574 treesize of output 51250 [2022-11-21 16:45:05,087 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:45:05,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 51190 treesize of output 47154 [2022-11-21 16:45:05,395 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:45:05,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 47094 treesize of output 38962 [2022-11-21 16:45:24,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 16:45:24,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576225629] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:45:24,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:45:24,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 36, 26] total 82 [2022-11-21 16:45:24,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042935381] [2022-11-21 16:45:24,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:45:24,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-11-21 16:45:24,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:45:24,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-11-21 16:45:24,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=5144, Unknown=57, NotChecked=918, Total=6642 [2022-11-21 16:45:24,811 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 193 [2022-11-21 16:45:24,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 272 transitions, 1084 flow. Second operand has 82 states, 82 states have (on average 69.34146341463415) internal successors, (5686), 82 states have internal predecessors, (5686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:45:24,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:45:24,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 193 [2022-11-21 16:45:24,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:45:53,705 WARN L233 SmtUtils]: Spent 6.18s on a formula simplification. DAG size of input: 59 DAG size of output: 54 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:46:26,895 INFO L130 PetriNetUnfolder]: 9326/15612 cut-off events. [2022-11-21 16:46:26,895 INFO L131 PetriNetUnfolder]: For 18372/18384 co-relation queries the response was YES. [2022-11-21 16:46:26,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43170 conditions, 15612 events. 9326/15612 cut-off events. For 18372/18384 co-relation queries the response was YES. Maximal size of possible extension queue 820. Compared 117995 event pairs, 1252 based on Foata normal form. 7/13995 useless extension candidates. Maximal degree in co-relation 43138. Up to 6100 conditions per place. [2022-11-21 16:46:27,059 INFO L137 encePairwiseOnDemand]: 130/193 looper letters, 498 selfloop transitions, 371 changer transitions 18/946 dead transitions. [2022-11-21 16:46:27,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 946 transitions, 5496 flow [2022-11-21 16:46:27,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2022-11-21 16:46:27,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2022-11-21 16:46:27,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 8570 transitions. [2022-11-21 16:46:27,077 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3731440762833631 [2022-11-21 16:46:27,077 INFO L72 ComplementDD]: Start complementDD. Operand 119 states and 8570 transitions. [2022-11-21 16:46:27,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 8570 transitions. [2022-11-21 16:46:27,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:46:27,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 119 states and 8570 transitions. [2022-11-21 16:46:27,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 120 states, 119 states have (on average 72.01680672268908) internal successors, (8570), 119 states have internal predecessors, (8570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:46:27,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 120 states, 120 states have (on average 193.0) internal successors, (23160), 120 states have internal predecessors, (23160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:46:27,139 INFO L81 ComplementDD]: Finished complementDD. Result has 120 states, 120 states have (on average 193.0) internal successors, (23160), 120 states have internal predecessors, (23160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:46:27,140 INFO L175 Difference]: Start difference. First operand has 261 places, 272 transitions, 1084 flow. Second operand 119 states and 8570 transitions. [2022-11-21 16:46:27,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 946 transitions, 5496 flow [2022-11-21 16:46:27,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 946 transitions, 5472 flow, removed 8 selfloop flow, removed 6 redundant places. [2022-11-21 16:46:27,275 INFO L231 Difference]: Finished difference. Result has 408 places, 574 transitions, 3844 flow [2022-11-21 16:46:27,275 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=1066, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=119, PETRI_FLOW=3844, PETRI_PLACES=408, PETRI_TRANSITIONS=574} [2022-11-21 16:46:27,278 INFO L288 CegarLoopForPetriNet]: 173 programPoint places, 235 predicate places. [2022-11-21 16:46:27,278 INFO L495 AbstractCegarLoop]: Abstraction has has 408 places, 574 transitions, 3844 flow [2022-11-21 16:46:27,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 69.34146341463415) internal successors, (5686), 82 states have internal predecessors, (5686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:46:27,281 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:46:27,281 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] [2022-11-21 16:46:27,295 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4a4af3-ccf6-4956-8739-e80886bbe441/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 16:46:27,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4a4af3-ccf6-4956-8739-e80886bbe441/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-21 16:46:27,495 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-21 16:46:27,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:46:27,496 INFO L85 PathProgramCache]: Analyzing trace with hash 748116601, now seen corresponding path program 3 times [2022-11-21 16:46:27,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:46:27,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256151974] [2022-11-21 16:46:27,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:46:27,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:46:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:46:32,000 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:46:32,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:46:32,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256151974] [2022-11-21 16:46:32,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256151974] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:46:32,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807370335] [2022-11-21 16:46:32,001 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 16:46:32,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:46:32,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4a4af3-ccf6-4956-8739-e80886bbe441/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:46:32,003 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4a4af3-ccf6-4956-8739-e80886bbe441/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:46:32,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4a4af3-ccf6-4956-8739-e80886bbe441/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 16:46:32,165 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-21 16:46:32,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:46:32,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 98 conjunts are in the unsatisfiable core [2022-11-21 16:46:32,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:46:32,228 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-21 16:46:32,315 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 16:46:32,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-21 16:46:32,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:46:32,940 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 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-21 16:46:33,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:46:34,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:46:34,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:46:34,897 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:46:34,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2022-11-21 16:46:35,230 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 6 treesize of output 5 [2022-11-21 16:46:36,281 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-21 16:46:37,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:46:37,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:46:37,254 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 16:46:37,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 25 [2022-11-21 16:46:37,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:46:37,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:46:37,532 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 16:46:37,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 25 [2022-11-21 16:46:37,963 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:46:37,964 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 33 treesize of output 85 [2022-11-21 16:46:38,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 16:46:38,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:46:39,657 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_229 (Array Int Int)) (~M~0 Int) (v_ArrVal_230 (Array Int Int))) (or (< 0 ~M~0) (< ~M~0 0) (= (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230)) (.cse1 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset)) (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse1)))) (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset) c_~res1~0)))) is different from false [2022-11-21 16:46:39,691 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_229 (Array Int Int)) (v_ArrVal_228 (Array Int Int)) (~M~0 Int) (v_ArrVal_230 (Array Int Int))) (or (< 0 ~M~0) (< ~M~0 0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_228))) (= (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) (select (select .cse0 c_~B~0.base) c_~B~0.offset) c_~res1~0) (let ((.cse1 (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230)) (.cse2 (* ~M~0 4))) (+ (select (select .cse1 c_~A~0.base) (+ c_~A~0.offset .cse2)) c_~res2~0 (select (select .cse1 c_~B~0.base) (+ .cse2 c_~B~0.offset)))))))) is different from false [2022-11-21 16:46:45,950 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:46:45,950 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 117 treesize of output 82 [2022-11-21 16:46:46,212 INFO L321 Elim1Store]: treesize reduction 49, result has 32.9 percent of original size [2022-11-21 16:46:46,216 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 4751350 treesize of output 4358157 [2022-11-21 16:46:57,296 WARN L233 SmtUtils]: Spent 11.08s on a formula simplification that was a NOOP. DAG size: 1973 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 16:47:07,458 WARN L233 SmtUtils]: Spent 10.15s on a formula simplification that was a NOOP. DAG size: 1983 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 16:47:07,633 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:47:07,636 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 4349878 treesize of output 3956670 [2022-11-21 16:47:17,633 WARN L233 SmtUtils]: Spent 9.99s on a formula simplification that was a NOOP. DAG size: 1986 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 16:47:17,797 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:47:17,800 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 3956662 treesize of output 3170238 [2022-11-21 16:47:28,365 WARN L233 SmtUtils]: Spent 10.56s on a formula simplification that was a NOOP. DAG size: 1988 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 16:47:28,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:47:28,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:47:28,557 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:47:28,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 3170230 treesize of output 2677182 [2022-11-21 16:47:38,179 WARN L233 SmtUtils]: Spent 9.62s on a formula simplification that was a NOOP. DAG size: 1914 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 16:47:38,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:47:38,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:47:38,325 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:47:38,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 2677174 treesize of output 2438910 [2022-11-21 16:47:47,953 WARN L233 SmtUtils]: Spent 9.62s on a formula simplification that was a NOOP. DAG size: 1828 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 16:49:03,892 WARN L233 SmtUtils]: Spent 47.51s on a formula simplification. DAG size of input: 1795 DAG size of output: 1795 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 16:49:45,129 WARN L233 SmtUtils]: Spent 31.48s on a formula simplification. DAG size of input: 1793 DAG size of output: 1793 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 16:50:52,251 WARN L233 SmtUtils]: Spent 57.22s on a formula simplification. DAG size of input: 1791 DAG size of output: 1791 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 16:51:36,341 WARN L233 SmtUtils]: Spent 35.74s on a formula simplification. DAG size of input: 1791 DAG size of output: 1791 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 16:52:06,474 WARN L233 SmtUtils]: Spent 14.54s on a formula simplification that was a NOOP. DAG size: 1791 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 16:52:30,269 WARN L233 SmtUtils]: Spent 9.41s on a formula simplification that was a NOOP. DAG size: 1789 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 16:52:43,284 WARN L233 SmtUtils]: Spent 8.23s on a formula simplification. DAG size of input: 1475 DAG size of output: 1475 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 16:53:23,017 WARN L233 SmtUtils]: Spent 6.86s on a formula simplification. DAG size of input: 1160 DAG size of output: 1160 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 16:53:31,553 WARN L233 SmtUtils]: Spent 7.09s on a formula simplification. DAG size of input: 1160 DAG size of output: 1160 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 16:53:40,732 WARN L233 SmtUtils]: Spent 7.69s on a formula simplification. DAG size of input: 1160 DAG size of output: 1160 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 16:53:59,103 WARN L233 SmtUtils]: Spent 14.98s on a formula simplification. DAG size of input: 1160 DAG size of output: 1160 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 16:54:13,041 WARN L233 SmtUtils]: Spent 12.27s on a formula simplification. DAG size of input: 1160 DAG size of output: 1160 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 16:54:22,807 WARN L233 SmtUtils]: Spent 8.29s on a formula simplification. DAG size of input: 1160 DAG size of output: 1160 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 16:54:33,533 WARN L233 SmtUtils]: Spent 9.06s on a formula simplification. DAG size of input: 1160 DAG size of output: 1160 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 16:54:43,766 WARN L233 SmtUtils]: Spent 8.55s on a formula simplification. DAG size of input: 1160 DAG size of output: 1160 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 16:54:53,083 WARN L233 SmtUtils]: Spent 7.76s on a formula simplification. DAG size of input: 1160 DAG size of output: 1160 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 16:55:07,092 WARN L233 SmtUtils]: Spent 12.29s on a formula simplification. DAG size of input: 1160 DAG size of output: 1160 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 16:55:16,699 WARN L233 SmtUtils]: Spent 7.81s on a formula simplification. DAG size of input: 1160 DAG size of output: 1160 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 16:55:25,001 WARN L233 SmtUtils]: Spent 5.33s on a formula simplification. DAG size of input: 1160 DAG size of output: 1160 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 16:55:35,452 WARN L233 SmtUtils]: Spent 8.90s on a formula simplification. DAG size of input: 1160 DAG size of output: 1160 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 16:55:46,058 WARN L233 SmtUtils]: Spent 7.42s on a formula simplification. DAG size of input: 1160 DAG size of output: 1160 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 16:55:55,891 WARN L233 SmtUtils]: Spent 8.24s on a formula simplification. DAG size of input: 1160 DAG size of output: 1160 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 16:56:06,300 WARN L233 SmtUtils]: Spent 7.57s on a formula simplification. DAG size of input: 1160 DAG size of output: 1160 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 16:56:20,608 WARN L233 SmtUtils]: Spent 12.53s on a formula simplification. DAG size of input: 1160 DAG size of output: 1160 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 16:56:35,469 WARN L233 SmtUtils]: Spent 7.53s on a formula simplification. DAG size of input: 1160 DAG size of output: 1160 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 16:56:44,774 WARN L233 SmtUtils]: Spent 6.15s on a formula simplification. DAG size of input: 1160 DAG size of output: 1160 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 16:56:55,201 WARN L233 SmtUtils]: Spent 8.54s on a formula simplification. DAG size of input: 1160 DAG size of output: 1160 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 16:57:07,916 WARN L233 SmtUtils]: Spent 7.48s on a formula simplification. DAG size of input: 1160 DAG size of output: 1160 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 16:57:19,720 WARN L233 SmtUtils]: Spent 10.05s on a formula simplification. DAG size of input: 1160 DAG size of output: 1160 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)