./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF --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 c2150e0b957073117139b89f4d79d7a8523050efb20e53a1bf0b405c120dd6a7 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 06:05:41,292 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 06:05:41,295 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 06:05:41,356 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 06:05:41,359 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 06:05:41,364 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 06:05:41,366 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 06:05:41,370 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 06:05:41,372 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 06:05:41,378 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 06:05:41,379 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 06:05:41,381 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 06:05:41,381 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 06:05:41,384 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 06:05:41,386 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 06:05:41,389 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 06:05:41,391 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 06:05:41,393 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 06:05:41,397 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 06:05:41,405 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 06:05:41,406 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 06:05:41,411 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 06:05:41,414 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 06:05:41,415 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 06:05:41,425 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 06:05:41,425 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 06:05:41,426 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 06:05:41,428 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 06:05:41,429 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 06:05:41,431 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 06:05:41,431 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 06:05:41,432 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 06:05:41,434 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 06:05:41,436 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 06:05:41,437 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 06:05:41,438 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 06:05:41,439 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 06:05:41,439 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 06:05:41,439 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 06:05:41,440 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 06:05:41,441 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 06:05:41,442 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-20 06:05:41,479 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 06:05:41,480 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 06:05:41,481 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 06:05:41,481 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 06:05:41,488 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 06:05:41,489 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 06:05:41,489 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 06:05:41,490 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 06:05:41,490 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 06:05:41,490 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 06:05:41,491 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 06:05:41,492 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 06:05:41,492 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 06:05:41,492 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 06:05:41,493 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-20 06:05:41,493 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 06:05:41,493 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-20 06:05:41,493 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 06:05:41,494 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 06:05:41,494 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 06:05:41,494 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-20 06:05:41,494 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 06:05:41,495 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 06:05:41,495 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 06:05:41,495 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 06:05:41,495 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 06:05:41,496 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 06:05:41,496 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-20 06:05:41,496 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-20 06:05:41,498 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 06:05:41,498 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-20 06:05:41,498 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-20 06:05:41,499 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-20 06:05:41,499 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 06:05:41,499 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_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/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_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF 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 -> c2150e0b957073117139b89f4d79d7a8523050efb20e53a1bf0b405c120dd6a7 [2021-11-20 06:05:41,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 06:05:41,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 06:05:41,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 06:05:41,853 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 06:05:41,854 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 06:05:41,856 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2021-11-20 06:05:41,947 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/data/10b6997b3/d7f7ccc7e643476bbe2e2ef5d7239505/FLAG9d6bcc5c1 [2021-11-20 06:05:42,546 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 06:05:42,547 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2021-11-20 06:05:42,563 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/data/10b6997b3/d7f7ccc7e643476bbe2e2ef5d7239505/FLAG9d6bcc5c1 [2021-11-20 06:05:42,872 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/data/10b6997b3/d7f7ccc7e643476bbe2e2ef5d7239505 [2021-11-20 06:05:42,874 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 06:05:42,879 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 06:05:42,883 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 06:05:42,884 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 06:05:42,887 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 06:05:42,888 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:05:42" (1/1) ... [2021-11-20 06:05:42,891 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10a55701 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:05:42, skipping insertion in model container [2021-11-20 06:05:42,891 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:05:42" (1/1) ... [2021-11-20 06:05:42,898 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 06:05:42,921 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 06:05:43,168 WARN L230 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_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c[4174,4187] [2021-11-20 06:05:43,179 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 06:05:43,187 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 06:05:43,227 WARN L230 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_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c[4174,4187] [2021-11-20 06:05:43,246 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 06:05:43,263 INFO L208 MainTranslator]: Completed translation [2021-11-20 06:05:43,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:05:43 WrapperNode [2021-11-20 06:05:43,264 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 06:05:43,265 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 06:05:43,265 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 06:05:43,266 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 06:05:43,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:05:43" (1/1) ... [2021-11-20 06:05:43,283 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:05:43" (1/1) ... [2021-11-20 06:05:43,322 INFO L137 Inliner]: procedures = 26, calls = 75, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 315 [2021-11-20 06:05:43,322 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 06:05:43,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 06:05:43,323 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 06:05:43,323 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 06:05:43,332 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:05:43" (1/1) ... [2021-11-20 06:05:43,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:05:43" (1/1) ... [2021-11-20 06:05:43,337 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:05:43" (1/1) ... [2021-11-20 06:05:43,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:05:43" (1/1) ... [2021-11-20 06:05:43,365 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:05:43" (1/1) ... [2021-11-20 06:05:43,371 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:05:43" (1/1) ... [2021-11-20 06:05:43,374 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:05:43" (1/1) ... [2021-11-20 06:05:43,378 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 06:05:43,379 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 06:05:43,380 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 06:05:43,380 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 06:05:43,384 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:05:43" (1/1) ... [2021-11-20 06:05:43,392 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 06:05:43,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:05:43,435 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 06:05:43,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 06:05:43,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 06:05:43,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-20 06:05:43,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-20 06:05:43,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-20 06:05:43,479 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-11-20 06:05:43,479 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-11-20 06:05:43,479 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-11-20 06:05:43,479 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-11-20 06:05:43,479 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-11-20 06:05:43,480 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-11-20 06:05:43,480 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-11-20 06:05:43,481 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-11-20 06:05:43,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-20 06:05:43,481 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-11-20 06:05:43,481 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-11-20 06:05:43,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-20 06:05:43,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 06:05:43,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 06:05:43,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-20 06:05:43,484 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-20 06:05:43,604 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 06:05:43,606 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 06:05:44,195 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 06:05:44,419 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 06:05:44,420 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-11-20 06:05:44,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:05:44 BoogieIcfgContainer [2021-11-20 06:05:44,424 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 06:05:44,428 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 06:05:44,428 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 06:05:44,431 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 06:05:44,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:05:42" (1/3) ... [2021-11-20 06:05:44,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:05:44, skipping insertion in model container [2021-11-20 06:05:44,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:05:43" (2/3) ... [2021-11-20 06:05:44,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:05:44, skipping insertion in model container [2021-11-20 06:05:44,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:05:44" (3/3) ... [2021-11-20 06:05:44,436 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt2.wvr.c [2021-11-20 06:05:44,444 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-20 06:05:44,444 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 06:05:44,444 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-20 06:05:44,445 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-20 06:05:44,512 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,513 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,513 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,513 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,514 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,514 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,514 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,514 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,515 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,515 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,515 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,515 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,515 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,516 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,517 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,517 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,517 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,518 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,519 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,519 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,519 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,519 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,520 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,520 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,521 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,521 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,523 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,523 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,523 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,524 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,524 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,524 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,524 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,525 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,525 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,526 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,526 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,526 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,526 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,526 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,527 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,527 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,527 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,528 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,528 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,529 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,529 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,529 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,529 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,530 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,532 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,532 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,532 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,533 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,534 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,534 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,534 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,535 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,535 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,535 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,535 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,535 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,536 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,536 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,536 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,537 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,537 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,537 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,537 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,537 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,538 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,538 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,539 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,539 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,540 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,541 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,546 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,546 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,546 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,546 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,546 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,546 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,547 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,547 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,548 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,548 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,548 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,548 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,549 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,549 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,549 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,549 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,549 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,550 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,550 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,550 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,550 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,550 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,550 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,551 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,551 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,551 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,551 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,551 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,552 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,552 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,552 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,552 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,552 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,553 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,553 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,553 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,553 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,553 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,554 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,554 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,557 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,557 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,557 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,558 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,558 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,558 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,558 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,558 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,559 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,559 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,560 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,560 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,560 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,560 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,560 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,561 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,561 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,561 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,561 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,561 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,562 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,562 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,562 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,563 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,563 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,563 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,563 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,563 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,564 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,564 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,564 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,565 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,565 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,565 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,565 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,566 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,566 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,566 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,566 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,566 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,566 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,567 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,567 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,567 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 06:05:44,570 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-11-20 06:05:44,636 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 06:05:44,646 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-20 06:05:44,647 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-20 06:05:44,669 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 239 places, 245 transitions, 522 flow [2021-11-20 06:05:44,786 INFO L129 PetriNetUnfolder]: 19/241 cut-off events. [2021-11-20 06:05:44,786 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-11-20 06:05:44,792 INFO L84 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 241 events. 19/241 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 115 event pairs, 0 based on Foata normal form. 0/221 useless extension candidates. Maximal degree in co-relation 202. Up to 2 conditions per place. [2021-11-20 06:05:44,792 INFO L82 GeneralOperation]: Start removeDead. Operand has 239 places, 245 transitions, 522 flow [2021-11-20 06:05:44,801 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 222 places, 228 transitions, 480 flow [2021-11-20 06:05:44,910 INFO L129 PetriNetUnfolder]: 19/227 cut-off events. [2021-11-20 06:05:44,911 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-11-20 06:05:44,911 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 06:05:44,912 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:05:44,913 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-20 06:05:44,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:05:44,920 INFO L85 PathProgramCache]: Analyzing trace with hash -289331101, now seen corresponding path program 1 times [2021-11-20 06:05:44,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:05:44,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752975465] [2021-11-20 06:05:44,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:05:44,931 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:05:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:05:45,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:05:45,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:05:45,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752975465] [2021-11-20 06:05:45,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752975465] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:05:45,262 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:05:45,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-20 06:05:45,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335129807] [2021-11-20 06:05:45,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:05:45,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-20 06:05:45,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:05:45,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-20 06:05:45,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-20 06:05:45,305 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 245 [2021-11-20 06:05:45,310 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 228 transitions, 480 flow. Second operand has 2 states, 2 states have (on average 224.0) internal successors, (448), 2 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:05:45,310 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 06:05:45,310 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 245 [2021-11-20 06:05:45,312 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 06:05:45,478 INFO L129 PetriNetUnfolder]: 123/530 cut-off events. [2021-11-20 06:05:45,478 INFO L130 PetriNetUnfolder]: For 106/107 co-relation queries the response was YES. [2021-11-20 06:05:45,483 INFO L84 FinitePrefix]: Finished finitePrefix Result has 758 conditions, 530 events. 123/530 cut-off events. For 106/107 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1703 event pairs, 51 based on Foata normal form. 126/595 useless extension candidates. Maximal degree in co-relation 504. Up to 163 conditions per place. [2021-11-20 06:05:45,489 INFO L132 encePairwiseOnDemand]: 232/245 looper letters, 12 selfloop transitions, 0 changer transitions 7/215 dead transitions. [2021-11-20 06:05:45,489 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 215 transitions, 478 flow [2021-11-20 06:05:45,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-20 06:05:45,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2021-11-20 06:05:45,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 463 transitions. [2021-11-20 06:05:45,512 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9448979591836735 [2021-11-20 06:05:45,513 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 463 transitions. [2021-11-20 06:05:45,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 463 transitions. [2021-11-20 06:05:45,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:05:45,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 463 transitions. [2021-11-20 06:05:45,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 231.5) internal successors, (463), 2 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:05:45,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:05:45,544 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:05:45,546 INFO L186 Difference]: Start difference. First operand has 222 places, 228 transitions, 480 flow. Second operand 2 states and 463 transitions. [2021-11-20 06:05:45,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 215 transitions, 478 flow [2021-11-20 06:05:45,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 215 transitions, 462 flow, removed 0 selfloop flow, removed 8 redundant places. [2021-11-20 06:05:45,560 INFO L242 Difference]: Finished difference. Result has 215 places, 208 transitions, 424 flow [2021-11-20 06:05:45,563 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=424, PETRI_PLACES=215, PETRI_TRANSITIONS=208} [2021-11-20 06:05:45,567 INFO L334 CegarLoopForPetriNet]: 222 programPoint places, -7 predicate places. [2021-11-20 06:05:45,568 INFO L470 AbstractCegarLoop]: Abstraction has has 215 places, 208 transitions, 424 flow [2021-11-20 06:05:45,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 224.0) internal successors, (448), 2 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:05:45,568 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 06:05:45,569 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:05:45,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-20 06:05:45,569 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-20 06:05:45,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:05:45,570 INFO L85 PathProgramCache]: Analyzing trace with hash 187163891, now seen corresponding path program 1 times [2021-11-20 06:05:45,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:05:45,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869553664] [2021-11-20 06:05:45,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:05:45,571 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:05:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:05:46,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:05:46,080 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:05:46,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869553664] [2021-11-20 06:05:46,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869553664] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:05:46,081 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:05:46,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 06:05:46,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499594656] [2021-11-20 06:05:46,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:05:46,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 06:05:46,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:05:46,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 06:05:46,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-20 06:05:46,091 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 245 [2021-11-20 06:05:46,094 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 208 transitions, 424 flow. Second operand has 7 states, 7 states have (on average 181.0) internal successors, (1267), 7 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:05:46,094 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 06:05:46,094 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 245 [2021-11-20 06:05:46,095 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 06:05:46,584 INFO L129 PetriNetUnfolder]: 445/956 cut-off events. [2021-11-20 06:05:46,585 INFO L130 PetriNetUnfolder]: For 75/75 co-relation queries the response was YES. [2021-11-20 06:05:46,589 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1657 conditions, 956 events. 445/956 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3964 event pairs, 67 based on Foata normal form. 0/853 useless extension candidates. Maximal degree in co-relation 1654. Up to 375 conditions per place. [2021-11-20 06:05:46,598 INFO L132 encePairwiseOnDemand]: 238/245 looper letters, 61 selfloop transitions, 7 changer transitions 0/227 dead transitions. [2021-11-20 06:05:46,598 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 227 transitions, 606 flow [2021-11-20 06:05:46,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 06:05:46,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-11-20 06:05:46,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1294 transitions. [2021-11-20 06:05:46,604 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7545189504373178 [2021-11-20 06:05:46,604 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1294 transitions. [2021-11-20 06:05:46,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1294 transitions. [2021-11-20 06:05:46,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:05:46,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1294 transitions. [2021-11-20 06:05:46,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 184.85714285714286) internal successors, (1294), 7 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:05:46,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:05:46,619 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:05:46,620 INFO L186 Difference]: Start difference. First operand has 215 places, 208 transitions, 424 flow. Second operand 7 states and 1294 transitions. [2021-11-20 06:05:46,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 227 transitions, 606 flow [2021-11-20 06:05:46,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 227 transitions, 606 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-11-20 06:05:46,628 INFO L242 Difference]: Finished difference. Result has 216 places, 211 transitions, 455 flow [2021-11-20 06:05:46,629 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=455, PETRI_PLACES=216, PETRI_TRANSITIONS=211} [2021-11-20 06:05:46,630 INFO L334 CegarLoopForPetriNet]: 222 programPoint places, -6 predicate places. [2021-11-20 06:05:46,630 INFO L470 AbstractCegarLoop]: Abstraction has has 216 places, 211 transitions, 455 flow [2021-11-20 06:05:46,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 181.0) internal successors, (1267), 7 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:05:46,632 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 06:05:46,632 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:05:46,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-20 06:05:46,633 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-20 06:05:46,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:05:46,633 INFO L85 PathProgramCache]: Analyzing trace with hash -49829482, now seen corresponding path program 1 times [2021-11-20 06:05:46,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:05:46,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061231758] [2021-11-20 06:05:46,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:05:46,635 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:05:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:05:46,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:05:46,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:05:46,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061231758] [2021-11-20 06:05:46,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061231758] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:05:46,996 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:05:46,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 06:05:46,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740893348] [2021-11-20 06:05:46,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:05:46,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 06:05:46,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:05:46,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 06:05:46,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-11-20 06:05:47,002 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 245 [2021-11-20 06:05:47,005 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 211 transitions, 455 flow. Second operand has 7 states, 7 states have (on average 182.14285714285714) internal successors, (1275), 7 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:05:47,005 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 06:05:47,005 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 245 [2021-11-20 06:05:47,005 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 06:05:47,543 INFO L129 PetriNetUnfolder]: 554/1385 cut-off events. [2021-11-20 06:05:47,543 INFO L130 PetriNetUnfolder]: For 306/307 co-relation queries the response was YES. [2021-11-20 06:05:47,550 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2433 conditions, 1385 events. 554/1385 cut-off events. For 306/307 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7523 event pairs, 135 based on Foata normal form. 13/1286 useless extension candidates. Maximal degree in co-relation 2427. Up to 346 conditions per place. [2021-11-20 06:05:47,563 INFO L132 encePairwiseOnDemand]: 237/245 looper letters, 73 selfloop transitions, 12 changer transitions 0/245 dead transitions. [2021-11-20 06:05:47,563 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 245 transitions, 714 flow [2021-11-20 06:05:47,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 06:05:47,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-11-20 06:05:47,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1492 transitions. [2021-11-20 06:05:47,569 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7612244897959184 [2021-11-20 06:05:47,569 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1492 transitions. [2021-11-20 06:05:47,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1492 transitions. [2021-11-20 06:05:47,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:05:47,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1492 transitions. [2021-11-20 06:05:47,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 186.5) internal successors, (1492), 8 states have internal predecessors, (1492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:05:47,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 245.0) internal successors, (2205), 9 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:05:47,584 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 245.0) internal successors, (2205), 9 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:05:47,585 INFO L186 Difference]: Start difference. First operand has 216 places, 211 transitions, 455 flow. Second operand 8 states and 1492 transitions. [2021-11-20 06:05:47,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 245 transitions, 714 flow [2021-11-20 06:05:47,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 245 transitions, 708 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-11-20 06:05:47,594 INFO L242 Difference]: Finished difference. Result has 224 places, 217 transitions, 520 flow [2021-11-20 06:05:47,595 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=520, PETRI_PLACES=224, PETRI_TRANSITIONS=217} [2021-11-20 06:05:47,598 INFO L334 CegarLoopForPetriNet]: 222 programPoint places, 2 predicate places. [2021-11-20 06:05:47,598 INFO L470 AbstractCegarLoop]: Abstraction has has 224 places, 217 transitions, 520 flow [2021-11-20 06:05:47,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 182.14285714285714) internal successors, (1275), 7 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:05:47,600 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 06:05:47,600 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:05:47,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-20 06:05:47,602 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-20 06:05:47,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:05:47,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1566639152, now seen corresponding path program 2 times [2021-11-20 06:05:47,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:05:47,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750767758] [2021-11-20 06:05:47,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:05:47,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:05:47,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:05:47,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:05:47,944 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:05:47,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750767758] [2021-11-20 06:05:47,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750767758] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:05:47,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83616421] [2021-11-20 06:05:47,945 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:05:47,946 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:05:47,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:05:47,948 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:05:47,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-20 06:05:48,109 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-20 06:05:48,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:05:48,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-20 06:05:48,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:05:49,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 06:05:49,031 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 06:05:49,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83616421] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:05:49,032 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 06:05:49,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2021-11-20 06:05:49,033 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727989973] [2021-11-20 06:05:49,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:05:49,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 06:05:49,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:05:49,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 06:05:49,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-11-20 06:05:49,038 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 245 [2021-11-20 06:05:49,041 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 217 transitions, 520 flow. Second operand has 7 states, 7 states have (on average 177.85714285714286) internal successors, (1245), 7 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:05:49,041 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 06:05:49,041 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 245 [2021-11-20 06:05:49,042 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 06:05:49,728 INFO L129 PetriNetUnfolder]: 954/2024 cut-off events. [2021-11-20 06:05:49,728 INFO L130 PetriNetUnfolder]: For 1337/1339 co-relation queries the response was YES. [2021-11-20 06:05:49,739 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4395 conditions, 2024 events. 954/2024 cut-off events. For 1337/1339 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11736 event pairs, 187 based on Foata normal form. 36/1921 useless extension candidates. Maximal degree in co-relation 4384. Up to 921 conditions per place. [2021-11-20 06:05:49,763 INFO L132 encePairwiseOnDemand]: 236/245 looper letters, 79 selfloop transitions, 9 changer transitions 0/243 dead transitions. [2021-11-20 06:05:49,763 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 243 transitions, 783 flow [2021-11-20 06:05:49,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 06:05:49,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-11-20 06:05:49,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1450 transitions. [2021-11-20 06:05:49,769 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7397959183673469 [2021-11-20 06:05:49,769 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1450 transitions. [2021-11-20 06:05:49,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1450 transitions. [2021-11-20 06:05:49,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:05:49,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1450 transitions. [2021-11-20 06:05:49,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 181.25) internal successors, (1450), 8 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:05:49,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 245.0) internal successors, (2205), 9 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:05:49,784 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 245.0) internal successors, (2205), 9 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:05:49,784 INFO L186 Difference]: Start difference. First operand has 224 places, 217 transitions, 520 flow. Second operand 8 states and 1450 transitions. [2021-11-20 06:05:49,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 243 transitions, 783 flow [2021-11-20 06:05:49,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 243 transitions, 771 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-11-20 06:05:49,800 INFO L242 Difference]: Finished difference. Result has 229 places, 219 transitions, 551 flow [2021-11-20 06:05:49,801 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=551, PETRI_PLACES=229, PETRI_TRANSITIONS=219} [2021-11-20 06:05:49,802 INFO L334 CegarLoopForPetriNet]: 222 programPoint places, 7 predicate places. [2021-11-20 06:05:49,803 INFO L470 AbstractCegarLoop]: Abstraction has has 229 places, 219 transitions, 551 flow [2021-11-20 06:05:49,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 177.85714285714286) internal successors, (1245), 7 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:05:49,804 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 06:05:49,804 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:05:49,844 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-20 06:05:50,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:05:50,030 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-20 06:05:50,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:05:50,030 INFO L85 PathProgramCache]: Analyzing trace with hash -2046175939, now seen corresponding path program 1 times [2021-11-20 06:05:50,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:05:50,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547823609] [2021-11-20 06:05:50,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:05:50,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:05:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:05:50,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 06:05:50,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:05:50,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547823609] [2021-11-20 06:05:50,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547823609] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:05:50,136 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:05:50,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 06:05:50,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038995237] [2021-11-20 06:05:50,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:05:50,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 06:05:50,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:05:50,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 06:05:50,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-20 06:05:50,141 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 245 [2021-11-20 06:05:50,143 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 219 transitions, 551 flow. Second operand has 6 states, 6 states have (on average 197.66666666666666) internal successors, (1186), 6 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:05:50,143 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 06:05:50,143 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 245 [2021-11-20 06:05:50,143 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 06:05:50,524 INFO L129 PetriNetUnfolder]: 336/1234 cut-off events. [2021-11-20 06:05:50,525 INFO L130 PetriNetUnfolder]: For 1087/1127 co-relation queries the response was YES. [2021-11-20 06:05:50,533 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2360 conditions, 1234 events. 336/1234 cut-off events. For 1087/1127 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 6606 event pairs, 148 based on Foata normal form. 49/1179 useless extension candidates. Maximal degree in co-relation 2348. Up to 423 conditions per place. [2021-11-20 06:05:50,543 INFO L132 encePairwiseOnDemand]: 235/245 looper letters, 40 selfloop transitions, 8 changer transitions 21/244 dead transitions. [2021-11-20 06:05:50,544 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 244 transitions, 745 flow [2021-11-20 06:05:50,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 06:05:50,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-11-20 06:05:50,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1801 transitions. [2021-11-20 06:05:50,550 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.816780045351474 [2021-11-20 06:05:50,551 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1801 transitions. [2021-11-20 06:05:50,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1801 transitions. [2021-11-20 06:05:50,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:05:50,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1801 transitions. [2021-11-20 06:05:50,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 200.11111111111111) internal successors, (1801), 9 states have internal predecessors, (1801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:05:50,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 245.0) internal successors, (2450), 10 states have internal predecessors, (2450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:05:50,566 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 245.0) internal successors, (2450), 10 states have internal predecessors, (2450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:05:50,566 INFO L186 Difference]: Start difference. First operand has 229 places, 219 transitions, 551 flow. Second operand 9 states and 1801 transitions. [2021-11-20 06:05:50,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 244 transitions, 745 flow [2021-11-20 06:05:50,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 244 transitions, 730 flow, removed 0 selfloop flow, removed 6 redundant places. [2021-11-20 06:05:50,575 INFO L242 Difference]: Finished difference. Result has 233 places, 220 transitions, 566 flow [2021-11-20 06:05:50,576 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=566, PETRI_PLACES=233, PETRI_TRANSITIONS=220} [2021-11-20 06:05:50,577 INFO L334 CegarLoopForPetriNet]: 222 programPoint places, 11 predicate places. [2021-11-20 06:05:50,577 INFO L470 AbstractCegarLoop]: Abstraction has has 233 places, 220 transitions, 566 flow [2021-11-20 06:05:50,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 197.66666666666666) internal successors, (1186), 6 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:05:50,578 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 06:05:50,579 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:05:50,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-20 06:05:50,579 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-20 06:05:50,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:05:50,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1616853250, now seen corresponding path program 1 times [2021-11-20 06:05:50,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:05:50,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139197018] [2021-11-20 06:05:50,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:05:50,581 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:05:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:05:51,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:05:51,455 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:05:51,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139197018] [2021-11-20 06:05:51,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139197018] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:05:51,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339114058] [2021-11-20 06:05:51,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:05:51,456 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:05:51,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:05:51,457 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:05:51,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-20 06:05:51,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:05:51,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-20 06:05:51,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:05:52,787 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2021-11-20 06:05:52,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 06:05:52,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:05:53,240 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 06:05:53,240 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2021-11-20 06:05:54,134 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 06:05:54,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339114058] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:05:54,138 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:05:54,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 10, 10] total 30 [2021-11-20 06:05:54,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88774742] [2021-11-20 06:05:54,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:05:54,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-20 06:05:54,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:05:54,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-20 06:05:54,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=764, Unknown=0, NotChecked=0, Total=870 [2021-11-20 06:05:54,150 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 245 [2021-11-20 06:05:54,155 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 220 transitions, 566 flow. Second operand has 30 states, 30 states have (on average 120.1) internal successors, (3603), 30 states have internal predecessors, (3603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:05:54,156 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 06:05:54,156 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 245 [2021-11-20 06:05:54,156 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 06:05:59,567 INFO L129 PetriNetUnfolder]: 7945/14513 cut-off events. [2021-11-20 06:05:59,568 INFO L130 PetriNetUnfolder]: For 13565/13565 co-relation queries the response was YES. [2021-11-20 06:05:59,662 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33984 conditions, 14513 events. 7945/14513 cut-off events. For 13565/13565 co-relation queries the response was YES. Maximal size of possible extension queue 675. Compared 112764 event pairs, 798 based on Foata normal form. 3/13691 useless extension candidates. Maximal degree in co-relation 33970. Up to 4240 conditions per place. [2021-11-20 06:05:59,793 INFO L132 encePairwiseOnDemand]: 213/245 looper letters, 282 selfloop transitions, 77 changer transitions 20/476 dead transitions. [2021-11-20 06:05:59,793 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 476 transitions, 2135 flow [2021-11-20 06:05:59,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-20 06:05:59,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2021-11-20 06:05:59,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 4646 transitions. [2021-11-20 06:05:59,818 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4990332975295381 [2021-11-20 06:05:59,819 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 4646 transitions. [2021-11-20 06:05:59,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 4646 transitions. [2021-11-20 06:05:59,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:05:59,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 4646 transitions. [2021-11-20 06:05:59,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 122.26315789473684) internal successors, (4646), 38 states have internal predecessors, (4646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:05:59,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 245.0) internal successors, (9555), 39 states have internal predecessors, (9555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:05:59,873 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 245.0) internal successors, (9555), 39 states have internal predecessors, (9555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:05:59,873 INFO L186 Difference]: Start difference. First operand has 233 places, 220 transitions, 566 flow. Second operand 38 states and 4646 transitions. [2021-11-20 06:05:59,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 476 transitions, 2135 flow [2021-11-20 06:05:59,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 476 transitions, 2099 flow, removed 8 selfloop flow, removed 6 redundant places. [2021-11-20 06:05:59,986 INFO L242 Difference]: Finished difference. Result has 280 places, 286 transitions, 1118 flow [2021-11-20 06:05:59,986 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=1118, PETRI_PLACES=280, PETRI_TRANSITIONS=286} [2021-11-20 06:05:59,990 INFO L334 CegarLoopForPetriNet]: 222 programPoint places, 58 predicate places. [2021-11-20 06:05:59,990 INFO L470 AbstractCegarLoop]: Abstraction has has 280 places, 286 transitions, 1118 flow [2021-11-20 06:05:59,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 120.1) internal successors, (3603), 30 states have internal predecessors, (3603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:05:59,993 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 06:05:59,993 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:06:00,032 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-20 06:06:00,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-11-20 06:06:00,223 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-20 06:06:00,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:00,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1577833310, now seen corresponding path program 2 times [2021-11-20 06:06:00,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:06:00,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658473839] [2021-11-20 06:06:00,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:00,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:06:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:06:02,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:06:02,070 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:06:02,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658473839] [2021-11-20 06:06:02,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658473839] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:06:02,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748421617] [2021-11-20 06:06:02,071 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:06:02,071 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:06:02,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:06:02,073 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:06:02,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-20 06:06:02,237 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 06:06:02,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:06:02,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 64 conjunts are in the unsatisfiable core [2021-11-20 06:06:02,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:06:02,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-20 06:06:02,385 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 06:06:02,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 [2021-11-20 06:06:02,450 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-20 06:06:02,450 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 17 treesize of output 22 [2021-11-20 06:06:02,545 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-20 06:06:02,545 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 22 treesize of output 30 [2021-11-20 06:06:03,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:06:03,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:06:03,973 INFO L354 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2021-11-20 06:06:03,974 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 26 treesize of output 24 [2021-11-20 06:06:04,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 11 [2021-11-20 06:06:06,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2021-11-20 06:06:06,582 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-11-20 06:06:06,583 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2021-11-20 06:06:06,838 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-11-20 06:06:06,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-11-20 06:06:07,138 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-11-20 06:06:07,139 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2021-11-20 06:06:07,743 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2021-11-20 06:06:08,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:06:08,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:06:31,452 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32077 treesize of output 31813 [2021-11-20 06:06:33,232 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-20 06:06:33,232 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-20 06:06:33,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2021-11-20 06:06:33,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353761959] [2021-11-20 06:06:33,233 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-20 06:06:33,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-20 06:06:33,239 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:06:33,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-20 06:06:33,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=4185, Unknown=8, NotChecked=0, Total=4556 [2021-11-20 06:06:33,256 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 245 [2021-11-20 06:06:33,259 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 286 transitions, 1118 flow. Second operand has 25 states, 25 states have (on average 106.28) internal successors, (2657), 25 states have internal predecessors, (2657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:06:33,260 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 06:06:33,260 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 245 [2021-11-20 06:06:33,260 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 06:06:40,404 INFO L129 PetriNetUnfolder]: 11217/20692 cut-off events. [2021-11-20 06:06:40,405 INFO L130 PetriNetUnfolder]: For 40663/40798 co-relation queries the response was YES. [2021-11-20 06:06:40,587 INFO L84 FinitePrefix]: Finished finitePrefix Result has 56800 conditions, 20692 events. 11217/20692 cut-off events. For 40663/40798 co-relation queries the response was YES. Maximal size of possible extension queue 896. Compared 172970 event pairs, 1872 based on Foata normal form. 48/19591 useless extension candidates. Maximal degree in co-relation 56769. Up to 7752 conditions per place. [2021-11-20 06:06:40,883 INFO L132 encePairwiseOnDemand]: 215/245 looper letters, 249 selfloop transitions, 59 changer transitions 8/408 dead transitions. [2021-11-20 06:06:40,883 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 408 transitions, 2244 flow [2021-11-20 06:06:40,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-20 06:06:40,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2021-11-20 06:06:40,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 3405 transitions. [2021-11-20 06:06:40,900 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.44832126398946676 [2021-11-20 06:06:40,900 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 3405 transitions. [2021-11-20 06:06:40,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 3405 transitions. [2021-11-20 06:06:40,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:06:40,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 3405 transitions. [2021-11-20 06:06:40,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 109.83870967741936) internal successors, (3405), 31 states have internal predecessors, (3405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:06:40,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 245.0) internal successors, (7840), 32 states have internal predecessors, (7840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:06:40,953 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 245.0) internal successors, (7840), 32 states have internal predecessors, (7840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:06:40,953 INFO L186 Difference]: Start difference. First operand has 280 places, 286 transitions, 1118 flow. Second operand 31 states and 3405 transitions. [2021-11-20 06:06:40,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 408 transitions, 2244 flow [2021-11-20 06:06:41,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 408 transitions, 2186 flow, removed 22 selfloop flow, removed 10 redundant places. [2021-11-20 06:06:41,122 INFO L242 Difference]: Finished difference. Result has 299 places, 299 transitions, 1321 flow [2021-11-20 06:06:41,123 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=1070, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=1321, PETRI_PLACES=299, PETRI_TRANSITIONS=299} [2021-11-20 06:06:41,124 INFO L334 CegarLoopForPetriNet]: 222 programPoint places, 77 predicate places. [2021-11-20 06:06:41,124 INFO L470 AbstractCegarLoop]: Abstraction has has 299 places, 299 transitions, 1321 flow [2021-11-20 06:06:41,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 106.28) internal successors, (2657), 25 states have internal predecessors, (2657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:06:41,125 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 06:06:41,126 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:06:41,167 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-20 06:06:41,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:06:41,342 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-20 06:06:41,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:41,343 INFO L85 PathProgramCache]: Analyzing trace with hash 941764405, now seen corresponding path program 3 times [2021-11-20 06:06:41,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:06:41,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375765541] [2021-11-20 06:06:41,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:41,343 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:06:41,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:06:41,524 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 06:06:41,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:06:41,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375765541] [2021-11-20 06:06:41,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375765541] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:06:41,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469393873] [2021-11-20 06:06:41,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 06:06:41,526 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:06:41,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:06:41,527 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:06:41,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-20 06:06:41,681 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-20 06:06:41,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:06:41,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-20 06:06:41,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:06:42,227 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 06:06:42,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:06:42,776 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 06:06:42,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469393873] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:06:42,777 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:06:42,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2021-11-20 06:06:42,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434440219] [2021-11-20 06:06:42,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:06:42,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-20 06:06:42,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:06:42,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-20 06:06:42,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2021-11-20 06:06:42,786 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 245 [2021-11-20 06:06:42,790 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 299 transitions, 1321 flow. Second operand has 19 states, 19 states have (on average 187.57894736842104) internal successors, (3564), 19 states have internal predecessors, (3564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:06:42,791 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 06:06:42,791 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 245 [2021-11-20 06:06:42,791 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 06:06:44,067 INFO L129 PetriNetUnfolder]: 1664/4585 cut-off events. [2021-11-20 06:06:44,067 INFO L130 PetriNetUnfolder]: For 10196/10330 co-relation queries the response was YES. [2021-11-20 06:06:44,111 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11777 conditions, 4585 events. 1664/4585 cut-off events. For 10196/10330 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 37145 event pairs, 498 based on Foata normal form. 117/4244 useless extension candidates. Maximal degree in co-relation 11746. Up to 1434 conditions per place. [2021-11-20 06:06:44,151 INFO L132 encePairwiseOnDemand]: 227/245 looper letters, 120 selfloop transitions, 30 changer transitions 0/335 dead transitions. [2021-11-20 06:06:44,152 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 335 transitions, 1738 flow [2021-11-20 06:06:44,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-20 06:06:44,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-11-20 06:06:44,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3404 transitions. [2021-11-20 06:06:44,157 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7718820861678004 [2021-11-20 06:06:44,157 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3404 transitions. [2021-11-20 06:06:44,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3404 transitions. [2021-11-20 06:06:44,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:06:44,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3404 transitions. [2021-11-20 06:06:44,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 189.11111111111111) internal successors, (3404), 18 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:06:44,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 245.0) internal successors, (4655), 19 states have internal predecessors, (4655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:06:44,176 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 245.0) internal successors, (4655), 19 states have internal predecessors, (4655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:06:44,176 INFO L186 Difference]: Start difference. First operand has 299 places, 299 transitions, 1321 flow. Second operand 18 states and 3404 transitions. [2021-11-20 06:06:44,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 335 transitions, 1738 flow [2021-11-20 06:06:44,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 335 transitions, 1663 flow, removed 2 selfloop flow, removed 27 redundant places. [2021-11-20 06:06:44,211 INFO L242 Difference]: Finished difference. Result has 290 places, 297 transitions, 1297 flow [2021-11-20 06:06:44,212 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=1168, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1297, PETRI_PLACES=290, PETRI_TRANSITIONS=297} [2021-11-20 06:06:44,212 INFO L334 CegarLoopForPetriNet]: 222 programPoint places, 68 predicate places. [2021-11-20 06:06:44,213 INFO L470 AbstractCegarLoop]: Abstraction has has 290 places, 297 transitions, 1297 flow [2021-11-20 06:06:44,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 187.57894736842104) internal successors, (3564), 19 states have internal predecessors, (3564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:06:44,214 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 06:06:44,214 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:06:44,252 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-20 06:06:44,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-11-20 06:06:44,430 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-20 06:06:44,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:44,430 INFO L85 PathProgramCache]: Analyzing trace with hash -2107007481, now seen corresponding path program 1 times [2021-11-20 06:06:44,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:06:44,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426885569] [2021-11-20 06:06:44,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:44,431 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:06:44,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:06:44,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 06:06:44,539 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:06:44,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426885569] [2021-11-20 06:06:44,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426885569] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:06:44,540 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:06:44,540 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 06:06:44,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053059449] [2021-11-20 06:06:44,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:06:44,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 06:06:44,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:06:44,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 06:06:44,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-20 06:06:44,545 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 245 [2021-11-20 06:06:44,547 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 297 transitions, 1297 flow. Second operand has 6 states, 6 states have (on average 198.5) internal successors, (1191), 6 states have internal predecessors, (1191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:06:44,547 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 06:06:44,547 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 245 [2021-11-20 06:06:44,548 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 06:06:45,562 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([871] L88-->L92: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1|))) (and (= .cse0 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_1| |v_thread3Thread1of1ForFork1_plus_~a#1_1|) (= v_~total~0_61 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~total~0_62 |v_thread3Thread1of1ForFork1_plus_#in~a#1_1|) (not (= (ite (and (<= 0 v_~q1_front~0_43) (< v_~q1_front~0_43 v_~q1_back~0_51) (< v_~q1_front~0_43 v_~n1~0_18)) 1 0) 0)) (= (select (select |v_#memory_int_67| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* v_~q1_front~0_43 4))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_1|) (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_~b#1_1| 0) (<= .cse0 2147483647)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1| 2147483648)) (<= 0 |v_thread3Thread1of1ForFork1_plus_~b#1_1|)) 1 0))) (<= 0 (+ v_~total~0_61 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1|) (<= v_~total~0_61 2147483647) (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~q1_front~0_43 1) v_~q1_front~0_42))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_43, ~q1_back~0=v_~q1_back~0_51, ~n1~0=v_~n1~0_18, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_67|, ~total~0=v_~total~0_62} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_42, ~n1~0=v_~n1~0_18, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, ~total~0=v_~total~0_61, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_51, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_23, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, #memory_int=|v_#memory_int_67|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][322], [Black: 257#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 164#L110true, Black: 2076#(and (= ~total~0 0) (= |ULTIMATE.start_create_fresh_int_array_#t~post39#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 273#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 2110#(and (= ~total~0 0) (or (not (= (+ (* 4 ~q1_front~0) ~q1~0.offset) 0)) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (or (<= ~n1~0 1) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 0)) (= ~q1~0.offset 0)), Black: 2084#(and (= |ULTIMATE.start_main_#t~ret24#1.offset| 0) (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2114#(and (<= 1 ~total~0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), Black: 2072#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 738#(= |thread3Thread1of1ForFork1_~cond~2#1| 1), Black: 846#(and (<= ~i~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1) (< 0 ~N~0)), 177#L143-4true, Black: 265#(<= ~q1_front~0 ~q1_back~0), 124#L92true, Black: 2080#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2112#(and (= ~total~0 0) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~q1_back~0 (+ ~q1_front~0 1))), Black: 271#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 181#L74true, Black: 266#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 2062#(and (= ~total~0 0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), Black: 2086#(and (= |ULTIMATE.start_main_#t~ret24#1.offset| 0) (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1~0.offset 0) (<= ~n1~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2108#(and (= ~total~0 0) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (<= ~q1_back~0 (+ ~q1_front~0 1)) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 0)), 4418#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 242#true, Black: 2078#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 885#(<= 1 ~total~0), 245#true, Black: 2082#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2090#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1~0.offset 0) (<= ~n1~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 859#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 3186#true, 14#L56true, Black: 2164#(<= 1 ~total~0), 867#true, Black: 3193#(<= ~n1~0 1), Black: 4390#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3702#(and (< 0 ~n1~0) (<= ~n1~0 1) (< 0 ~q1_back~0) (<= 1 ~q1_front~0))]) [2021-11-20 06:06:45,562 INFO L384 tUnfolder$Statistics]: this new event has 187 ancestors and is cut-off event [2021-11-20 06:06:45,563 INFO L387 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2021-11-20 06:06:45,563 INFO L387 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2021-11-20 06:06:45,563 INFO L387 tUnfolder$Statistics]: existing Event has 178 ancestors and is cut-off event [2021-11-20 06:06:45,645 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([871] L88-->L92: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1|))) (and (= .cse0 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_1| |v_thread3Thread1of1ForFork1_plus_~a#1_1|) (= v_~total~0_61 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~total~0_62 |v_thread3Thread1of1ForFork1_plus_#in~a#1_1|) (not (= (ite (and (<= 0 v_~q1_front~0_43) (< v_~q1_front~0_43 v_~q1_back~0_51) (< v_~q1_front~0_43 v_~n1~0_18)) 1 0) 0)) (= (select (select |v_#memory_int_67| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* v_~q1_front~0_43 4))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_1|) (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_~b#1_1| 0) (<= .cse0 2147483647)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1| 2147483648)) (<= 0 |v_thread3Thread1of1ForFork1_plus_~b#1_1|)) 1 0))) (<= 0 (+ v_~total~0_61 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1|) (<= v_~total~0_61 2147483647) (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~q1_front~0_43 1) v_~q1_front~0_42))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_43, ~q1_back~0=v_~q1_back~0_51, ~n1~0=v_~n1~0_18, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_67|, ~total~0=v_~total~0_62} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_42, ~n1~0=v_~n1~0_18, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, ~total~0=v_~total~0_61, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_51, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_23, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, #memory_int=|v_#memory_int_67|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][322], [Black: 257#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 164#L110true, Black: 2076#(and (= ~total~0 0) (= |ULTIMATE.start_create_fresh_int_array_#t~post39#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 273#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 2110#(and (= ~total~0 0) (or (not (= (+ (* 4 ~q1_front~0) ~q1~0.offset) 0)) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (or (<= ~n1~0 1) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 0)) (= ~q1~0.offset 0)), Black: 2084#(and (= |ULTIMATE.start_main_#t~ret24#1.offset| 0) (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2114#(and (<= 1 ~total~0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), Black: 2072#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 738#(= |thread3Thread1of1ForFork1_~cond~2#1| 1), Black: 846#(and (<= ~i~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1) (< 0 ~N~0)), Black: 265#(<= ~q1_front~0 ~q1_back~0), 124#L92true, Black: 2080#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2112#(and (= ~total~0 0) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~q1_back~0 (+ ~q1_front~0 1))), Black: 271#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 181#L74true, Black: 266#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 2062#(and (= ~total~0 0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), Black: 2086#(and (= |ULTIMATE.start_main_#t~ret24#1.offset| 0) (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1~0.offset 0) (<= ~n1~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2108#(and (= ~total~0 0) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (<= ~q1_back~0 (+ ~q1_front~0 1)) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 0)), 4418#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 242#true, Black: 2078#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 885#(<= 1 ~total~0), 245#true, Black: 2082#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2090#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1~0.offset 0) (<= ~n1~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 859#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 3186#true, 62#L144-2true, Black: 2164#(<= 1 ~total~0), 867#true, Black: 3193#(<= ~n1~0 1), Black: 4390#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3702#(and (< 0 ~n1~0) (<= ~n1~0 1) (< 0 ~q1_back~0) (<= 1 ~q1_front~0))]) [2021-11-20 06:06:45,646 INFO L384 tUnfolder$Statistics]: this new event has 195 ancestors and is cut-off event [2021-11-20 06:06:45,646 INFO L387 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2021-11-20 06:06:45,646 INFO L387 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2021-11-20 06:06:45,646 INFO L387 tUnfolder$Statistics]: existing Event has 186 ancestors and is cut-off event [2021-11-20 06:06:45,666 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([871] L88-->L92: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1|))) (and (= .cse0 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_1| |v_thread3Thread1of1ForFork1_plus_~a#1_1|) (= v_~total~0_61 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~total~0_62 |v_thread3Thread1of1ForFork1_plus_#in~a#1_1|) (not (= (ite (and (<= 0 v_~q1_front~0_43) (< v_~q1_front~0_43 v_~q1_back~0_51) (< v_~q1_front~0_43 v_~n1~0_18)) 1 0) 0)) (= (select (select |v_#memory_int_67| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* v_~q1_front~0_43 4))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_1|) (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_~b#1_1| 0) (<= .cse0 2147483647)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1| 2147483648)) (<= 0 |v_thread3Thread1of1ForFork1_plus_~b#1_1|)) 1 0))) (<= 0 (+ v_~total~0_61 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1|) (<= v_~total~0_61 2147483647) (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~q1_front~0_43 1) v_~q1_front~0_42))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_43, ~q1_back~0=v_~q1_back~0_51, ~n1~0=v_~n1~0_18, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_67|, ~total~0=v_~total~0_62} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_42, ~n1~0=v_~n1~0_18, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, ~total~0=v_~total~0_61, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_51, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_23, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, #memory_int=|v_#memory_int_67|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][322], [Black: 257#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 164#L110true, 47#L145-2true, Black: 2076#(and (= ~total~0 0) (= |ULTIMATE.start_create_fresh_int_array_#t~post39#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 273#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 2110#(and (= ~total~0 0) (or (not (= (+ (* 4 ~q1_front~0) ~q1~0.offset) 0)) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (or (<= ~n1~0 1) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 0)) (= ~q1~0.offset 0)), Black: 2084#(and (= |ULTIMATE.start_main_#t~ret24#1.offset| 0) (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2114#(and (<= 1 ~total~0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), Black: 2072#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 738#(= |thread3Thread1of1ForFork1_~cond~2#1| 1), Black: 846#(and (<= ~i~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1) (< 0 ~N~0)), 124#L92true, Black: 265#(<= ~q1_front~0 ~q1_back~0), Black: 2080#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 271#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 2112#(and (= ~total~0 0) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~q1_back~0 (+ ~q1_front~0 1))), Black: 266#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 2062#(and (= ~total~0 0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), Black: 2086#(and (= |ULTIMATE.start_main_#t~ret24#1.offset| 0) (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1~0.offset 0) (<= ~n1~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 4418#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2108#(and (= ~total~0 0) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (<= ~q1_back~0 (+ ~q1_front~0 1)) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 0)), 242#true, Black: 2078#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 885#(<= 1 ~total~0), 245#true, Black: 2082#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2090#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1~0.offset 0) (<= ~n1~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 859#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 3186#true, Black: 2164#(<= 1 ~total~0), 867#true, Black: 3193#(<= ~n1~0 1), Black: 4390#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3702#(and (< 0 ~n1~0) (<= ~n1~0 1) (< 0 ~q1_back~0) (<= 1 ~q1_front~0))]) [2021-11-20 06:06:45,666 INFO L384 tUnfolder$Statistics]: this new event has 202 ancestors and is cut-off event [2021-11-20 06:06:45,666 INFO L387 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2021-11-20 06:06:45,666 INFO L387 tUnfolder$Statistics]: existing Event has 190 ancestors and is cut-off event [2021-11-20 06:06:45,666 INFO L387 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2021-11-20 06:06:45,682 INFO L129 PetriNetUnfolder]: 1409/5075 cut-off events. [2021-11-20 06:06:45,682 INFO L130 PetriNetUnfolder]: For 15110/15289 co-relation queries the response was YES. [2021-11-20 06:06:45,720 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12833 conditions, 5075 events. 1409/5075 cut-off events. For 15110/15289 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 45493 event pairs, 406 based on Foata normal form. 366/4976 useless extension candidates. Maximal degree in co-relation 12801. Up to 1538 conditions per place. [2021-11-20 06:06:45,743 INFO L132 encePairwiseOnDemand]: 236/245 looper letters, 124 selfloop transitions, 9 changer transitions 9/343 dead transitions. [2021-11-20 06:06:45,743 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 343 transitions, 1999 flow [2021-11-20 06:06:45,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 06:06:45,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-11-20 06:06:45,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1406 transitions. [2021-11-20 06:06:45,748 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8198250728862974 [2021-11-20 06:06:45,748 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1406 transitions. [2021-11-20 06:06:45,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1406 transitions. [2021-11-20 06:06:45,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:06:45,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1406 transitions. [2021-11-20 06:06:45,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 200.85714285714286) internal successors, (1406), 7 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:06:45,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:06:45,757 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:06:45,757 INFO L186 Difference]: Start difference. First operand has 290 places, 297 transitions, 1297 flow. Second operand 7 states and 1406 transitions. [2021-11-20 06:06:45,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 343 transitions, 1999 flow [2021-11-20 06:06:45,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 343 transitions, 1974 flow, removed 2 selfloop flow, removed 10 redundant places. [2021-11-20 06:06:45,803 INFO L242 Difference]: Finished difference. Result has 288 places, 300 transitions, 1342 flow [2021-11-20 06:06:45,804 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=1272, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1342, PETRI_PLACES=288, PETRI_TRANSITIONS=300} [2021-11-20 06:06:45,805 INFO L334 CegarLoopForPetriNet]: 222 programPoint places, 66 predicate places. [2021-11-20 06:06:45,805 INFO L470 AbstractCegarLoop]: Abstraction has has 288 places, 300 transitions, 1342 flow [2021-11-20 06:06:45,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 198.5) internal successors, (1191), 6 states have internal predecessors, (1191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:06:45,806 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 06:06:45,806 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:06:45,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-20 06:06:45,807 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-20 06:06:45,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:45,807 INFO L85 PathProgramCache]: Analyzing trace with hash -646193361, now seen corresponding path program 4 times [2021-11-20 06:06:45,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:06:45,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203152529] [2021-11-20 06:06:45,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:45,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:06:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:06:48,365 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:06:48,366 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:06:48,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203152529] [2021-11-20 06:06:48,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203152529] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:06:48,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639003370] [2021-11-20 06:06:48,366 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 06:06:48,366 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:06:48,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:06:48,367 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:06:48,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-20 06:06:48,530 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 06:06:48,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:06:48,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 46 conjunts are in the unsatisfiable core [2021-11-20 06:06:48,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:06:48,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-20 06:06:48,730 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 06:06:48,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 [2021-11-20 06:06:49,414 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 06:06:49,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2021-11-20 06:06:50,967 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-11-20 06:06:50,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2021-11-20 06:06:51,200 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-11-20 06:06:51,200 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-11-20 06:06:51,348 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-11-20 06:06:51,349 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-11-20 06:06:51,528 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2021-11-20 06:06:51,613 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-20 06:06:51,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:06:52,722 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#t4~0#1.offset| Int) (|ULTIMATE.start_main_#t~pre32#1| Int)) (<= 1 (+ c_~total~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base|) |ULTIMATE.start_main_~#t4~0#1.offset| |ULTIMATE.start_main_#t~pre32#1|)) c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4)))))) is different from false [2021-11-20 06:07:39,722 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 06:07:39,722 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2034 treesize of output 1978 [2021-11-20 06:07:49,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2021-11-20 06:07:49,406 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-20 06:07:49,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639003370] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:07:49,406 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:07:49,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 21, 21] total 60 [2021-11-20 06:07:49,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908832021] [2021-11-20 06:07:49,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:07:49,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2021-11-20 06:07:49,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:07:49,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2021-11-20 06:07:49,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=3136, Unknown=14, NotChecked=114, Total=3540 [2021-11-20 06:07:49,420 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 245 [2021-11-20 06:07:49,429 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 300 transitions, 1342 flow. Second operand has 60 states, 60 states have (on average 99.96666666666667) internal successors, (5998), 60 states have internal predecessors, (5998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:07:49,429 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 06:07:49,429 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 245 [2021-11-20 06:07:49,430 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 06:08:18,055 INFO L129 PetriNetUnfolder]: 39311/70359 cut-off events. [2021-11-20 06:08:18,055 INFO L130 PetriNetUnfolder]: For 172653/174376 co-relation queries the response was YES. [2021-11-20 06:08:18,657 INFO L84 FinitePrefix]: Finished finitePrefix Result has 198048 conditions, 70359 events. 39311/70359 cut-off events. For 172653/174376 co-relation queries the response was YES. Maximal size of possible extension queue 2299. Compared 668366 event pairs, 5012 based on Foata normal form. 121/66406 useless extension candidates. Maximal degree in co-relation 198013. Up to 15546 conditions per place. [2021-11-20 06:08:18,951 INFO L132 encePairwiseOnDemand]: 206/245 looper letters, 367 selfloop transitions, 160 changer transitions 12/625 dead transitions. [2021-11-20 06:08:18,951 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 625 transitions, 4024 flow [2021-11-20 06:08:18,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2021-11-20 06:08:18,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2021-11-20 06:08:18,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 7063 transitions. [2021-11-20 06:08:18,968 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.41183673469387755 [2021-11-20 06:08:18,968 INFO L72 ComplementDD]: Start complementDD. Operand 70 states and 7063 transitions. [2021-11-20 06:08:18,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 7063 transitions. [2021-11-20 06:08:18,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:08:18,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 70 states and 7063 transitions. [2021-11-20 06:08:18,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 71 states, 70 states have (on average 100.9) internal successors, (7063), 70 states have internal predecessors, (7063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:08:19,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 71 states, 71 states have (on average 245.0) internal successors, (17395), 71 states have internal predecessors, (17395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:08:19,025 INFO L81 ComplementDD]: Finished complementDD. Result has 71 states, 71 states have (on average 245.0) internal successors, (17395), 71 states have internal predecessors, (17395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:08:19,025 INFO L186 Difference]: Start difference. First operand has 288 places, 300 transitions, 1342 flow. Second operand 70 states and 7063 transitions. [2021-11-20 06:08:19,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 625 transitions, 4024 flow [2021-11-20 06:08:21,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 625 transitions, 4005 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-11-20 06:08:21,780 INFO L242 Difference]: Finished difference. Result has 366 places, 388 transitions, 2581 flow [2021-11-20 06:08:21,781 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=1329, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=70, PETRI_FLOW=2581, PETRI_PLACES=366, PETRI_TRANSITIONS=388} [2021-11-20 06:08:21,782 INFO L334 CegarLoopForPetriNet]: 222 programPoint places, 144 predicate places. [2021-11-20 06:08:21,782 INFO L470 AbstractCegarLoop]: Abstraction has has 366 places, 388 transitions, 2581 flow [2021-11-20 06:08:21,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 99.96666666666667) internal successors, (5998), 60 states have internal predecessors, (5998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:08:21,785 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 06:08:21,785 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:08:21,842 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-11-20 06:08:22,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-20 06:08:22,002 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-20 06:08:22,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:08:22,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1971023394, now seen corresponding path program 5 times [2021-11-20 06:08:22,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:08:22,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815454674] [2021-11-20 06:08:22,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:08:22,003 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:08:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:08:22,154 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-20 06:08:22,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:08:22,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815454674] [2021-11-20 06:08:22,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815454674] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:08:22,155 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:08:22,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 06:08:22,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381656807] [2021-11-20 06:08:22,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:08:22,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 06:08:22,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:08:22,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 06:08:22,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-20 06:08:22,159 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 245 [2021-11-20 06:08:22,161 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 388 transitions, 2581 flow. Second operand has 6 states, 6 states have (on average 185.66666666666666) internal successors, (1114), 6 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:08:22,161 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 06:08:22,161 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 245 [2021-11-20 06:08:22,161 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 06:08:25,368 INFO L129 PetriNetUnfolder]: 3875/11754 cut-off events. [2021-11-20 06:08:25,368 INFO L130 PetriNetUnfolder]: For 70706/71094 co-relation queries the response was YES. [2021-11-20 06:08:25,492 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38804 conditions, 11754 events. 3875/11754 cut-off events. For 70706/71094 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 121268 event pairs, 646 based on Foata normal form. 112/10669 useless extension candidates. Maximal degree in co-relation 38756. Up to 2978 conditions per place. [2021-11-20 06:08:25,550 INFO L132 encePairwiseOnDemand]: 240/245 looper letters, 169 selfloop transitions, 60 changer transitions 0/441 dead transitions. [2021-11-20 06:08:25,550 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 441 transitions, 3480 flow [2021-11-20 06:08:25,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 06:08:25,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-11-20 06:08:25,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1148 transitions. [2021-11-20 06:08:25,553 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.780952380952381 [2021-11-20 06:08:25,553 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1148 transitions. [2021-11-20 06:08:25,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1148 transitions. [2021-11-20 06:08:25,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:08:25,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1148 transitions. [2021-11-20 06:08:25,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 191.33333333333334) internal successors, (1148), 6 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:08:25,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:08:25,560 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:08:25,560 INFO L186 Difference]: Start difference. First operand has 366 places, 388 transitions, 2581 flow. Second operand 6 states and 1148 transitions. [2021-11-20 06:08:25,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 441 transitions, 3480 flow [2021-11-20 06:08:25,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 441 transitions, 3250 flow, removed 67 selfloop flow, removed 37 redundant places. [2021-11-20 06:08:25,911 INFO L242 Difference]: Finished difference. Result has 334 places, 394 transitions, 2704 flow [2021-11-20 06:08:25,912 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=2302, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2704, PETRI_PLACES=334, PETRI_TRANSITIONS=394} [2021-11-20 06:08:25,913 INFO L334 CegarLoopForPetriNet]: 222 programPoint places, 112 predicate places. [2021-11-20 06:08:25,913 INFO L470 AbstractCegarLoop]: Abstraction has has 334 places, 394 transitions, 2704 flow [2021-11-20 06:08:25,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 185.66666666666666) internal successors, (1114), 6 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:08:25,913 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 06:08:25,913 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:08:25,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-20 06:08:25,914 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-20 06:08:25,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:08:25,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1033107228, now seen corresponding path program 1 times [2021-11-20 06:08:25,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:08:25,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120970027] [2021-11-20 06:08:25,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:08:25,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:08:25,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:08:26,041 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-20 06:08:26,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:08:26,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120970027] [2021-11-20 06:08:26,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120970027] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:08:26,042 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:08:26,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 06:08:26,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879288578] [2021-11-20 06:08:26,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:08:26,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 06:08:26,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:08:26,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 06:08:26,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-20 06:08:26,045 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 245 [2021-11-20 06:08:26,047 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 394 transitions, 2704 flow. Second operand has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:08:26,047 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 06:08:26,047 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 245 [2021-11-20 06:08:26,047 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 06:08:29,339 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([871] L88-->L92: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1|))) (and (= .cse0 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_1| |v_thread3Thread1of1ForFork1_plus_~a#1_1|) (= v_~total~0_61 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~total~0_62 |v_thread3Thread1of1ForFork1_plus_#in~a#1_1|) (not (= (ite (and (<= 0 v_~q1_front~0_43) (< v_~q1_front~0_43 v_~q1_back~0_51) (< v_~q1_front~0_43 v_~n1~0_18)) 1 0) 0)) (= (select (select |v_#memory_int_67| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* v_~q1_front~0_43 4))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_1|) (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_~b#1_1| 0) (<= .cse0 2147483647)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1| 2147483648)) (<= 0 |v_thread3Thread1of1ForFork1_plus_~b#1_1|)) 1 0))) (<= 0 (+ v_~total~0_61 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1|) (<= v_~total~0_61 2147483647) (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~q1_front~0_43 1) v_~q1_front~0_42))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_43, ~q1_back~0=v_~q1_back~0_51, ~n1~0=v_~n1~0_18, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_67|, ~total~0=v_~total~0_62} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_42, ~n1~0=v_~n1~0_18, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, ~total~0=v_~total~0_61, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_51, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_23, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, #memory_int=|v_#memory_int_67|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][444], [Black: 257#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 5861#true, Black: 4422#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4420#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2076#(and (= ~total~0 0) (= |ULTIMATE.start_create_fresh_int_array_#t~post39#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2110#(and (= ~total~0 0) (or (not (= (+ (* 4 ~q1_front~0) ~q1~0.offset) 0)) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (or (<= ~n1~0 1) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 0)) (= ~q1~0.offset 0)), Black: 4450#(or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 273#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 5813#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~q1_back~0 0) (and (or (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 4) (<= ~q1_back~0 2) (<= (+ ~n1~0 1) ~q1_back~0)) (= ~q1~0.offset 0))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|) (= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))), 5854#(<= ~q1_back~0 ~q1_front~0), Black: 2114#(and (<= 1 ~total~0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), Black: 738#(= |thread3Thread1of1ForFork1_~cond~2#1| 1), Black: 5821#(and (<= 1 ~total~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))), Black: 2072#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 5831#(and (or (<= 1 ~total~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 846#(and (<= ~i~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1) (< 0 ~N~0)), Black: 5795#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~q1_back~0 0) (and (or (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 4) (<= ~q1_back~0 2) (<= (+ ~n1~0 1) ~q1_back~0)) (= ~q1~0.offset 0))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))), 124#L92true, Black: 265#(<= ~q1_front~0 ~q1_back~0), Black: 2112#(and (= ~total~0 0) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~q1_back~0 (+ ~q1_front~0 1))), Black: 271#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 5737#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_front~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (<= ~q1_front~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_front~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2))) (= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 266#(<= (+ ~q1_front~0 1) ~q1_back~0), 181#L74true, Black: 5721#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_front~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (<= ~q1_front~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1) (or (<= ~q1_front~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2062#(and (= ~total~0 0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), Black: 5829#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|) (= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))), Black: 5823#(and (<= 1 ~total~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))), Black: 2108#(and (= ~total~0 0) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (<= ~q1_back~0 (+ ~q1_front~0 1)) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 0)), Black: 5815#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))), 242#true, Black: 2078#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 5733#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_front~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (<= ~q1_front~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (or (<= ~q1_front~0 0) (<= (+ ~n1~0 |ULTIMATE.start_create_fresh_int_array_#t~post39#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_front~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2))) (= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 885#(<= 1 ~total~0), 245#true, 126#L113true, 3186#true, Black: 859#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 5855#(<= ~q1_back~0 (+ ~q1_front~0 1)), 62#L144-2true, Black: 2164#(<= 1 ~total~0), 867#true, Black: 3193#(<= ~n1~0 1), Black: 4390#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3702#(and (< 0 ~n1~0) (<= ~n1~0 1) (< 0 ~q1_back~0) (<= 1 ~q1_front~0)), 4426#true]) [2021-11-20 06:08:29,339 INFO L384 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2021-11-20 06:08:29,339 INFO L387 tUnfolder$Statistics]: existing Event has 190 ancestors and is cut-off event [2021-11-20 06:08:29,339 INFO L387 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2021-11-20 06:08:29,339 INFO L387 tUnfolder$Statistics]: existing Event has 187 ancestors and is cut-off event [2021-11-20 06:08:29,429 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([871] L88-->L92: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1|))) (and (= .cse0 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_1| |v_thread3Thread1of1ForFork1_plus_~a#1_1|) (= v_~total~0_61 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~total~0_62 |v_thread3Thread1of1ForFork1_plus_#in~a#1_1|) (not (= (ite (and (<= 0 v_~q1_front~0_43) (< v_~q1_front~0_43 v_~q1_back~0_51) (< v_~q1_front~0_43 v_~n1~0_18)) 1 0) 0)) (= (select (select |v_#memory_int_67| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* v_~q1_front~0_43 4))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_1|) (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_~b#1_1| 0) (<= .cse0 2147483647)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1| 2147483648)) (<= 0 |v_thread3Thread1of1ForFork1_plus_~b#1_1|)) 1 0))) (<= 0 (+ v_~total~0_61 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1|) (<= v_~total~0_61 2147483647) (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~q1_front~0_43 1) v_~q1_front~0_42))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_43, ~q1_back~0=v_~q1_back~0_51, ~n1~0=v_~n1~0_18, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_67|, ~total~0=v_~total~0_62} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_42, ~n1~0=v_~n1~0_18, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, ~total~0=v_~total~0_61, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_51, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_23, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, #memory_int=|v_#memory_int_67|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][444], [Black: 257#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 5861#true, 164#L110true, Black: 4422#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4420#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2076#(and (= ~total~0 0) (= |ULTIMATE.start_create_fresh_int_array_#t~post39#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2110#(and (= ~total~0 0) (or (not (= (+ (* 4 ~q1_front~0) ~q1~0.offset) 0)) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (or (<= ~n1~0 1) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 0)) (= ~q1~0.offset 0)), Black: 4450#(or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 273#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 5813#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~q1_back~0 0) (and (or (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 4) (<= ~q1_back~0 2) (<= (+ ~n1~0 1) ~q1_back~0)) (= ~q1~0.offset 0))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|) (= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))), 5854#(<= ~q1_back~0 ~q1_front~0), Black: 2114#(and (<= 1 ~total~0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), Black: 738#(= |thread3Thread1of1ForFork1_~cond~2#1| 1), Black: 5821#(and (<= 1 ~total~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))), Black: 2072#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 5831#(and (or (<= 1 ~total~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 846#(and (<= ~i~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1) (< 0 ~N~0)), Black: 5795#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~q1_back~0 0) (and (or (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 4) (<= ~q1_back~0 2) (<= (+ ~n1~0 1) ~q1_back~0)) (= ~q1~0.offset 0))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))), 124#L92true, Black: 265#(<= ~q1_front~0 ~q1_back~0), Black: 2112#(and (= ~total~0 0) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~q1_back~0 (+ ~q1_front~0 1))), Black: 271#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 5737#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_front~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (<= ~q1_front~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_front~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2))) (= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 266#(<= (+ ~q1_front~0 1) ~q1_back~0), 181#L74true, Black: 5721#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_front~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (<= ~q1_front~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1) (or (<= ~q1_front~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2062#(and (= ~total~0 0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), Black: 5829#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|) (= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))), Black: 5823#(and (<= 1 ~total~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))), Black: 2108#(and (= ~total~0 0) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (<= ~q1_back~0 (+ ~q1_front~0 1)) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 0)), Black: 5815#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))), 242#true, Black: 2078#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 5733#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_front~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (<= ~q1_front~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (or (<= ~q1_front~0 0) (<= (+ ~n1~0 |ULTIMATE.start_create_fresh_int_array_#t~post39#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_front~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2))) (= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 885#(<= 1 ~total~0), 245#true, 3186#true, Black: 859#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 5855#(<= ~q1_back~0 (+ ~q1_front~0 1)), 62#L144-2true, Black: 2164#(<= 1 ~total~0), 867#true, Black: 3193#(<= ~n1~0 1), Black: 4390#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3702#(and (< 0 ~n1~0) (<= ~n1~0 1) (< 0 ~q1_back~0) (<= 1 ~q1_front~0)), 4426#true]) [2021-11-20 06:08:29,429 INFO L384 tUnfolder$Statistics]: this new event has 198 ancestors and is cut-off event [2021-11-20 06:08:29,429 INFO L387 tUnfolder$Statistics]: existing Event has 189 ancestors and is cut-off event [2021-11-20 06:08:29,429 INFO L387 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2021-11-20 06:08:29,430 INFO L387 tUnfolder$Statistics]: existing Event has 186 ancestors and is cut-off event [2021-11-20 06:08:29,548 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([871] L88-->L92: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1|))) (and (= .cse0 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_1| |v_thread3Thread1of1ForFork1_plus_~a#1_1|) (= v_~total~0_61 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~total~0_62 |v_thread3Thread1of1ForFork1_plus_#in~a#1_1|) (not (= (ite (and (<= 0 v_~q1_front~0_43) (< v_~q1_front~0_43 v_~q1_back~0_51) (< v_~q1_front~0_43 v_~n1~0_18)) 1 0) 0)) (= (select (select |v_#memory_int_67| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* v_~q1_front~0_43 4))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_1|) (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_~b#1_1| 0) (<= .cse0 2147483647)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1| 2147483648)) (<= 0 |v_thread3Thread1of1ForFork1_plus_~b#1_1|)) 1 0))) (<= 0 (+ v_~total~0_61 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1|) (<= v_~total~0_61 2147483647) (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~q1_front~0_43 1) v_~q1_front~0_42))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_43, ~q1_back~0=v_~q1_back~0_51, ~n1~0=v_~n1~0_18, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_67|, ~total~0=v_~total~0_62} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_42, ~n1~0=v_~n1~0_18, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, ~total~0=v_~total~0_61, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_51, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_23, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, #memory_int=|v_#memory_int_67|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][444], [Black: 257#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 5861#true, Black: 4422#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 47#L145-2true, Black: 4420#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2076#(and (= ~total~0 0) (= |ULTIMATE.start_create_fresh_int_array_#t~post39#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2110#(and (= ~total~0 0) (or (not (= (+ (* 4 ~q1_front~0) ~q1~0.offset) 0)) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (or (<= ~n1~0 1) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 0)) (= ~q1~0.offset 0)), Black: 4450#(or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 273#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 5813#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~q1_back~0 0) (and (or (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 4) (<= ~q1_back~0 2) (<= (+ ~n1~0 1) ~q1_back~0)) (= ~q1~0.offset 0))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|) (= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))), 5854#(<= ~q1_back~0 ~q1_front~0), Black: 2114#(and (<= 1 ~total~0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), Black: 738#(= |thread3Thread1of1ForFork1_~cond~2#1| 1), Black: 5821#(and (<= 1 ~total~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))), Black: 2072#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 5831#(and (or (<= 1 ~total~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 846#(and (<= ~i~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1) (< 0 ~N~0)), Black: 5795#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~q1_back~0 0) (and (or (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 4) (<= ~q1_back~0 2) (<= (+ ~n1~0 1) ~q1_back~0)) (= ~q1~0.offset 0))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))), 124#L92true, Black: 265#(<= ~q1_front~0 ~q1_back~0), Black: 2112#(and (= ~total~0 0) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~q1_back~0 (+ ~q1_front~0 1))), Black: 271#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 5737#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_front~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (<= ~q1_front~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_front~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2))) (= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 266#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 5721#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_front~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (<= ~q1_front~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1) (or (<= ~q1_front~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2062#(and (= ~total~0 0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), Black: 5829#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|) (= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))), Black: 5823#(and (<= 1 ~total~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))), Black: 2108#(and (= ~total~0 0) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (<= ~q1_back~0 (+ ~q1_front~0 1)) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 0)), Black: 5815#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))), 242#true, Black: 2078#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 5733#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_front~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (<= ~q1_front~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (or (<= ~q1_front~0 0) (<= (+ ~n1~0 |ULTIMATE.start_create_fresh_int_array_#t~post39#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_front~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2))) (= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 885#(<= 1 ~total~0), 245#true, 126#L113true, 3186#true, Black: 859#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 5855#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 2164#(<= 1 ~total~0), 867#true, Black: 3193#(<= ~n1~0 1), Black: 4390#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3702#(and (< 0 ~n1~0) (<= ~n1~0 1) (< 0 ~q1_back~0) (<= 1 ~q1_front~0)), 4426#true]) [2021-11-20 06:08:29,549 INFO L384 tUnfolder$Statistics]: this new event has 203 ancestors and is cut-off event [2021-11-20 06:08:29,549 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2021-11-20 06:08:29,549 INFO L387 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2021-11-20 06:08:29,549 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2021-11-20 06:08:29,577 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([871] L88-->L92: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1|))) (and (= .cse0 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_1| |v_thread3Thread1of1ForFork1_plus_~a#1_1|) (= v_~total~0_61 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~total~0_62 |v_thread3Thread1of1ForFork1_plus_#in~a#1_1|) (not (= (ite (and (<= 0 v_~q1_front~0_43) (< v_~q1_front~0_43 v_~q1_back~0_51) (< v_~q1_front~0_43 v_~n1~0_18)) 1 0) 0)) (= (select (select |v_#memory_int_67| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* v_~q1_front~0_43 4))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_1|) (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_~b#1_1| 0) (<= .cse0 2147483647)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1| 2147483648)) (<= 0 |v_thread3Thread1of1ForFork1_plus_~b#1_1|)) 1 0))) (<= 0 (+ v_~total~0_61 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1|) (<= v_~total~0_61 2147483647) (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~q1_front~0_43 1) v_~q1_front~0_42))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_43, ~q1_back~0=v_~q1_back~0_51, ~n1~0=v_~n1~0_18, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_67|, ~total~0=v_~total~0_62} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_42, ~n1~0=v_~n1~0_18, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, ~total~0=v_~total~0_61, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_51, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_23, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, #memory_int=|v_#memory_int_67|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][444], [Black: 257#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 5861#true, 164#L110true, Black: 4422#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 47#L145-2true, Black: 4420#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2076#(and (= ~total~0 0) (= |ULTIMATE.start_create_fresh_int_array_#t~post39#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2110#(and (= ~total~0 0) (or (not (= (+ (* 4 ~q1_front~0) ~q1~0.offset) 0)) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (or (<= ~n1~0 1) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 0)) (= ~q1~0.offset 0)), 273#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 4450#(or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 5813#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~q1_back~0 0) (and (or (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 4) (<= ~q1_back~0 2) (<= (+ ~n1~0 1) ~q1_back~0)) (= ~q1~0.offset 0))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|) (= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))), 5854#(<= ~q1_back~0 ~q1_front~0), Black: 2114#(and (<= 1 ~total~0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), Black: 738#(= |thread3Thread1of1ForFork1_~cond~2#1| 1), Black: 5821#(and (<= 1 ~total~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))), Black: 2072#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 5831#(and (or (<= 1 ~total~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 846#(and (<= ~i~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1) (< 0 ~N~0)), Black: 5795#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~q1_back~0 0) (and (or (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 4) (<= ~q1_back~0 2) (<= (+ ~n1~0 1) ~q1_back~0)) (= ~q1~0.offset 0))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))), 124#L92true, Black: 265#(<= ~q1_front~0 ~q1_back~0), Black: 2112#(and (= ~total~0 0) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~q1_back~0 (+ ~q1_front~0 1))), Black: 271#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 5737#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_front~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (<= ~q1_front~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_front~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2))) (= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 266#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 5721#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_front~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (<= ~q1_front~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1) (or (<= ~q1_front~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2062#(and (= ~total~0 0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), Black: 5829#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|) (= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))), Black: 5823#(and (<= 1 ~total~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))), Black: 2108#(and (= ~total~0 0) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (<= ~q1_back~0 (+ ~q1_front~0 1)) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 0)), Black: 5815#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))), 242#true, Black: 2078#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 5733#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_front~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (<= ~q1_front~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (or (<= ~q1_front~0 0) (<= (+ ~n1~0 |ULTIMATE.start_create_fresh_int_array_#t~post39#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t4~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_front~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2))) (= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 885#(<= 1 ~total~0), 245#true, 3186#true, Black: 859#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 5855#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 2164#(<= 1 ~total~0), 867#true, Black: 3193#(<= ~n1~0 1), Black: 4390#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3702#(and (< 0 ~n1~0) (<= ~n1~0 1) (< 0 ~q1_back~0) (<= 1 ~q1_front~0)), 4426#true]) [2021-11-20 06:08:29,578 INFO L384 tUnfolder$Statistics]: this new event has 205 ancestors and is cut-off event [2021-11-20 06:08:29,578 INFO L387 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2021-11-20 06:08:29,578 INFO L387 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2021-11-20 06:08:29,578 INFO L387 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2021-11-20 06:08:29,666 INFO L129 PetriNetUnfolder]: 4279/14814 cut-off events. [2021-11-20 06:08:29,666 INFO L130 PetriNetUnfolder]: For 115575/116390 co-relation queries the response was YES. [2021-11-20 06:08:29,832 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46468 conditions, 14814 events. 4279/14814 cut-off events. For 115575/116390 co-relation queries the response was YES. Maximal size of possible extension queue 683. Compared 170828 event pairs, 948 based on Foata normal form. 698/13888 useless extension candidates. Maximal degree in co-relation 46424. Up to 3462 conditions per place. [2021-11-20 06:08:29,915 INFO L132 encePairwiseOnDemand]: 240/245 looper letters, 235 selfloop transitions, 10 changer transitions 0/470 dead transitions. [2021-11-20 06:08:29,915 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 470 transitions, 4313 flow [2021-11-20 06:08:29,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 06:08:29,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-11-20 06:08:29,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 951 transitions. [2021-11-20 06:08:29,918 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7763265306122449 [2021-11-20 06:08:29,918 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 951 transitions. [2021-11-20 06:08:29,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 951 transitions. [2021-11-20 06:08:29,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:08:29,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 951 transitions. [2021-11-20 06:08:29,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 190.2) internal successors, (951), 5 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:08:29,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:08:29,925 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:08:29,925 INFO L186 Difference]: Start difference. First operand has 334 places, 394 transitions, 2704 flow. Second operand 5 states and 951 transitions. [2021-11-20 06:08:29,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 470 transitions, 4313 flow [2021-11-20 06:08:30,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 470 transitions, 4227 flow, removed 19 selfloop flow, removed 4 redundant places. [2021-11-20 06:08:30,444 INFO L242 Difference]: Finished difference. Result has 335 places, 395 transitions, 2752 flow [2021-11-20 06:08:30,445 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=2650, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2752, PETRI_PLACES=335, PETRI_TRANSITIONS=395} [2021-11-20 06:08:30,445 INFO L334 CegarLoopForPetriNet]: 222 programPoint places, 113 predicate places. [2021-11-20 06:08:30,446 INFO L470 AbstractCegarLoop]: Abstraction has has 335 places, 395 transitions, 2752 flow [2021-11-20 06:08:30,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:08:30,446 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 06:08:30,447 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:08:30,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-20 06:08:30,447 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-20 06:08:30,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:08:30,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1054452721, now seen corresponding path program 6 times [2021-11-20 06:08:30,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:08:30,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737108881] [2021-11-20 06:08:30,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:08:30,448 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:08:30,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:08:32,477 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:08:32,477 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:08:32,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737108881] [2021-11-20 06:08:32,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737108881] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:08:32,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529415377] [2021-11-20 06:08:32,478 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-20 06:08:32,478 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:08:32,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:08:32,479 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:08:32,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fb33fe-d5d1-4818-a0ae-e0d53abb18d3/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-20 06:08:32,632 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-11-20 06:08:32,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:08:32,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 81 conjunts are in the unsatisfiable core [2021-11-20 06:08:32,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:08:32,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-20 06:08:32,769 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 06:08:32,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 [2021-11-20 06:08:32,844 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-20 06:08:32,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 17 treesize of output 22 [2021-11-20 06:08:32,931 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-20 06:08:32,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 22 treesize of output 30 [2021-11-20 06:08:34,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:08:34,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:08:34,302 INFO L354 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2021-11-20 06:08:34,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 26 treesize of output 24 [2021-11-20 06:08:34,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 11 [2021-11-20 06:08:36,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2021-11-20 06:08:37,050 INFO L354 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2021-11-20 06:08:37,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2021-11-20 06:08:37,290 INFO L354 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2021-11-20 06:08:37,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2021-11-20 06:08:37,557 INFO L354 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2021-11-20 06:08:37,558 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2021-11-20 06:08:37,970 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-11-20 06:08:37,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 18 [2021-11-20 06:08:38,079 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:08:38,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:09:14,192 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-11-20 06:09:14,195 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18346637 treesize of output 18063429