./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d299df2e-6549-4cac-a254-e87ff9d9c3a2/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d299df2e-6549-4cac-a254-e87ff9d9c3a2/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d299df2e-6549-4cac-a254-e87ff9d9c3a2/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d299df2e-6549-4cac-a254-e87ff9d9c3a2/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d299df2e-6549-4cac-a254-e87ff9d9c3a2/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d299df2e-6549-4cac-a254-e87ff9d9c3a2/bin/uautomizer-DrprNOufMa --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 f83ae5bec1717d6f197d4259600c0d1f406909832409df09253b7bf70d3f66fc --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 22:52:27,362 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 22:52:27,364 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 22:52:27,396 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 22:52:27,397 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 22:52:27,398 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 22:52:27,400 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 22:52:27,402 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 22:52:27,404 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 22:52:27,405 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 22:52:27,406 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 22:52:27,408 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 22:52:27,413 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 22:52:27,414 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 22:52:27,415 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 22:52:27,416 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 22:52:27,416 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 22:52:27,417 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 22:52:27,419 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 22:52:27,420 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 22:52:27,422 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 22:52:27,423 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 22:52:27,424 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 22:52:27,425 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 22:52:27,427 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 22:52:27,427 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 22:52:27,428 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 22:52:27,432 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 22:52:27,432 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 22:52:27,434 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 22:52:27,434 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 22:52:27,435 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 22:52:27,435 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 22:52:27,436 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 22:52:27,437 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 22:52:27,437 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 22:52:27,438 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 22:52:27,438 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 22:52:27,438 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 22:52:27,439 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 22:52:27,439 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 22:52:27,440 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d299df2e-6549-4cac-a254-e87ff9d9c3a2/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 22:52:27,466 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 22:52:27,467 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 22:52:27,467 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 22:52:27,467 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 22:52:27,468 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 22:52:27,468 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 22:52:27,469 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 22:52:27,469 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 22:52:27,469 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 22:52:27,469 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 22:52:27,469 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 22:52:27,469 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 22:52:27,470 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 22:52:27,470 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 22:52:27,470 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 22:52:27,470 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 22:52:27,470 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 22:52:27,470 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 22:52:27,470 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 22:52:27,471 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 22:52:27,471 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 22:52:27,471 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 22:52:27,471 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 22:52:27,471 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 22:52:27,471 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 22:52:27,471 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 22:52:27,471 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 22:52:27,472 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 22:52:27,472 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 22:52:27,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 22:52:27,472 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 22:52:27,472 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 22:52:27,472 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 22:52:27,472 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 22:52:27,472 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_d299df2e-6549-4cac-a254-e87ff9d9c3a2/bin/uautomizer-DrprNOufMa/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_d299df2e-6549-4cac-a254-e87ff9d9c3a2/bin/uautomizer-DrprNOufMa 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 -> f83ae5bec1717d6f197d4259600c0d1f406909832409df09253b7bf70d3f66fc [2021-12-06 22:52:27,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 22:52:27,669 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 22:52:27,671 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 22:52:27,672 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 22:52:27,672 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 22:52:27,673 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d299df2e-6549-4cac-a254-e87ff9d9c3a2/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c [2021-12-06 22:52:27,721 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d299df2e-6549-4cac-a254-e87ff9d9c3a2/bin/uautomizer-DrprNOufMa/data/bfe6dca8a/95876374748d40fba01fb34db01e2621/FLAGe43e9d11e [2021-12-06 22:52:28,118 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 22:52:28,119 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d299df2e-6549-4cac-a254-e87ff9d9c3a2/sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c [2021-12-06 22:52:28,125 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d299df2e-6549-4cac-a254-e87ff9d9c3a2/bin/uautomizer-DrprNOufMa/data/bfe6dca8a/95876374748d40fba01fb34db01e2621/FLAGe43e9d11e [2021-12-06 22:52:28,135 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d299df2e-6549-4cac-a254-e87ff9d9c3a2/bin/uautomizer-DrprNOufMa/data/bfe6dca8a/95876374748d40fba01fb34db01e2621 [2021-12-06 22:52:28,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 22:52:28,139 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 22:52:28,140 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 22:52:28,140 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 22:52:28,142 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 22:52:28,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 10:52:28" (1/1) ... [2021-12-06 22:52:28,144 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d469e59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:52:28, skipping insertion in model container [2021-12-06 22:52:28,144 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 10:52:28" (1/1) ... [2021-12-06 22:52:28,149 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 22:52:28,164 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 22:52:28,286 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_d299df2e-6549-4cac-a254-e87ff9d9c3a2/sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c[4232,4245] [2021-12-06 22:52:28,292 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 22:52:28,298 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 22:52:28,320 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_d299df2e-6549-4cac-a254-e87ff9d9c3a2/sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c[4232,4245] [2021-12-06 22:52:28,323 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 22:52:28,334 INFO L208 MainTranslator]: Completed translation [2021-12-06 22:52:28,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:52:28 WrapperNode [2021-12-06 22:52:28,335 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 22:52:28,335 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 22:52:28,335 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 22:52:28,335 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 22:52:28,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:52:28" (1/1) ... [2021-12-06 22:52:28,348 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:52:28" (1/1) ... [2021-12-06 22:52:28,376 INFO L137 Inliner]: procedures = 27, calls = 83, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 346 [2021-12-06 22:52:28,376 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 22:52:28,377 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 22:52:28,377 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 22:52:28,377 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 22:52:28,383 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:52:28" (1/1) ... [2021-12-06 22:52:28,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:52:28" (1/1) ... [2021-12-06 22:52:28,387 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:52:28" (1/1) ... [2021-12-06 22:52:28,387 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:52:28" (1/1) ... [2021-12-06 22:52:28,396 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:52:28" (1/1) ... [2021-12-06 22:52:28,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:52:28" (1/1) ... [2021-12-06 22:52:28,403 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:52:28" (1/1) ... [2021-12-06 22:52:28,407 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 22:52:28,408 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 22:52:28,408 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 22:52:28,408 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 22:52:28,409 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:52:28" (1/1) ... [2021-12-06 22:52:28,414 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 22:52:28,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d299df2e-6549-4cac-a254-e87ff9d9c3a2/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:52:28,433 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d299df2e-6549-4cac-a254-e87ff9d9c3a2/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 22:52:28,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d299df2e-6549-4cac-a254-e87ff9d9c3a2/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 22:52:28,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 22:52:28,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-06 22:52:28,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-06 22:52:28,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-06 22:52:28,463 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-12-06 22:52:28,463 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-12-06 22:52:28,463 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-12-06 22:52:28,464 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-12-06 22:52:28,464 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-12-06 22:52:28,464 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-12-06 22:52:28,464 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-12-06 22:52:28,464 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-12-06 22:52:28,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 22:52:28,464 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-06 22:52:28,464 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-06 22:52:28,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-06 22:52:28,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 22:52:28,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 22:52:28,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 22:52:28,466 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-06 22:52:28,539 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 22:52:28,541 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 22:52:28,881 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 22:52:28,989 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 22:52:28,989 INFO L301 CfgBuilder]: Removed 7 assume(true) statements. [2021-12-06 22:52:28,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 10:52:28 BoogieIcfgContainer [2021-12-06 22:52:28,991 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 22:52:28,992 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 22:52:28,992 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 22:52:28,995 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 22:52:28,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 10:52:28" (1/3) ... [2021-12-06 22:52:28,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f134044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 10:52:28, skipping insertion in model container [2021-12-06 22:52:28,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:52:28" (2/3) ... [2021-12-06 22:52:28,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f134044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 10:52:28, skipping insertion in model container [2021-12-06 22:52:28,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 10:52:28" (3/3) ... [2021-12-06 22:52:28,997 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series2.wvr.c [2021-12-06 22:52:29,000 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-06 22:52:29,001 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 22:52:29,001 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-06 22:52:29,001 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-06 22:52:29,028 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,028 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,028 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,028 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,028 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,029 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,029 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,029 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,029 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,029 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,029 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,029 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,029 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,029 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,029 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,030 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,030 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,030 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,030 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,030 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,030 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,030 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,030 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,031 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,031 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,031 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,031 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,031 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,031 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,031 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,032 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,032 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,032 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,032 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,032 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,032 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,032 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,032 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,032 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,032 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,032 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,033 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,033 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,033 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,033 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,033 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,033 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,033 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,033 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,033 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,034 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,034 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,034 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,034 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,034 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,034 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,034 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,034 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,036 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,036 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,036 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,036 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,037 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,037 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,037 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,037 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,037 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,037 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,037 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,037 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,037 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,037 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,037 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,037 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,038 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,038 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,038 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,038 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,038 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,038 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,038 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,038 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,039 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,039 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,039 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,039 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,039 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,039 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,039 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,039 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,039 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,040 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,040 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,040 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,040 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,040 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,040 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,040 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,040 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,040 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,040 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,040 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,041 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,041 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,041 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,041 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,041 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,041 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,041 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,041 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,041 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,041 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,041 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,042 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,044 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,044 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,044 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,044 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,044 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,044 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,044 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,044 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,045 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,045 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,045 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,045 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,045 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,046 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,046 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,046 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,046 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,046 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,046 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,046 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,046 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,046 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,046 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,047 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,047 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,047 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,047 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,047 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,047 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,047 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,047 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,048 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,048 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,048 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,048 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,048 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,048 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,048 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,048 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,048 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,049 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,049 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,049 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,049 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,049 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:52:29,051 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-12-06 22:52:29,085 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 22:52:29,090 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-12-06 22:52:29,091 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-12-06 22:52:29,103 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 256 places, 265 transitions, 562 flow [2021-12-06 22:52:29,186 INFO L129 PetriNetUnfolder]: 22/261 cut-off events. [2021-12-06 22:52:29,186 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-12-06 22:52:29,190 INFO L84 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 261 events. 22/261 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 128 event pairs, 0 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 222. Up to 2 conditions per place. [2021-12-06 22:52:29,190 INFO L82 GeneralOperation]: Start removeDead. Operand has 256 places, 265 transitions, 562 flow [2021-12-06 22:52:29,198 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 239 places, 248 transitions, 520 flow [2021-12-06 22:52:29,242 INFO L129 PetriNetUnfolder]: 22/247 cut-off events. [2021-12-06 22:52:29,242 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-12-06 22:52:29,242 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:52:29,243 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] [2021-12-06 22:52:29,243 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-12-06 22:52:29,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:52:29,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1929909788, now seen corresponding path program 1 times [2021-12-06 22:52:29,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:52:29,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963839589] [2021-12-06 22:52:29,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:52:29,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:52:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:29,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:52:29,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:52:29,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963839589] [2021-12-06 22:52:29,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963839589] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:52:29,471 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:52:29,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 22:52:29,472 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490896832] [2021-12-06 22:52:29,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:52:29,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-06 22:52:29,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:52:29,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-06 22:52:29,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-06 22:52:29,502 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 265 [2021-12-06 22:52:29,505 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 248 transitions, 520 flow. Second operand has 2 states, 2 states have (on average 242.0) internal successors, (484), 2 states have internal predecessors, (484), 0 states have call successors, (0), 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-12-06 22:52:29,505 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:52:29,505 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 265 [2021-12-06 22:52:29,506 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:52:29,655 INFO L129 PetriNetUnfolder]: 124/548 cut-off events. [2021-12-06 22:52:29,655 INFO L130 PetriNetUnfolder]: For 105/106 co-relation queries the response was YES. [2021-12-06 22:52:29,658 INFO L84 FinitePrefix]: Finished finitePrefix Result has 776 conditions, 548 events. 124/548 cut-off events. For 105/106 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1720 event pairs, 51 based on Foata normal form. 128/613 useless extension candidates. Maximal degree in co-relation 504. Up to 163 conditions per place. [2021-12-06 22:52:29,662 INFO L132 encePairwiseOnDemand]: 250/265 looper letters, 12 selfloop transitions, 0 changer transitions 8/233 dead transitions. [2021-12-06 22:52:29,662 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 233 transitions, 514 flow [2021-12-06 22:52:29,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-06 22:52:29,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2021-12-06 22:52:29,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 501 transitions. [2021-12-06 22:52:29,674 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9452830188679245 [2021-12-06 22:52:29,674 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 501 transitions. [2021-12-06 22:52:29,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 501 transitions. [2021-12-06 22:52:29,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:52:29,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 501 transitions. [2021-12-06 22:52:29,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 250.5) internal successors, (501), 2 states have internal predecessors, (501), 0 states have call successors, (0), 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-12-06 22:52:29,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 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-12-06 22:52:29,689 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 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-12-06 22:52:29,690 INFO L186 Difference]: Start difference. First operand has 239 places, 248 transitions, 520 flow. Second operand 2 states and 501 transitions. [2021-12-06 22:52:29,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 233 transitions, 514 flow [2021-12-06 22:52:29,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 233 transitions, 498 flow, removed 0 selfloop flow, removed 8 redundant places. [2021-12-06 22:52:29,699 INFO L242 Difference]: Finished difference. Result has 232 places, 225 transitions, 458 flow [2021-12-06 22:52:29,701 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=458, PETRI_PLACES=232, PETRI_TRANSITIONS=225} [2021-12-06 22:52:29,703 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, -7 predicate places. [2021-12-06 22:52:29,703 INFO L470 AbstractCegarLoop]: Abstraction has has 232 places, 225 transitions, 458 flow [2021-12-06 22:52:29,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 242.0) internal successors, (484), 2 states have internal predecessors, (484), 0 states have call successors, (0), 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-12-06 22:52:29,704 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:52:29,704 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] [2021-12-06 22:52:29,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 22:52:29,705 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-12-06 22:52:29,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:52:29,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1432313826, now seen corresponding path program 1 times [2021-12-06 22:52:29,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:52:29,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896462262] [2021-12-06 22:52:29,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:52:29,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:52:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:29,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:52:29,950 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:52:29,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896462262] [2021-12-06 22:52:29,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896462262] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:52:29,950 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:52:29,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 22:52:29,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636301152] [2021-12-06 22:52:29,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:52:29,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 22:52:29,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:52:29,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 22:52:29,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 22:52:29,954 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 265 [2021-12-06 22:52:29,955 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 225 transitions, 458 flow. Second operand has 5 states, 5 states have (on average 204.2) internal successors, (1021), 5 states have internal predecessors, (1021), 0 states have call successors, (0), 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-12-06 22:52:29,956 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:52:29,956 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 265 [2021-12-06 22:52:29,956 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:52:30,111 INFO L129 PetriNetUnfolder]: 134/552 cut-off events. [2021-12-06 22:52:30,111 INFO L130 PetriNetUnfolder]: For 31/32 co-relation queries the response was YES. [2021-12-06 22:52:30,114 INFO L84 FinitePrefix]: Finished finitePrefix Result has 778 conditions, 552 events. 134/552 cut-off events. For 31/32 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1675 event pairs, 14 based on Foata normal form. 1/511 useless extension candidates. Maximal degree in co-relation 775. Up to 133 conditions per place. [2021-12-06 22:52:30,118 INFO L132 encePairwiseOnDemand]: 259/265 looper letters, 50 selfloop transitions, 3 changer transitions 4/237 dead transitions. [2021-12-06 22:52:30,119 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 237 transitions, 601 flow [2021-12-06 22:52:30,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 22:52:30,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-06 22:52:30,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1038 transitions. [2021-12-06 22:52:30,124 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7833962264150943 [2021-12-06 22:52:30,124 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1038 transitions. [2021-12-06 22:52:30,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1038 transitions. [2021-12-06 22:52:30,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:52:30,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1038 transitions. [2021-12-06 22:52:30,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 207.6) internal successors, (1038), 5 states have internal predecessors, (1038), 0 states have call successors, (0), 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-12-06 22:52:30,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 265.0) internal successors, (1590), 6 states have internal predecessors, (1590), 0 states have call successors, (0), 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-12-06 22:52:30,137 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 265.0) internal successors, (1590), 6 states have internal predecessors, (1590), 0 states have call successors, (0), 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-12-06 22:52:30,137 INFO L186 Difference]: Start difference. First operand has 232 places, 225 transitions, 458 flow. Second operand 5 states and 1038 transitions. [2021-12-06 22:52:30,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 237 transitions, 601 flow [2021-12-06 22:52:30,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 237 transitions, 601 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-06 22:52:30,145 INFO L242 Difference]: Finished difference. Result has 231 places, 227 transitions, 481 flow [2021-12-06 22:52:30,146 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=481, PETRI_PLACES=231, PETRI_TRANSITIONS=227} [2021-12-06 22:52:30,147 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, -8 predicate places. [2021-12-06 22:52:30,147 INFO L470 AbstractCegarLoop]: Abstraction has has 231 places, 227 transitions, 481 flow [2021-12-06 22:52:30,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 204.2) internal successors, (1021), 5 states have internal predecessors, (1021), 0 states have call successors, (0), 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-12-06 22:52:30,148 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:52:30,148 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-12-06 22:52:30,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 22:52:30,149 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-12-06 22:52:30,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:52:30,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1766303309, now seen corresponding path program 1 times [2021-12-06 22:52:30,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:52:30,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969224034] [2021-12-06 22:52:30,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:52:30,150 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:52:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:30,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:52:30,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:52:30,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969224034] [2021-12-06 22:52:30,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969224034] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:52:30,255 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:52:30,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 22:52:30,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315863888] [2021-12-06 22:52:30,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:52:30,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 22:52:30,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:52:30,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 22:52:30,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 22:52:30,259 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 265 [2021-12-06 22:52:30,260 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 227 transitions, 481 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 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-12-06 22:52:30,260 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:52:30,260 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 265 [2021-12-06 22:52:30,260 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:52:30,402 INFO L129 PetriNetUnfolder]: 208/757 cut-off events. [2021-12-06 22:52:30,402 INFO L130 PetriNetUnfolder]: For 138/140 co-relation queries the response was YES. [2021-12-06 22:52:30,403 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1188 conditions, 757 events. 208/757 cut-off events. For 138/140 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3026 event pairs, 36 based on Foata normal form. 13/694 useless extension candidates. Maximal degree in co-relation 1181. Up to 207 conditions per place. [2021-12-06 22:52:30,407 INFO L132 encePairwiseOnDemand]: 262/265 looper letters, 30 selfloop transitions, 2 changer transitions 0/239 dead transitions. [2021-12-06 22:52:30,408 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 239 transitions, 581 flow [2021-12-06 22:52:30,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 22:52:30,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-06 22:52:30,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 723 transitions. [2021-12-06 22:52:30,410 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.909433962264151 [2021-12-06 22:52:30,410 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 723 transitions. [2021-12-06 22:52:30,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 723 transitions. [2021-12-06 22:52:30,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:52:30,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 723 transitions. [2021-12-06 22:52:30,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 0 states have call successors, (0), 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-12-06 22:52:30,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 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-12-06 22:52:30,415 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 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-12-06 22:52:30,415 INFO L186 Difference]: Start difference. First operand has 231 places, 227 transitions, 481 flow. Second operand 3 states and 723 transitions. [2021-12-06 22:52:30,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 239 transitions, 581 flow [2021-12-06 22:52:30,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 239 transitions, 573 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-12-06 22:52:30,421 INFO L242 Difference]: Finished difference. Result has 229 places, 228 transitions, 488 flow [2021-12-06 22:52:30,421 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=488, PETRI_PLACES=229, PETRI_TRANSITIONS=228} [2021-12-06 22:52:30,422 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, -10 predicate places. [2021-12-06 22:52:30,422 INFO L470 AbstractCegarLoop]: Abstraction has has 229 places, 228 transitions, 488 flow [2021-12-06 22:52:30,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 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-12-06 22:52:30,423 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:52:30,424 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-12-06 22:52:30,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 22:52:30,424 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-12-06 22:52:30,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:52:30,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1267494493, now seen corresponding path program 1 times [2021-12-06 22:52:30,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:52:30,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289468745] [2021-12-06 22:52:30,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:52:30,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:52:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:30,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:52:30,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:52:30,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289468745] [2021-12-06 22:52:30,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289468745] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:52:30,505 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:52:30,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 22:52:30,505 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484826964] [2021-12-06 22:52:30,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:52:30,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 22:52:30,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:52:30,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 22:52:30,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 22:52:30,508 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 265 [2021-12-06 22:52:30,510 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 228 transitions, 488 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 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-12-06 22:52:30,510 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:52:30,510 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 265 [2021-12-06 22:52:30,510 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:52:30,662 INFO L129 PetriNetUnfolder]: 153/696 cut-off events. [2021-12-06 22:52:30,662 INFO L130 PetriNetUnfolder]: For 212/215 co-relation queries the response was YES. [2021-12-06 22:52:30,663 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1092 conditions, 696 events. 153/696 cut-off events. For 212/215 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2788 event pairs, 27 based on Foata normal form. 12/635 useless extension candidates. Maximal degree in co-relation 1086. Up to 171 conditions per place. [2021-12-06 22:52:30,667 INFO L132 encePairwiseOnDemand]: 262/265 looper letters, 31 selfloop transitions, 2 changer transitions 0/240 dead transitions. [2021-12-06 22:52:30,667 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 240 transitions, 597 flow [2021-12-06 22:52:30,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 22:52:30,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-06 22:52:30,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 722 transitions. [2021-12-06 22:52:30,670 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9081761006289308 [2021-12-06 22:52:30,670 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 722 transitions. [2021-12-06 22:52:30,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 722 transitions. [2021-12-06 22:52:30,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:52:30,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 722 transitions. [2021-12-06 22:52:30,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 240.66666666666666) internal successors, (722), 3 states have internal predecessors, (722), 0 states have call successors, (0), 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-12-06 22:52:30,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 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-12-06 22:52:30,675 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 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-12-06 22:52:30,675 INFO L186 Difference]: Start difference. First operand has 229 places, 228 transitions, 488 flow. Second operand 3 states and 722 transitions. [2021-12-06 22:52:30,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 240 transitions, 597 flow [2021-12-06 22:52:30,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 240 transitions, 594 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-06 22:52:30,680 INFO L242 Difference]: Finished difference. Result has 231 places, 229 transitions, 500 flow [2021-12-06 22:52:30,680 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=231, PETRI_TRANSITIONS=229} [2021-12-06 22:52:30,681 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, -8 predicate places. [2021-12-06 22:52:30,681 INFO L470 AbstractCegarLoop]: Abstraction has has 231 places, 229 transitions, 500 flow [2021-12-06 22:52:30,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 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-12-06 22:52:30,682 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:52:30,682 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-12-06 22:52:30,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 22:52:30,682 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-12-06 22:52:30,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:52:30,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1061679038, now seen corresponding path program 1 times [2021-12-06 22:52:30,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:52:30,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469660903] [2021-12-06 22:52:30,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:52:30,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:52:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:30,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:52:30,762 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:52:30,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469660903] [2021-12-06 22:52:30,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469660903] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:52:30,762 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:52:30,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 22:52:30,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786340839] [2021-12-06 22:52:30,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:52:30,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 22:52:30,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:52:30,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 22:52:30,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 22:52:30,766 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 265 [2021-12-06 22:52:30,768 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 229 transitions, 500 flow. Second operand has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 0 states have call successors, (0), 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-12-06 22:52:30,769 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:52:30,769 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 265 [2021-12-06 22:52:30,769 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:52:30,983 INFO L129 PetriNetUnfolder]: 109/773 cut-off events. [2021-12-06 22:52:30,983 INFO L130 PetriNetUnfolder]: For 229/230 co-relation queries the response was YES. [2021-12-06 22:52:30,985 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1231 conditions, 773 events. 109/773 cut-off events. For 229/230 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2942 event pairs, 36 based on Foata normal form. 8/712 useless extension candidates. Maximal degree in co-relation 1224. Up to 167 conditions per place. [2021-12-06 22:52:30,988 INFO L132 encePairwiseOnDemand]: 255/265 looper letters, 84 selfloop transitions, 11 changer transitions 0/270 dead transitions. [2021-12-06 22:52:30,988 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 270 transitions, 793 flow [2021-12-06 22:52:30,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 22:52:30,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-06 22:52:30,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1881 transitions. [2021-12-06 22:52:30,993 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7886792452830189 [2021-12-06 22:52:30,993 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1881 transitions. [2021-12-06 22:52:30,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1881 transitions. [2021-12-06 22:52:30,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:52:30,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1881 transitions. [2021-12-06 22:52:30,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 209.0) internal successors, (1881), 9 states have internal predecessors, (1881), 0 states have call successors, (0), 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-12-06 22:52:31,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 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-12-06 22:52:31,005 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 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-12-06 22:52:31,005 INFO L186 Difference]: Start difference. First operand has 231 places, 229 transitions, 500 flow. Second operand 9 states and 1881 transitions. [2021-12-06 22:52:31,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 270 transitions, 793 flow [2021-12-06 22:52:31,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 270 transitions, 790 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-06 22:52:31,010 INFO L242 Difference]: Finished difference. Result has 240 places, 233 transitions, 540 flow [2021-12-06 22:52:31,011 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=540, PETRI_PLACES=240, PETRI_TRANSITIONS=233} [2021-12-06 22:52:31,011 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 1 predicate places. [2021-12-06 22:52:31,011 INFO L470 AbstractCegarLoop]: Abstraction has has 240 places, 233 transitions, 540 flow [2021-12-06 22:52:31,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 0 states have call successors, (0), 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-12-06 22:52:31,012 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:52:31,012 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-12-06 22:52:31,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 22:52:31,012 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-12-06 22:52:31,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:52:31,013 INFO L85 PathProgramCache]: Analyzing trace with hash 848372614, now seen corresponding path program 1 times [2021-12-06 22:52:31,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:52:31,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252915659] [2021-12-06 22:52:31,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:52:31,013 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:52:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:31,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 22:52:31,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:52:31,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252915659] [2021-12-06 22:52:31,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252915659] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:52:31,086 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:52:31,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 22:52:31,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999235417] [2021-12-06 22:52:31,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:52:31,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 22:52:31,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:52:31,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 22:52:31,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 22:52:31,089 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 265 [2021-12-06 22:52:31,090 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 233 transitions, 540 flow. Second operand has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 0 states have call successors, (0), 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-12-06 22:52:31,090 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:52:31,090 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 265 [2021-12-06 22:52:31,090 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:52:31,325 INFO L129 PetriNetUnfolder]: 127/1067 cut-off events. [2021-12-06 22:52:31,325 INFO L130 PetriNetUnfolder]: For 321/323 co-relation queries the response was YES. [2021-12-06 22:52:31,327 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1659 conditions, 1067 events. 127/1067 cut-off events. For 321/323 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4977 event pairs, 42 based on Foata normal form. 15/997 useless extension candidates. Maximal degree in co-relation 1650. Up to 219 conditions per place. [2021-12-06 22:52:31,331 INFO L132 encePairwiseOnDemand]: 255/265 looper letters, 75 selfloop transitions, 12 changer transitions 0/262 dead transitions. [2021-12-06 22:52:31,331 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 262 transitions, 794 flow [2021-12-06 22:52:31,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 22:52:31,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-06 22:52:31,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1869 transitions. [2021-12-06 22:52:31,336 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7836477987421384 [2021-12-06 22:52:31,336 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1869 transitions. [2021-12-06 22:52:31,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1869 transitions. [2021-12-06 22:52:31,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:52:31,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1869 transitions. [2021-12-06 22:52:31,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 207.66666666666666) internal successors, (1869), 9 states have internal predecessors, (1869), 0 states have call successors, (0), 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-12-06 22:52:31,345 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 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-12-06 22:52:31,346 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 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-12-06 22:52:31,346 INFO L186 Difference]: Start difference. First operand has 240 places, 233 transitions, 540 flow. Second operand 9 states and 1869 transitions. [2021-12-06 22:52:31,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 262 transitions, 794 flow [2021-12-06 22:52:31,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 262 transitions, 785 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-12-06 22:52:31,352 INFO L242 Difference]: Finished difference. Result has 247 places, 237 transitions, 575 flow [2021-12-06 22:52:31,352 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=575, PETRI_PLACES=247, PETRI_TRANSITIONS=237} [2021-12-06 22:52:31,353 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 8 predicate places. [2021-12-06 22:52:31,353 INFO L470 AbstractCegarLoop]: Abstraction has has 247 places, 237 transitions, 575 flow [2021-12-06 22:52:31,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 0 states have call successors, (0), 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-12-06 22:52:31,354 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:52:31,354 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-12-06 22:52:31,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-06 22:52:31,354 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-12-06 22:52:31,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:52:31,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1769428669, now seen corresponding path program 1 times [2021-12-06 22:52:31,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:52:31,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177752763] [2021-12-06 22:52:31,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:52:31,355 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:52:31,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:31,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 22:52:31,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:52:31,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177752763] [2021-12-06 22:52:31,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177752763] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:52:31,519 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:52:31,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 22:52:31,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416245415] [2021-12-06 22:52:31,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:52:31,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 22:52:31,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:52:31,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 22:52:31,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-06 22:52:31,522 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 265 [2021-12-06 22:52:31,524 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 237 transitions, 575 flow. Second operand has 8 states, 8 states have (on average 193.25) internal successors, (1546), 8 states have internal predecessors, (1546), 0 states have call successors, (0), 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-12-06 22:52:31,524 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:52:31,524 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 265 [2021-12-06 22:52:31,524 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:52:32,949 INFO L129 PetriNetUnfolder]: 3272/9314 cut-off events. [2021-12-06 22:52:32,949 INFO L130 PetriNetUnfolder]: For 2799/2802 co-relation queries the response was YES. [2021-12-06 22:52:32,974 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16569 conditions, 9314 events. 3272/9314 cut-off events. For 2799/2802 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 87639 event pairs, 1597 based on Foata normal form. 0/7843 useless extension candidates. Maximal degree in co-relation 16558. Up to 1850 conditions per place. [2021-12-06 22:52:33,010 INFO L132 encePairwiseOnDemand]: 254/265 looper letters, 117 selfloop transitions, 11 changer transitions 0/291 dead transitions. [2021-12-06 22:52:33,010 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 291 transitions, 998 flow [2021-12-06 22:52:33,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 22:52:33,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-06 22:52:33,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1795 transitions. [2021-12-06 22:52:33,015 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7526205450733753 [2021-12-06 22:52:33,015 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1795 transitions. [2021-12-06 22:52:33,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1795 transitions. [2021-12-06 22:52:33,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:52:33,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1795 transitions. [2021-12-06 22:52:33,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 199.44444444444446) internal successors, (1795), 9 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:52:33,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 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-12-06 22:52:33,024 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 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-12-06 22:52:33,024 INFO L186 Difference]: Start difference. First operand has 247 places, 237 transitions, 575 flow. Second operand 9 states and 1795 transitions. [2021-12-06 22:52:33,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 291 transitions, 998 flow [2021-12-06 22:52:33,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 291 transitions, 987 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-12-06 22:52:33,031 INFO L242 Difference]: Finished difference. Result has 255 places, 240 transitions, 606 flow [2021-12-06 22:52:33,031 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=606, PETRI_PLACES=255, PETRI_TRANSITIONS=240} [2021-12-06 22:52:33,032 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 16 predicate places. [2021-12-06 22:52:33,032 INFO L470 AbstractCegarLoop]: Abstraction has has 255 places, 240 transitions, 606 flow [2021-12-06 22:52:33,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 193.25) internal successors, (1546), 8 states have internal predecessors, (1546), 0 states have call successors, (0), 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-12-06 22:52:33,032 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:52:33,033 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-12-06 22:52:33,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 22:52:33,033 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-12-06 22:52:33,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:52:33,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1581181163, now seen corresponding path program 1 times [2021-12-06 22:52:33,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:52:33,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306685315] [2021-12-06 22:52:33,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:52:33,034 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:52:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:33,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 22:52:33,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:52:33,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306685315] [2021-12-06 22:52:33,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306685315] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:52:33,179 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:52:33,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 22:52:33,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098357781] [2021-12-06 22:52:33,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:52:33,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 22:52:33,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:52:33,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 22:52:33,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-06 22:52:33,182 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 265 [2021-12-06 22:52:33,183 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 240 transitions, 606 flow. Second operand has 8 states, 8 states have (on average 193.25) internal successors, (1546), 8 states have internal predecessors, (1546), 0 states have call successors, (0), 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-12-06 22:52:33,183 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:52:33,183 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 265 [2021-12-06 22:52:33,183 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:52:34,210 INFO L129 PetriNetUnfolder]: 2420/7206 cut-off events. [2021-12-06 22:52:34,210 INFO L130 PetriNetUnfolder]: For 2888/2926 co-relation queries the response was YES. [2021-12-06 22:52:34,227 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13425 conditions, 7206 events. 2420/7206 cut-off events. For 2888/2926 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 63264 event pairs, 1207 based on Foata normal form. 0/6226 useless extension candidates. Maximal degree in co-relation 13411. Up to 1609 conditions per place. [2021-12-06 22:52:34,247 INFO L132 encePairwiseOnDemand]: 254/265 looper letters, 87 selfloop transitions, 9 changer transitions 21/280 dead transitions. [2021-12-06 22:52:34,247 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 280 transitions, 960 flow [2021-12-06 22:52:34,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 22:52:34,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-06 22:52:34,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1788 transitions. [2021-12-06 22:52:34,251 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7496855345911949 [2021-12-06 22:52:34,251 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1788 transitions. [2021-12-06 22:52:34,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1788 transitions. [2021-12-06 22:52:34,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:52:34,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1788 transitions. [2021-12-06 22:52:34,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 198.66666666666666) internal successors, (1788), 9 states have internal predecessors, (1788), 0 states have call successors, (0), 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-12-06 22:52:34,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 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-12-06 22:52:34,261 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 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-12-06 22:52:34,261 INFO L186 Difference]: Start difference. First operand has 255 places, 240 transitions, 606 flow. Second operand 9 states and 1788 transitions. [2021-12-06 22:52:34,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 280 transitions, 960 flow [2021-12-06 22:52:34,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 280 transitions, 944 flow, removed 0 selfloop flow, removed 5 redundant places. [2021-12-06 22:52:34,268 INFO L242 Difference]: Finished difference. Result has 260 places, 238 transitions, 602 flow [2021-12-06 22:52:34,268 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=602, PETRI_PLACES=260, PETRI_TRANSITIONS=238} [2021-12-06 22:52:34,269 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 21 predicate places. [2021-12-06 22:52:34,269 INFO L470 AbstractCegarLoop]: Abstraction has has 260 places, 238 transitions, 602 flow [2021-12-06 22:52:34,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 193.25) internal successors, (1546), 8 states have internal predecessors, (1546), 0 states have call successors, (0), 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-12-06 22:52:34,270 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:52:34,270 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:52:34,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 22:52:34,270 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-12-06 22:52:34,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:52:34,270 INFO L85 PathProgramCache]: Analyzing trace with hash 670833297, now seen corresponding path program 1 times [2021-12-06 22:52:34,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:52:34,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367473995] [2021-12-06 22:52:34,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:52:34,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:52:34,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:34,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 22:52:34,422 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:52:34,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367473995] [2021-12-06 22:52:34,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367473995] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:52:34,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276864741] [2021-12-06 22:52:34,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:52:34,423 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:52:34,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d299df2e-6549-4cac-a254-e87ff9d9c3a2/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:52:34,424 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d299df2e-6549-4cac-a254-e87ff9d9c3a2/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:52:34,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d299df2e-6549-4cac-a254-e87ff9d9c3a2/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 22:52:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:34,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-06 22:52:34,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:52:34,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 22:52:34,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:52:35,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 22:52:35,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276864741] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-06 22:52:35,398 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-06 22:52:35,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9, 8] total 22 [2021-12-06 22:52:35,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4040524] [2021-12-06 22:52:35,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:52:35,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 22:52:35,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:52:35,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 22:52:35,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2021-12-06 22:52:35,403 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 265 [2021-12-06 22:52:35,405 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 238 transitions, 602 flow. Second operand has 10 states, 10 states have (on average 186.9) internal successors, (1869), 10 states have internal predecessors, (1869), 0 states have call successors, (0), 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-12-06 22:52:35,406 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:52:35,406 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 265 [2021-12-06 22:52:35,406 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:52:36,661 INFO L129 PetriNetUnfolder]: 3111/6652 cut-off events. [2021-12-06 22:52:36,661 INFO L130 PetriNetUnfolder]: For 3365/3381 co-relation queries the response was YES. [2021-12-06 22:52:36,683 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14591 conditions, 6652 events. 3111/6652 cut-off events. For 3365/3381 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 46322 event pairs, 179 based on Foata normal form. 200/6442 useless extension candidates. Maximal degree in co-relation 14575. Up to 885 conditions per place. [2021-12-06 22:52:36,712 INFO L132 encePairwiseOnDemand]: 246/265 looper letters, 156 selfloop transitions, 39 changer transitions 3/355 dead transitions. [2021-12-06 22:52:36,713 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 355 transitions, 1383 flow [2021-12-06 22:52:36,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-06 22:52:36,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2021-12-06 22:52:36,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3802 transitions. [2021-12-06 22:52:36,724 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7173584905660377 [2021-12-06 22:52:36,725 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3802 transitions. [2021-12-06 22:52:36,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3802 transitions. [2021-12-06 22:52:36,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:52:36,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3802 transitions. [2021-12-06 22:52:36,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 190.1) internal successors, (3802), 20 states have internal predecessors, (3802), 0 states have call successors, (0), 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-12-06 22:52:36,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 265.0) internal successors, (5565), 21 states have internal predecessors, (5565), 0 states have call successors, (0), 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-12-06 22:52:36,744 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 265.0) internal successors, (5565), 21 states have internal predecessors, (5565), 0 states have call successors, (0), 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-12-06 22:52:36,745 INFO L186 Difference]: Start difference. First operand has 260 places, 238 transitions, 602 flow. Second operand 20 states and 3802 transitions. [2021-12-06 22:52:36,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 355 transitions, 1383 flow [2021-12-06 22:52:36,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 355 transitions, 1335 flow, removed 14 selfloop flow, removed 10 redundant places. [2021-12-06 22:52:36,758 INFO L242 Difference]: Finished difference. Result has 276 places, 256 transitions, 790 flow [2021-12-06 22:52:36,759 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=790, PETRI_PLACES=276, PETRI_TRANSITIONS=256} [2021-12-06 22:52:36,759 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 37 predicate places. [2021-12-06 22:52:36,759 INFO L470 AbstractCegarLoop]: Abstraction has has 276 places, 256 transitions, 790 flow [2021-12-06 22:52:36,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 186.9) internal successors, (1869), 10 states have internal predecessors, (1869), 0 states have call successors, (0), 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-12-06 22:52:36,760 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:52:36,760 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:52:36,793 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d299df2e-6549-4cac-a254-e87ff9d9c3a2/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 22:52:36,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d299df2e-6549-4cac-a254-e87ff9d9c3a2/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:52:36,961 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-12-06 22:52:36,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:52:36,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1881327333, now seen corresponding path program 1 times [2021-12-06 22:52:36,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:52:36,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742313047] [2021-12-06 22:52:36,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:52:36,962 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:52:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:37,138 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 22:52:37,139 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:52:37,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742313047] [2021-12-06 22:52:37,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742313047] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:52:37,139 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:52:37,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 22:52:37,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421138145] [2021-12-06 22:52:37,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:52:37,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 22:52:37,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:52:37,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 22:52:37,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-12-06 22:52:37,144 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 265 [2021-12-06 22:52:37,146 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 256 transitions, 790 flow. Second operand has 10 states, 10 states have (on average 192.3) internal successors, (1923), 10 states have internal predecessors, (1923), 0 states have call successors, (0), 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-12-06 22:52:37,147 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:52:37,147 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 265 [2021-12-06 22:52:37,147 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:52:37,992 INFO L129 PetriNetUnfolder]: 2524/4881 cut-off events. [2021-12-06 22:52:37,992 INFO L130 PetriNetUnfolder]: For 7142/7150 co-relation queries the response was YES. [2021-12-06 22:52:38,008 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13156 conditions, 4881 events. 2524/4881 cut-off events. For 7142/7150 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 32402 event pairs, 238 based on Foata normal form. 8/4544 useless extension candidates. Maximal degree in co-relation 13134. Up to 2051 conditions per place. [2021-12-06 22:52:38,025 INFO L132 encePairwiseOnDemand]: 256/265 looper letters, 113 selfloop transitions, 11 changer transitions 3/297 dead transitions. [2021-12-06 22:52:38,026 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 297 transitions, 1218 flow [2021-12-06 22:52:38,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 22:52:38,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-06 22:52:38,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1782 transitions. [2021-12-06 22:52:38,030 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7471698113207547 [2021-12-06 22:52:38,030 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1782 transitions. [2021-12-06 22:52:38,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1782 transitions. [2021-12-06 22:52:38,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:52:38,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1782 transitions. [2021-12-06 22:52:38,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 198.0) internal successors, (1782), 9 states have internal predecessors, (1782), 0 states have call successors, (0), 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-12-06 22:52:38,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 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-12-06 22:52:38,037 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 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-12-06 22:52:38,037 INFO L186 Difference]: Start difference. First operand has 276 places, 256 transitions, 790 flow. Second operand 9 states and 1782 transitions. [2021-12-06 22:52:38,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 297 transitions, 1218 flow [2021-12-06 22:52:38,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 297 transitions, 1157 flow, removed 10 selfloop flow, removed 10 redundant places. [2021-12-06 22:52:38,058 INFO L242 Difference]: Finished difference. Result has 274 places, 254 transitions, 763 flow [2021-12-06 22:52:38,059 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=763, PETRI_PLACES=274, PETRI_TRANSITIONS=254} [2021-12-06 22:52:38,059 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 35 predicate places. [2021-12-06 22:52:38,060 INFO L470 AbstractCegarLoop]: Abstraction has has 274 places, 254 transitions, 763 flow [2021-12-06 22:52:38,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 192.3) internal successors, (1923), 10 states have internal predecessors, (1923), 0 states have call successors, (0), 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-12-06 22:52:38,060 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:52:38,060 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:52:38,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-06 22:52:38,060 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-12-06 22:52:38,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:52:38,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1816174413, now seen corresponding path program 1 times [2021-12-06 22:52:38,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:52:38,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753034893] [2021-12-06 22:52:38,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:52:38,061 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:52:38,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:38,264 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 22:52:38,264 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:52:38,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753034893] [2021-12-06 22:52:38,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753034893] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:52:38,264 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:52:38,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 22:52:38,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986559501] [2021-12-06 22:52:38,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:52:38,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 22:52:38,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:52:38,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 22:52:38,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-12-06 22:52:38,267 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 265 [2021-12-06 22:52:38,268 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 254 transitions, 763 flow. Second operand has 9 states, 9 states have (on average 190.0) internal successors, (1710), 9 states have internal predecessors, (1710), 0 states have call successors, (0), 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-12-06 22:52:38,268 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:52:38,268 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 265 [2021-12-06 22:52:38,268 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:52:39,088 INFO L129 PetriNetUnfolder]: 2482/4818 cut-off events. [2021-12-06 22:52:39,088 INFO L130 PetriNetUnfolder]: For 9432/9432 co-relation queries the response was YES. [2021-12-06 22:52:39,105 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13678 conditions, 4818 events. 2482/4818 cut-off events. For 9432/9432 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 31853 event pairs, 878 based on Foata normal form. 98/4643 useless extension candidates. Maximal degree in co-relation 13654. Up to 2304 conditions per place. [2021-12-06 22:52:39,126 INFO L132 encePairwiseOnDemand]: 256/265 looper letters, 118 selfloop transitions, 15 changer transitions 0/295 dead transitions. [2021-12-06 22:52:39,126 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 295 transitions, 1235 flow [2021-12-06 22:52:39,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 22:52:39,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-06 22:52:39,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1751 transitions. [2021-12-06 22:52:39,130 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7341719077568134 [2021-12-06 22:52:39,130 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1751 transitions. [2021-12-06 22:52:39,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1751 transitions. [2021-12-06 22:52:39,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:52:39,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1751 transitions. [2021-12-06 22:52:39,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 194.55555555555554) internal successors, (1751), 9 states have internal predecessors, (1751), 0 states have call successors, (0), 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-12-06 22:52:39,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 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-12-06 22:52:39,137 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 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-12-06 22:52:39,137 INFO L186 Difference]: Start difference. First operand has 274 places, 254 transitions, 763 flow. Second operand 9 states and 1751 transitions. [2021-12-06 22:52:39,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 295 transitions, 1235 flow [2021-12-06 22:52:39,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 295 transitions, 1171 flow, removed 8 selfloop flow, removed 12 redundant places. [2021-12-06 22:52:39,156 INFO L242 Difference]: Finished difference. Result has 270 places, 259 transitions, 805 flow [2021-12-06 22:52:39,157 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=805, PETRI_PLACES=270, PETRI_TRANSITIONS=259} [2021-12-06 22:52:39,157 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 31 predicate places. [2021-12-06 22:52:39,157 INFO L470 AbstractCegarLoop]: Abstraction has has 270 places, 259 transitions, 805 flow [2021-12-06 22:52:39,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 190.0) internal successors, (1710), 9 states have internal predecessors, (1710), 0 states have call successors, (0), 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-12-06 22:52:39,158 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:52:39,158 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:52:39,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-06 22:52:39,158 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-12-06 22:52:39,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:52:39,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1236904163, now seen corresponding path program 2 times [2021-12-06 22:52:39,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:52:39,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467795424] [2021-12-06 22:52:39,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:52:39,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:52:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:39,261 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 22:52:39,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:52:39,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467795424] [2021-12-06 22:52:39,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467795424] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:52:39,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536622414] [2021-12-06 22:52:39,261 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 22:52:39,261 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:52:39,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d299df2e-6549-4cac-a254-e87ff9d9c3a2/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:52:39,262 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d299df2e-6549-4cac-a254-e87ff9d9c3a2/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:52:39,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d299df2e-6549-4cac-a254-e87ff9d9c3a2/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 22:52:39,361 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 22:52:39,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 22:52:39,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 22:52:39,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:52:39,592 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 22:52:39,592 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 22:52:39,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536622414] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:52:39,593 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 22:52:39,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2021-12-06 22:52:39,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288772446] [2021-12-06 22:52:39,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:52:39,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 22:52:39,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:52:39,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 22:52:39,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-06 22:52:39,595 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 265 [2021-12-06 22:52:39,596 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 259 transitions, 805 flow. Second operand has 5 states, 5 states have (on average 232.4) internal successors, (1162), 5 states have internal predecessors, (1162), 0 states have call successors, (0), 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-12-06 22:52:39,596 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:52:39,596 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 265 [2021-12-06 22:52:39,596 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:52:40,069 INFO L129 PetriNetUnfolder]: 1011/2489 cut-off events. [2021-12-06 22:52:40,070 INFO L130 PetriNetUnfolder]: For 5860/5905 co-relation queries the response was YES. [2021-12-06 22:52:40,083 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7388 conditions, 2489 events. 1011/2489 cut-off events. For 5860/5905 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 16227 event pairs, 81 based on Foata normal form. 36/2415 useless extension candidates. Maximal degree in co-relation 7365. Up to 567 conditions per place. [2021-12-06 22:52:40,098 INFO L132 encePairwiseOnDemand]: 259/265 looper letters, 63 selfloop transitions, 23 changer transitions 0/303 dead transitions. [2021-12-06 22:52:40,098 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 303 transitions, 1207 flow [2021-12-06 22:52:40,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 22:52:40,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-06 22:52:40,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1425 transitions. [2021-12-06 22:52:40,102 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8962264150943396 [2021-12-06 22:52:40,102 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1425 transitions. [2021-12-06 22:52:40,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1425 transitions. [2021-12-06 22:52:40,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:52:40,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1425 transitions. [2021-12-06 22:52:40,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 237.5) internal successors, (1425), 6 states have internal predecessors, (1425), 0 states have call successors, (0), 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-12-06 22:52:40,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 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-12-06 22:52:40,108 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 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-12-06 22:52:40,108 INFO L186 Difference]: Start difference. First operand has 270 places, 259 transitions, 805 flow. Second operand 6 states and 1425 transitions. [2021-12-06 22:52:40,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 303 transitions, 1207 flow [2021-12-06 22:52:40,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 303 transitions, 1190 flow, removed 1 selfloop flow, removed 5 redundant places. [2021-12-06 22:52:40,120 INFO L242 Difference]: Finished difference. Result has 274 places, 271 transitions, 984 flow [2021-12-06 22:52:40,120 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=789, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=984, PETRI_PLACES=274, PETRI_TRANSITIONS=271} [2021-12-06 22:52:40,121 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 35 predicate places. [2021-12-06 22:52:40,121 INFO L470 AbstractCegarLoop]: Abstraction has has 274 places, 271 transitions, 984 flow [2021-12-06 22:52:40,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 232.4) internal successors, (1162), 5 states have internal predecessors, (1162), 0 states have call successors, (0), 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-12-06 22:52:40,121 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:52:40,121 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:52:40,155 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d299df2e-6549-4cac-a254-e87ff9d9c3a2/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-06 22:52:40,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d299df2e-6549-4cac-a254-e87ff9d9c3a2/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:52:40,324 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-12-06 22:52:40,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:52:40,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1753312695, now seen corresponding path program 1 times [2021-12-06 22:52:40,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:52:40,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962285052] [2021-12-06 22:52:40,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:52:40,327 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:52:40,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:40,443 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 22:52:40,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:52:40,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962285052] [2021-12-06 22:52:40,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962285052] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:52:40,444 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:52:40,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 22:52:40,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262401737] [2021-12-06 22:52:40,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:52:40,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 22:52:40,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:52:40,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 22:52:40,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-06 22:52:40,447 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 265 [2021-12-06 22:52:40,448 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 271 transitions, 984 flow. Second operand has 5 states, 5 states have (on average 232.4) internal successors, (1162), 5 states have internal predecessors, (1162), 0 states have call successors, (0), 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-12-06 22:52:40,448 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:52:40,448 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 265 [2021-12-06 22:52:40,448 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:52:41,310 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int_88| v_~f~0.base_40) (+ v_~f~0.offset_40 (* v_~j~0_49 4))))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (+ v_~j~0_49 1) v_~j~0_48) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q2_back~0_76 2147483647) 1 0)) (not (= (ite (= (- .cse0) (select (select |v_#memory_int_88| v_~q2~0.base_31) (+ v_~q2~0.offset_31 (* v_~q2_back~0_76 4)))) 1 0) 0)) (= v_~q2_back~0_75 (+ v_~q2_back~0_76 1)) (not (= (ite (and (<= 0 v_~q2_back~0_76) (< v_~q2_back~0_76 v_~n2~0_24)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|))) InVars {~j~0=v_~j~0_49, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_88|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_76, ~f~0.offset=v_~f~0.offset_40} OutVars{~j~0=v_~j~0_48, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_40, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][263], [Black: 1725#(and (= ~j~0 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0))), Black: 1717#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 240#L118true, 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), 2412#(<= ~q1_front~0 ~q1_back~0), Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 358#true, Black: 2404#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 1733#(<= ~q2_front~0 ~q2_back~0), Black: 2402#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 2249#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), 117#L100true, Black: 294#(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: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), 38#L144-4true, 40#L79true, 115#L51-1true, Black: 311#(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|))]) [2021-12-06 22:52:41,310 INFO L384 tUnfolder$Statistics]: this new event has 198 ancestors and is cut-off event [2021-12-06 22:52:41,310 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2021-12-06 22:52:41,310 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2021-12-06 22:52:41,310 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2021-12-06 22:52:41,487 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int_88| v_~f~0.base_40) (+ v_~f~0.offset_40 (* v_~j~0_49 4))))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (+ v_~j~0_49 1) v_~j~0_48) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q2_back~0_76 2147483647) 1 0)) (not (= (ite (= (- .cse0) (select (select |v_#memory_int_88| v_~q2~0.base_31) (+ v_~q2~0.offset_31 (* v_~q2_back~0_76 4)))) 1 0) 0)) (= v_~q2_back~0_75 (+ v_~q2_back~0_76 1)) (not (= (ite (and (<= 0 v_~q2_back~0_76) (< v_~q2_back~0_76 v_~n2~0_24)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|))) InVars {~j~0=v_~j~0_49, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_88|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_76, ~f~0.offset=v_~f~0.offset_40} OutVars{~j~0=v_~j~0_48, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_40, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][263], [Black: 1725#(and (= ~j~0 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0))), Black: 1717#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 240#L118true, 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), 2412#(<= ~q1_front~0 ~q1_back~0), Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 282#(<= ~q2_back~0 ~q2_front~0), 358#true, Black: 2404#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 1733#(<= ~q2_front~0 ~q2_back~0), Black: 2402#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), 2249#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 294#(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|)), 38#L144-4true, 115#L51-1true, 40#L79true, Black: 311#(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|))]) [2021-12-06 22:52:41,487 INFO L384 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2021-12-06 22:52:41,487 INFO L387 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2021-12-06 22:52:41,487 INFO L387 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2021-12-06 22:52:41,487 INFO L387 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2021-12-06 22:52:41,488 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int_88| v_~f~0.base_40) (+ v_~f~0.offset_40 (* v_~j~0_49 4))))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (+ v_~j~0_49 1) v_~j~0_48) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q2_back~0_76 2147483647) 1 0)) (not (= (ite (= (- .cse0) (select (select |v_#memory_int_88| v_~q2~0.base_31) (+ v_~q2~0.offset_31 (* v_~q2_back~0_76 4)))) 1 0) 0)) (= v_~q2_back~0_75 (+ v_~q2_back~0_76 1)) (not (= (ite (and (<= 0 v_~q2_back~0_76) (< v_~q2_back~0_76 v_~n2~0_24)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|))) InVars {~j~0=v_~j~0_49, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_88|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_76, ~f~0.offset=v_~f~0.offset_40} OutVars{~j~0=v_~j~0_48, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_40, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][263], [111#L92-1true, Black: 1725#(and (= ~j~0 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0))), Black: 1717#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 240#L118true, 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), 2412#(<= ~q1_front~0 ~q1_back~0), Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 358#true, Black: 2404#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 1733#(<= ~q2_front~0 ~q2_back~0), Black: 2402#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), 2249#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 294#(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: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), 38#L144-4true, 115#L51-1true, 40#L79true, Black: 311#(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|))]) [2021-12-06 22:52:41,488 INFO L384 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2021-12-06 22:52:41,488 INFO L387 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2021-12-06 22:52:41,488 INFO L387 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2021-12-06 22:52:41,488 INFO L387 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2021-12-06 22:52:41,605 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1001] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int_88| v_~f~0.base_40) (+ v_~f~0.offset_40 (* v_~j~0_49 4))))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (+ v_~j~0_49 1) v_~j~0_48) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q2_back~0_76 2147483647) 1 0)) (not (= (ite (= (- .cse0) (select (select |v_#memory_int_88| v_~q2~0.base_31) (+ v_~q2~0.offset_31 (* v_~q2_back~0_76 4)))) 1 0) 0)) (= v_~q2_back~0_75 (+ v_~q2_back~0_76 1)) (not (= (ite (and (<= 0 v_~q2_back~0_76) (< v_~q2_back~0_76 v_~n2~0_24)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|))) InVars {~j~0=v_~j~0_49, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_88|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_76, ~f~0.offset=v_~f~0.offset_40} OutVars{~j~0=v_~j~0_48, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_40, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][263], [Black: 1725#(and (= ~j~0 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0))), Black: 1717#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 240#L118true, 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), 2412#(<= ~q1_front~0 ~q1_back~0), Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 358#true, Black: 2404#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 1733#(<= ~q2_front~0 ~q2_back~0), Black: 2402#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 117#L100true, 2249#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 294#(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|)), 38#L144-4true, 40#L79true, 115#L51-1true, Black: 311#(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|))]) [2021-12-06 22:52:41,605 INFO L384 tUnfolder$Statistics]: this new event has 201 ancestors and is cut-off event [2021-12-06 22:52:41,606 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2021-12-06 22:52:41,606 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2021-12-06 22:52:41,606 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2021-12-06 22:52:41,606 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2021-12-06 22:52:41,857 INFO L129 PetriNetUnfolder]: 4140/9537 cut-off events. [2021-12-06 22:52:41,857 INFO L130 PetriNetUnfolder]: For 48231/48456 co-relation queries the response was YES. [2021-12-06 22:52:41,907 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34658 conditions, 9537 events. 4140/9537 cut-off events. For 48231/48456 co-relation queries the response was YES. Maximal size of possible extension queue 608. Compared 88025 event pairs, 631 based on Foata normal form. 194/8866 useless extension candidates. Maximal degree in co-relation 34631. Up to 2375 conditions per place. [2021-12-06 22:52:41,952 INFO L132 encePairwiseOnDemand]: 259/265 looper letters, 105 selfloop transitions, 13 changer transitions 0/343 dead transitions. [2021-12-06 22:52:41,953 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 343 transitions, 1871 flow [2021-12-06 22:52:41,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 22:52:41,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-06 22:52:41,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1426 transitions. [2021-12-06 22:52:41,956 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8968553459119497 [2021-12-06 22:52:41,956 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1426 transitions. [2021-12-06 22:52:41,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1426 transitions. [2021-12-06 22:52:41,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:52:41,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1426 transitions. [2021-12-06 22:52:41,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 237.66666666666666) internal successors, (1426), 6 states have internal predecessors, (1426), 0 states have call successors, (0), 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-12-06 22:52:41,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 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-12-06 22:52:41,961 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 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-12-06 22:52:41,961 INFO L186 Difference]: Start difference. First operand has 274 places, 271 transitions, 984 flow. Second operand 6 states and 1426 transitions. [2021-12-06 22:52:41,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 343 transitions, 1871 flow [2021-12-06 22:52:42,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 343 transitions, 1830 flow, removed 14 selfloop flow, removed 2 redundant places. [2021-12-06 22:52:42,021 INFO L242 Difference]: Finished difference. Result has 281 places, 279 transitions, 1064 flow [2021-12-06 22:52:42,021 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=967, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1064, PETRI_PLACES=281, PETRI_TRANSITIONS=279} [2021-12-06 22:52:42,021 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 42 predicate places. [2021-12-06 22:52:42,022 INFO L470 AbstractCegarLoop]: Abstraction has has 281 places, 279 transitions, 1064 flow [2021-12-06 22:52:42,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 232.4) internal successors, (1162), 5 states have internal predecessors, (1162), 0 states have call successors, (0), 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-12-06 22:52:42,022 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:52:42,022 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:52:42,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-06 22:52:42,022 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-06 22:52:42,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:52:42,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1022434713, now seen corresponding path program 2 times [2021-12-06 22:52:42,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:52:42,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547419115] [2021-12-06 22:52:42,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:52:42,023 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:52:42,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:42,177 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 22:52:42,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:52:42,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547419115] [2021-12-06 22:52:42,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547419115] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:52:42,178 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:52:42,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 22:52:42,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146115147] [2021-12-06 22:52:42,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:52:42,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 22:52:42,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:52:42,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 22:52:42,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-12-06 22:52:42,181 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 265 [2021-12-06 22:52:42,183 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 279 transitions, 1064 flow. Second operand has 9 states, 9 states have (on average 190.0) internal successors, (1710), 9 states have internal predecessors, (1710), 0 states have call successors, (0), 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-12-06 22:52:42,183 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:52:42,183 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 265 [2021-12-06 22:52:42,183 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:52:45,149 INFO L129 PetriNetUnfolder]: 9944/18535 cut-off events. [2021-12-06 22:52:45,149 INFO L130 PetriNetUnfolder]: For 72374/72393 co-relation queries the response was YES. [2021-12-06 22:52:45,257 INFO L84 FinitePrefix]: Finished finitePrefix Result has 67303 conditions, 18535 events. 9944/18535 cut-off events. For 72374/72393 co-relation queries the response was YES. Maximal size of possible extension queue 850. Compared 157309 event pairs, 3527 based on Foata normal form. 287/18323 useless extension candidates. Maximal degree in co-relation 67273. Up to 9795 conditions per place. [2021-12-06 22:52:45,362 INFO L132 encePairwiseOnDemand]: 256/265 looper letters, 193 selfloop transitions, 14 changer transitions 0/372 dead transitions. [2021-12-06 22:52:45,363 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 372 transitions, 2244 flow [2021-12-06 22:52:45,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 22:52:45,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-06 22:52:45,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1751 transitions. [2021-12-06 22:52:45,368 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7341719077568134 [2021-12-06 22:52:45,368 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1751 transitions. [2021-12-06 22:52:45,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1751 transitions. [2021-12-06 22:52:45,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:52:45,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1751 transitions. [2021-12-06 22:52:45,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 194.55555555555554) internal successors, (1751), 9 states have internal predecessors, (1751), 0 states have call successors, (0), 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-12-06 22:52:45,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 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-12-06 22:52:45,376 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 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-12-06 22:52:45,376 INFO L186 Difference]: Start difference. First operand has 281 places, 279 transitions, 1064 flow. Second operand 9 states and 1751 transitions. [2021-12-06 22:52:45,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 372 transitions, 2244 flow [2021-12-06 22:52:45,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 372 transitions, 2241 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-12-06 22:52:45,590 INFO L242 Difference]: Finished difference. Result has 290 places, 284 transitions, 1149 flow [2021-12-06 22:52:45,590 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=1061, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1149, PETRI_PLACES=290, PETRI_TRANSITIONS=284} [2021-12-06 22:52:45,591 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 51 predicate places. [2021-12-06 22:52:45,591 INFO L470 AbstractCegarLoop]: Abstraction has has 290 places, 284 transitions, 1149 flow [2021-12-06 22:52:45,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 190.0) internal successors, (1710), 9 states have internal predecessors, (1710), 0 states have call successors, (0), 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-12-06 22:52:45,591 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:52:45,592 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:52:45,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-06 22:52:45,592 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-06 22:52:45,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:52:45,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1931958788, now seen corresponding path program 1 times [2021-12-06 22:52:45,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:52:45,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875817636] [2021-12-06 22:52:45,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:52:45,593 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:52:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:50,841 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:52:50,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:52:50,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875817636] [2021-12-06 22:52:50,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875817636] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:52:50,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484549751] [2021-12-06 22:52:50,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:52:50,842 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:52:50,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d299df2e-6549-4cac-a254-e87ff9d9c3a2/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:52:50,842 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d299df2e-6549-4cac-a254-e87ff9d9c3a2/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:52:50,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d299df2e-6549-4cac-a254-e87ff9d9c3a2/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-06 22:52:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:50,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 133 conjunts are in the unsatisfiable core [2021-12-06 22:52:50,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:52:51,039 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-12-06 22:52:51,122 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:52:51,123 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-12-06 22:52:52,190 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-12-06 22:52:52,190 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 5 case distinctions, treesize of input 22 treesize of output 33 [2021-12-06 22:52:54,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 22:52:54,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 22:52:54,653 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-06 22:52:54,653 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 22 [2021-12-06 22:52:55,274 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 15 treesize of output 11 [2021-12-06 22:52:57,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 22:52:57,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 22:52:57,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 22:52:57,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 22:52:57,775 INFO L354 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2021-12-06 22:52:57,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 17 [2021-12-06 22:52:58,521 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 22:53:00,344 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 6 treesize of output 5 [2021-12-06 22:53:00,690 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 6 treesize of output 5 [2021-12-06 22:53:01,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 22:53:01,312 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-06 22:53:01,312 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 27 [2021-12-06 22:53:01,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 22:53:01,664 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-06 22:53:01,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 27 [2021-12-06 22:53:04,065 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 22:53:04,065 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 22:53:04,082 INFO L354 Elim1Store]: treesize reduction 83, result has 23.1 percent of original size [2021-12-06 22:53:04,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 50 treesize of output 38 [2021-12-06 22:53:04,144 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 22:53:04,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:53:26,143 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:53:26,143 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 289 treesize of output 205 [2021-12-06 22:53:26,378 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:53:26,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 5484762 treesize of output 5401926 [2021-12-06 22:53:40,214 WARN L227 SmtUtils]: Spent 13.82s on a formula simplification that was a NOOP. DAG size: 4195 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-06 22:53:40,482 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:53:40,487 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 5378020 treesize of output 4821054 [2021-12-06 22:53:54,344 WARN L227 SmtUtils]: Spent 13.85s on a formula simplification that was a NOOP. DAG size: 4215 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-06 22:53:54,601 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:53:54,605 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4820964 treesize of output 3706942 [2021-12-06 22:54:08,183 WARN L227 SmtUtils]: Spent 13.57s on a formula simplification that was a NOOP. DAG size: 4232 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-06 22:54:08,559 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:54:08,564 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 3730650 treesize of output 3447222 [2021-12-06 22:54:22,357 WARN L227 SmtUtils]: Spent 13.79s on a formula simplification that was a NOOP. DAG size: 4280 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-06 22:54:22,721 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:54:22,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 3447002 treesize of output 3367606 [2021-12-06 22:54:36,726 WARN L227 SmtUtils]: Spent 14.00s on a formula simplification that was a NOOP. DAG size: 4322 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-06 22:54:37,158 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:54:37,163 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 3367386 treesize of output 3225782 [2021-12-06 22:54:51,329 WARN L227 SmtUtils]: Spent 14.16s on a formula simplification that was a NOOP. DAG size: 4364 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-06 22:54:51,382 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-06 22:54:51,382 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-06 22:54:51,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2021-12-06 22:54:51,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081669970] [2021-12-06 22:54:51,382 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-06 22:54:51,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-12-06 22:54:51,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:54:51,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-06 22:54:51,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1068, Invalid=10432, Unknown=56, NotChecked=0, Total=11556 [2021-12-06 22:54:51,390 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 265 [2021-12-06 22:54:51,392 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 284 transitions, 1149 flow. Second operand has 50 states, 50 states have (on average 95.8) internal successors, (4790), 50 states have internal predecessors, (4790), 0 states have call successors, (0), 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-12-06 22:54:51,392 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:54:51,392 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 265 [2021-12-06 22:54:51,392 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:55:09,071 INFO L129 PetriNetUnfolder]: 21639/39558 cut-off events. [2021-12-06 22:55:09,071 INFO L130 PetriNetUnfolder]: For 167130/167156 co-relation queries the response was YES. [2021-12-06 22:55:09,334 INFO L84 FinitePrefix]: Finished finitePrefix Result has 148261 conditions, 39558 events. 21639/39558 cut-off events. For 167130/167156 co-relation queries the response was YES. Maximal size of possible extension queue 1693. Compared 360351 event pairs, 4109 based on Foata normal form. 16/38590 useless extension candidates. Maximal degree in co-relation 148229. Up to 17300 conditions per place. [2021-12-06 22:55:09,523 INFO L132 encePairwiseOnDemand]: 204/265 looper letters, 389 selfloop transitions, 112 changer transitions 4/596 dead transitions. [2021-12-06 22:55:09,523 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 596 transitions, 3729 flow [2021-12-06 22:55:09,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-12-06 22:55:09,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2021-12-06 22:55:09,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 6161 transitions. [2021-12-06 22:55:09,530 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.374984783931832 [2021-12-06 22:55:09,530 INFO L72 ComplementDD]: Start complementDD. Operand 62 states and 6161 transitions. [2021-12-06 22:55:09,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 6161 transitions. [2021-12-06 22:55:09,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:55:09,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 62 states and 6161 transitions. [2021-12-06 22:55:09,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 63 states, 62 states have (on average 99.37096774193549) internal successors, (6161), 62 states have internal predecessors, (6161), 0 states have call successors, (0), 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-12-06 22:55:09,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 63 states, 63 states have (on average 265.0) internal successors, (16695), 63 states have internal predecessors, (16695), 0 states have call successors, (0), 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-12-06 22:55:09,553 INFO L81 ComplementDD]: Finished complementDD. Result has 63 states, 63 states have (on average 265.0) internal successors, (16695), 63 states have internal predecessors, (16695), 0 states have call successors, (0), 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-12-06 22:55:09,553 INFO L186 Difference]: Start difference. First operand has 290 places, 284 transitions, 1149 flow. Second operand 62 states and 6161 transitions. [2021-12-06 22:55:09,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 596 transitions, 3729 flow [2021-12-06 22:55:10,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 596 transitions, 3684 flow, removed 5 selfloop flow, removed 5 redundant places. [2021-12-06 22:55:10,013 INFO L242 Difference]: Finished difference. Result has 382 places, 364 transitions, 2134 flow [2021-12-06 22:55:10,013 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=1133, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=62, PETRI_FLOW=2134, PETRI_PLACES=382, PETRI_TRANSITIONS=364} [2021-12-06 22:55:10,013 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 143 predicate places. [2021-12-06 22:55:10,013 INFO L470 AbstractCegarLoop]: Abstraction has has 382 places, 364 transitions, 2134 flow [2021-12-06 22:55:10,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 95.8) internal successors, (4790), 50 states have internal predecessors, (4790), 0 states have call successors, (0), 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-12-06 22:55:10,014 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:55:10,014 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:55:10,034 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d299df2e-6549-4cac-a254-e87ff9d9c3a2/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-06 22:55:10,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d299df2e-6549-4cac-a254-e87ff9d9c3a2/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-06 22:55:10,216 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-06 22:55:10,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:55:10,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1438155892, now seen corresponding path program 2 times [2021-12-06 22:55:10,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:55:10,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261336864] [2021-12-06 22:55:10,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:55:10,219 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:55:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:55:15,142 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:55:15,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:55:15,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261336864] [2021-12-06 22:55:15,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261336864] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:55:15,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670508670] [2021-12-06 22:55:15,143 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 22:55:15,143 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:55:15,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d299df2e-6549-4cac-a254-e87ff9d9c3a2/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:55:15,143 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d299df2e-6549-4cac-a254-e87ff9d9c3a2/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:55:15,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d299df2e-6549-4cac-a254-e87ff9d9c3a2/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-06 22:55:15,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 22:55:15,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 22:55:15,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 114 conjunts are in the unsatisfiable core [2021-12-06 22:55:15,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:55:21,242 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 11 treesize of output 7 [2021-12-06 22:55:24,132 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 6 treesize of output 5 [2021-12-06 22:55:25,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 22:55:25,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 22:55:25,541 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-06 22:55:25,542 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 27 [2021-12-06 22:55:25,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 22:55:25,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 22:55:25,914 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-06 22:55:25,915 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 27 [2021-12-06 22:55:27,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 22:55:27,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 22:55:27,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 22:55:27,397 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-12-06 22:55:27,398 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 50 [2021-12-06 22:55:28,157 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 22:55:28,158 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 22:55:28,159 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 22:55:28,180 INFO L354 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2021-12-06 22:55:28,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 42 [2021-12-06 22:55:28,214 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:55:28,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:55:31,644 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:55:31,644 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 122 [2021-12-06 22:55:31,791 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:55:31,792 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 21906 treesize of output 20870 [2021-12-06 22:55:31,929 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:55:31,930 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 20524 treesize of output 16780 [2021-12-06 22:55:32,078 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:55:32,079 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 16684 treesize of output 14860 [2021-12-06 22:55:32,321 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:55:32,322 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 14834 treesize of output 14090 [2021-12-06 22:55:32,448 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 9718 treesize of output 8182