./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 9abac63211b9980a3b9079d9eb140a85fbc6c5adec6517ed998cc9e140b19342 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 22:15:02,540 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 22:15:02,565 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 22:15:02,610 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 22:15:02,610 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 22:15:02,611 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 22:15:02,613 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 22:15:02,614 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 22:15:02,615 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 22:15:02,619 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 22:15:02,619 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 22:15:02,621 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 22:15:02,621 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 22:15:02,622 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 22:15:02,623 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 22:15:02,625 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 22:15:02,626 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 22:15:02,627 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 22:15:02,628 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 22:15:02,631 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 22:15:02,633 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 22:15:02,634 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 22:15:02,634 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 22:15:02,635 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 22:15:02,636 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 22:15:02,640 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 22:15:02,640 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 22:15:02,641 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 22:15:02,641 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 22:15:02,642 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 22:15:02,642 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 22:15:02,643 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 22:15:02,644 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 22:15:02,644 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 22:15:02,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 22:15:02,645 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 22:15:02,645 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 22:15:02,646 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 22:15:02,646 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 22:15:02,646 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 22:15:02,647 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 22:15:02,648 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 22:15:02,649 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 22:15:02,671 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 22:15:02,672 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 22:15:02,672 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 22:15:02,672 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 22:15:02,672 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 22:15:02,673 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 22:15:02,673 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 22:15:02,673 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 22:15:02,673 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 22:15:02,674 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 22:15:02,674 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 22:15:02,674 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 22:15:02,674 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 22:15:02,674 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 22:15:02,675 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 22:15:02,675 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 22:15:02,675 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 22:15:02,675 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 22:15:02,676 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 22:15:02,676 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 22:15:02,676 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 22:15:02,677 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 22:15:02,677 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 22:15:02,677 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 22:15:02,677 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:15:02,677 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 22:15:02,677 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 22:15:02,678 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 22:15:02,678 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 22:15:02,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 22:15:02,678 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 22:15:02,678 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 22:15:02,678 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 22:15:02,678 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 9abac63211b9980a3b9079d9eb140a85fbc6c5adec6517ed998cc9e140b19342 [2022-07-13 22:15:02,884 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 22:15:02,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 22:15:02,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 22:15:02,904 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 22:15:02,905 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 22:15:02,905 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c [2022-07-13 22:15:02,957 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/019765aec/50e3fd0cfdc444b7a1c0494b6233cd64/FLAG285125671 [2022-07-13 22:15:03,284 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 22:15:03,285 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c [2022-07-13 22:15:03,294 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/019765aec/50e3fd0cfdc444b7a1c0494b6233cd64/FLAG285125671 [2022-07-13 22:15:03,310 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/019765aec/50e3fd0cfdc444b7a1c0494b6233cd64 [2022-07-13 22:15:03,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 22:15:03,313 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 22:15:03,316 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 22:15:03,316 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 22:15:03,318 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 22:15:03,319 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:15:03" (1/1) ... [2022-07-13 22:15:03,319 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35c7d87f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:15:03, skipping insertion in model container [2022-07-13 22:15:03,320 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:15:03" (1/1) ... [2022-07-13 22:15:03,325 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 22:15:03,341 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 22:15:03,511 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c[2553,2566] [2022-07-13 22:15:03,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:15:03,529 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 22:15:03,561 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c[2553,2566] [2022-07-13 22:15:03,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:15:03,576 INFO L208 MainTranslator]: Completed translation [2022-07-13 22:15:03,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:15:03 WrapperNode [2022-07-13 22:15:03,578 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 22:15:03,579 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 22:15:03,579 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 22:15:03,579 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 22:15:03,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:15:03" (1/1) ... [2022-07-13 22:15:03,597 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:15:03" (1/1) ... [2022-07-13 22:15:03,618 INFO L137 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 101 [2022-07-13 22:15:03,619 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 22:15:03,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 22:15:03,620 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 22:15:03,620 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 22:15:03,626 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:15:03" (1/1) ... [2022-07-13 22:15:03,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:15:03" (1/1) ... [2022-07-13 22:15:03,638 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:15:03" (1/1) ... [2022-07-13 22:15:03,639 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:15:03" (1/1) ... [2022-07-13 22:15:03,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:15:03" (1/1) ... [2022-07-13 22:15:03,654 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:15:03" (1/1) ... [2022-07-13 22:15:03,656 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:15:03" (1/1) ... [2022-07-13 22:15:03,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 22:15:03,662 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 22:15:03,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 22:15:03,663 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 22:15:03,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:15:03" (1/1) ... [2022-07-13 22:15:03,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:15:03,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:15:03,686 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 22:15:03,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 22:15:03,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 22:15:03,717 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-13 22:15:03,718 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-13 22:15:03,718 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-13 22:15:03,718 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-13 22:15:03,718 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-13 22:15:03,718 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-13 22:15:03,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 22:15:03,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 22:15:03,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 22:15:03,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-13 22:15:03,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-13 22:15:03,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 22:15:03,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 22:15:03,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 22:15:03,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 22:15:03,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 22:15:03,721 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-13 22:15:03,823 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 22:15:03,824 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 22:15:04,014 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 22:15:04,071 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 22:15:04,073 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-13 22:15:04,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:15:04 BoogieIcfgContainer [2022-07-13 22:15:04,075 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 22:15:04,076 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 22:15:04,076 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 22:15:04,079 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 22:15:04,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 10:15:03" (1/3) ... [2022-07-13 22:15:04,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2879ec92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:15:04, skipping insertion in model container [2022-07-13 22:15:04,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:15:03" (2/3) ... [2022-07-13 22:15:04,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2879ec92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:15:04, skipping insertion in model container [2022-07-13 22:15:04,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:15:04" (3/3) ... [2022-07-13 22:15:04,082 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array.wvr.c [2022-07-13 22:15:04,086 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-13 22:15:04,093 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 22:15:04,093 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 22:15:04,093 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-13 22:15:04,152 INFO L135 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-13 22:15:04,173 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 151 places, 153 transitions, 330 flow [2022-07-13 22:15:04,229 INFO L129 PetriNetUnfolder]: 12/150 cut-off events. [2022-07-13 22:15:04,229 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-13 22:15:04,233 INFO L84 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 150 events. 12/150 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 92 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 112. Up to 2 conditions per place. [2022-07-13 22:15:04,233 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 153 transitions, 330 flow [2022-07-13 22:15:04,245 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 139 transitions, 296 flow [2022-07-13 22:15:04,254 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 22:15:04,258 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@41c78069, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@57e91821 [2022-07-13 22:15:04,259 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-07-13 22:15:04,305 INFO L129 PetriNetUnfolder]: 12/138 cut-off events. [2022-07-13 22:15:04,307 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-13 22:15:04,307 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:15:04,308 INFO L200 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] [2022-07-13 22:15:04,309 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-13 22:15:04,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:15:04,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1264132100, now seen corresponding path program 1 times [2022-07-13 22:15:04,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:15:04,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852770379] [2022-07-13 22:15:04,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:15:04,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:15:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:15:04,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:15:04,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:15:04,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852770379] [2022-07-13 22:15:04,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852770379] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:15:04,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:15:04,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 22:15:04,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336281564] [2022-07-13 22:15:04,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:15:04,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 22:15:04,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:15:04,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 22:15:04,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 22:15:04,482 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 153 [2022-07-13 22:15:04,487 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 139 transitions, 296 flow. Second operand has 2 states, 2 states have (on average 139.0) internal successors, (278), 2 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:15:04,487 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:15:04,487 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 153 [2022-07-13 22:15:04,488 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:15:04,552 INFO L129 PetriNetUnfolder]: 41/264 cut-off events. [2022-07-13 22:15:04,552 INFO L130 PetriNetUnfolder]: For 49/50 co-relation queries the response was YES. [2022-07-13 22:15:04,554 INFO L84 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 264 events. 41/264 cut-off events. For 49/50 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 708 event pairs, 15 based on Foata normal form. 42/275 useless extension candidates. Maximal degree in co-relation 216. Up to 59 conditions per place. [2022-07-13 22:15:04,556 INFO L132 encePairwiseOnDemand]: 145/153 looper letters, 9 selfloop transitions, 0 changer transitions 4/131 dead transitions. [2022-07-13 22:15:04,556 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 131 transitions, 298 flow [2022-07-13 22:15:04,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 22:15:04,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-13 22:15:04,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 287 transitions. [2022-07-13 22:15:04,573 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9379084967320261 [2022-07-13 22:15:04,573 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 287 transitions. [2022-07-13 22:15:04,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 287 transitions. [2022-07-13 22:15:04,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:15:04,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 287 transitions. [2022-07-13 22:15:04,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 143.5) internal successors, (287), 2 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:15:04,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:15:04,584 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:15:04,586 INFO L186 Difference]: Start difference. First operand has 137 places, 139 transitions, 296 flow. Second operand 2 states and 287 transitions. [2022-07-13 22:15:04,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 131 transitions, 298 flow [2022-07-13 22:15:04,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 131 transitions, 286 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-07-13 22:15:04,593 INFO L242 Difference]: Finished difference. Result has 132 places, 127 transitions, 260 flow [2022-07-13 22:15:04,594 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=260, PETRI_PLACES=132, PETRI_TRANSITIONS=127} [2022-07-13 22:15:04,598 INFO L279 CegarLoopForPetriNet]: 137 programPoint places, -5 predicate places. [2022-07-13 22:15:04,599 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 127 transitions, 260 flow [2022-07-13 22:15:04,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 139.0) internal successors, (278), 2 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:15:04,600 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:15:04,600 INFO L200 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] [2022-07-13 22:15:04,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 22:15:04,602 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-13 22:15:04,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:15:04,603 INFO L85 PathProgramCache]: Analyzing trace with hash 563593522, now seen corresponding path program 1 times [2022-07-13 22:15:04,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:15:04,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057272023] [2022-07-13 22:15:04,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:15:04,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:15:04,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:15:04,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:15:04,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:15:04,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057272023] [2022-07-13 22:15:04,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057272023] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:15:04,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:15:04,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 22:15:04,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312074956] [2022-07-13 22:15:04,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:15:04,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:15:04,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:15:04,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:15:04,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:15:04,918 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 153 [2022-07-13 22:15:04,923 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 127 transitions, 260 flow. Second operand has 8 states, 8 states have (on average 98.5) internal successors, (788), 8 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:15:04,923 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:15:04,923 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 153 [2022-07-13 22:15:04,923 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:15:05,112 INFO L129 PetriNetUnfolder]: 295/678 cut-off events. [2022-07-13 22:15:05,112 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-07-13 22:15:05,115 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1137 conditions, 678 events. 295/678 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2973 event pairs, 167 based on Foata normal form. 1/510 useless extension candidates. Maximal degree in co-relation 1134. Up to 421 conditions per place. [2022-07-13 22:15:05,120 INFO L132 encePairwiseOnDemand]: 143/153 looper letters, 44 selfloop transitions, 6 changer transitions 4/135 dead transitions. [2022-07-13 22:15:05,120 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 135 transitions, 384 flow [2022-07-13 22:15:05,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:15:05,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-13 22:15:05,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 807 transitions. [2022-07-13 22:15:05,123 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.6593137254901961 [2022-07-13 22:15:05,123 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 807 transitions. [2022-07-13 22:15:05,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 807 transitions. [2022-07-13 22:15:05,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:15:05,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 807 transitions. [2022-07-13 22:15:05,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 100.875) internal successors, (807), 8 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:15:05,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 153.0) internal successors, (1377), 9 states have internal predecessors, (1377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:15:05,129 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 153.0) internal successors, (1377), 9 states have internal predecessors, (1377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:15:05,130 INFO L186 Difference]: Start difference. First operand has 132 places, 127 transitions, 260 flow. Second operand 8 states and 807 transitions. [2022-07-13 22:15:05,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 135 transitions, 384 flow [2022-07-13 22:15:05,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 135 transitions, 384 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-13 22:15:05,134 INFO L242 Difference]: Finished difference. Result has 139 places, 128 transitions, 288 flow [2022-07-13 22:15:05,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=288, PETRI_PLACES=139, PETRI_TRANSITIONS=128} [2022-07-13 22:15:05,135 INFO L279 CegarLoopForPetriNet]: 137 programPoint places, 2 predicate places. [2022-07-13 22:15:05,135 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 128 transitions, 288 flow [2022-07-13 22:15:05,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.5) internal successors, (788), 8 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:15:05,136 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:15:05,136 INFO L200 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] [2022-07-13 22:15:05,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 22:15:05,137 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-13 22:15:05,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:15:05,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1756520908, now seen corresponding path program 1 times [2022-07-13 22:15:05,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:15:05,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085683489] [2022-07-13 22:15:05,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:15:05,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:15:05,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:15:05,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:15:05,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:15:05,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085683489] [2022-07-13 22:15:05,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085683489] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:15:05,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744802103] [2022-07-13 22:15:05,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:15:05,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:15:05,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:15:05,274 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:15:05,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 22:15:05,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:15:05,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 22:15:05,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:15:05,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:15:05,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:15:05,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:15:05,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744802103] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 22:15:05,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:15:05,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-07-13 22:15:05,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860592200] [2022-07-13 22:15:05,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:15:05,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 22:15:05,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:15:05,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 22:15:05,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:15:05,699 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 153 [2022-07-13 22:15:05,700 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 128 transitions, 288 flow. Second operand has 7 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:15:05,700 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:15:05,700 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 153 [2022-07-13 22:15:05,700 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:15:05,814 INFO L129 PetriNetUnfolder]: 175/510 cut-off events. [2022-07-13 22:15:05,814 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-07-13 22:15:05,816 INFO L84 FinitePrefix]: Finished finitePrefix Result has 834 conditions, 510 events. 175/510 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2110 event pairs, 45 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 826. Up to 137 conditions per place. [2022-07-13 22:15:05,818 INFO L132 encePairwiseOnDemand]: 145/153 looper letters, 33 selfloop transitions, 7 changer transitions 0/136 dead transitions. [2022-07-13 22:15:05,818 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 136 transitions, 386 flow [2022-07-13 22:15:05,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 22:15:05,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-13 22:15:05,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 831 transitions. [2022-07-13 22:15:05,820 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7759103641456583 [2022-07-13 22:15:05,820 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 831 transitions. [2022-07-13 22:15:05,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 831 transitions. [2022-07-13 22:15:05,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:15:05,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 831 transitions. [2022-07-13 22:15:05,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.71428571428571) internal successors, (831), 7 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:15:05,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 153.0) internal successors, (1224), 8 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:15:05,825 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 153.0) internal successors, (1224), 8 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:15:05,825 INFO L186 Difference]: Start difference. First operand has 139 places, 128 transitions, 288 flow. Second operand 7 states and 831 transitions. [2022-07-13 22:15:05,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 136 transitions, 386 flow [2022-07-13 22:15:05,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 136 transitions, 368 flow, removed 3 selfloop flow, removed 7 redundant places. [2022-07-13 22:15:05,828 INFO L242 Difference]: Finished difference. Result has 139 places, 130 transitions, 303 flow [2022-07-13 22:15:05,829 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=303, PETRI_PLACES=139, PETRI_TRANSITIONS=130} [2022-07-13 22:15:05,829 INFO L279 CegarLoopForPetriNet]: 137 programPoint places, 2 predicate places. [2022-07-13 22:15:05,829 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 130 transitions, 303 flow [2022-07-13 22:15:05,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:15:05,830 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:15:05,830 INFO L200 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] [2022-07-13 22:15:05,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 22:15:06,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:15:06,048 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-13 22:15:06,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:15:06,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1066338293, now seen corresponding path program 1 times [2022-07-13 22:15:06,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:15:06,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186417025] [2022-07-13 22:15:06,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:15:06,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:15:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:15:06,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 22:15:06,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:15:06,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186417025] [2022-07-13 22:15:06,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186417025] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:15:06,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352439129] [2022-07-13 22:15:06,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:15:06,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:15:06,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:15:06,220 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:15:06,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 22:15:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:15:06,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 22:15:06,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:15:06,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 22:15:06,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:15:06,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 22:15:06,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352439129] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 22:15:06,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:15:06,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-07-13 22:15:06,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479003944] [2022-07-13 22:15:06,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:15:06,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:15:06,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:15:06,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:15:06,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-07-13 22:15:06,542 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 153 [2022-07-13 22:15:06,543 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 130 transitions, 303 flow. Second operand has 9 states, 9 states have (on average 109.33333333333333) internal successors, (984), 9 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:15:06,544 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:15:06,544 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 153 [2022-07-13 22:15:06,544 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:15:06,819 INFO L129 PetriNetUnfolder]: 599/1273 cut-off events. [2022-07-13 22:15:06,820 INFO L130 PetriNetUnfolder]: For 404/585 co-relation queries the response was YES. [2022-07-13 22:15:06,822 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2530 conditions, 1273 events. 599/1273 cut-off events. For 404/585 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6947 event pairs, 124 based on Foata normal form. 181/1304 useless extension candidates. Maximal degree in co-relation 2522. Up to 249 conditions per place. [2022-07-13 22:15:06,827 INFO L132 encePairwiseOnDemand]: 141/153 looper letters, 74 selfloop transitions, 19 changer transitions 0/182 dead transitions. [2022-07-13 22:15:06,827 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 182 transitions, 642 flow [2022-07-13 22:15:06,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 22:15:06,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-13 22:15:06,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1253 transitions. [2022-07-13 22:15:06,830 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.744503862150921 [2022-07-13 22:15:06,830 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1253 transitions. [2022-07-13 22:15:06,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1253 transitions. [2022-07-13 22:15:06,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:15:06,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1253 transitions. [2022-07-13 22:15:06,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 113.9090909090909) internal successors, (1253), 11 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:15:06,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 153.0) internal successors, (1836), 12 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:15:06,836 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 153.0) internal successors, (1836), 12 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:15:06,836 INFO L186 Difference]: Start difference. First operand has 139 places, 130 transitions, 303 flow. Second operand 11 states and 1253 transitions. [2022-07-13 22:15:06,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 182 transitions, 642 flow [2022-07-13 22:15:06,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 182 transitions, 629 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-13 22:15:06,839 INFO L242 Difference]: Finished difference. Result has 151 places, 142 transitions, 402 flow [2022-07-13 22:15:06,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=402, PETRI_PLACES=151, PETRI_TRANSITIONS=142} [2022-07-13 22:15:06,840 INFO L279 CegarLoopForPetriNet]: 137 programPoint places, 14 predicate places. [2022-07-13 22:15:06,840 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 142 transitions, 402 flow [2022-07-13 22:15:06,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 109.33333333333333) internal successors, (984), 9 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:15:06,841 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:15:06,841 INFO L200 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] [2022-07-13 22:15:06,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 22:15:07,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-13 22:15:07,056 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-13 22:15:07,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:15:07,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1615339177, now seen corresponding path program 2 times [2022-07-13 22:15:07,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:15:07,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370584387] [2022-07-13 22:15:07,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:15:07,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:15:07,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:15:07,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 22:15:07,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:15:07,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370584387] [2022-07-13 22:15:07,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370584387] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:15:07,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192061381] [2022-07-13 22:15:07,153 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 22:15:07,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:15:07,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:15:07,155 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:15:07,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 22:15:07,227 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 22:15:07,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:15:07,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 22:15:07,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:15:07,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 22:15:07,415 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:15:07,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192061381] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:15:07,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:15:07,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-07-13 22:15:07,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680945272] [2022-07-13 22:15:07,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:15:07,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 22:15:07,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:15:07,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 22:15:07,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:15:07,418 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 153 [2022-07-13 22:15:07,418 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 142 transitions, 402 flow. Second operand has 6 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:15:07,419 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:15:07,419 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 153 [2022-07-13 22:15:07,419 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:15:07,621 INFO L129 PetriNetUnfolder]: 413/833 cut-off events. [2022-07-13 22:15:07,621 INFO L130 PetriNetUnfolder]: For 772/877 co-relation queries the response was YES. [2022-07-13 22:15:07,624 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2163 conditions, 833 events. 413/833 cut-off events. For 772/877 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3721 event pairs, 111 based on Foata normal form. 131/942 useless extension candidates. Maximal degree in co-relation 2149. Up to 334 conditions per place. [2022-07-13 22:15:07,628 INFO L132 encePairwiseOnDemand]: 144/153 looper letters, 42 selfloop transitions, 11 changer transitions 0/144 dead transitions. [2022-07-13 22:15:07,628 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 144 transitions, 501 flow [2022-07-13 22:15:07,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:15:07,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-13 22:15:07,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 857 transitions. [2022-07-13 22:15:07,630 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7001633986928104 [2022-07-13 22:15:07,630 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 857 transitions. [2022-07-13 22:15:07,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 857 transitions. [2022-07-13 22:15:07,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:15:07,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 857 transitions. [2022-07-13 22:15:07,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 107.125) internal successors, (857), 8 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:15:07,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 153.0) internal successors, (1377), 9 states have internal predecessors, (1377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:15:07,634 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 153.0) internal successors, (1377), 9 states have internal predecessors, (1377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:15:07,634 INFO L186 Difference]: Start difference. First operand has 151 places, 142 transitions, 402 flow. Second operand 8 states and 857 transitions. [2022-07-13 22:15:07,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 144 transitions, 501 flow [2022-07-13 22:15:07,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 144 transitions, 488 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-07-13 22:15:07,639 INFO L242 Difference]: Finished difference. Result has 150 places, 136 transitions, 379 flow [2022-07-13 22:15:07,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=379, PETRI_PLACES=150, PETRI_TRANSITIONS=136} [2022-07-13 22:15:07,640 INFO L279 CegarLoopForPetriNet]: 137 programPoint places, 13 predicate places. [2022-07-13 22:15:07,640 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 136 transitions, 379 flow [2022-07-13 22:15:07,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:15:07,641 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:15:07,641 INFO L200 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] [2022-07-13 22:15:07,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 22:15:07,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:15:07,863 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-13 22:15:07,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:15:07,864 INFO L85 PathProgramCache]: Analyzing trace with hash 166796212, now seen corresponding path program 1 times [2022-07-13 22:15:07,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:15:07,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430569234] [2022-07-13 22:15:07,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:15:07,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:15:07,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:15:08,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:15:08,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:15:08,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430569234] [2022-07-13 22:15:08,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430569234] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:15:08,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387715466] [2022-07-13 22:15:08,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:15:08,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:15:08,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:15:08,488 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:15:08,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 22:15:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:15:08,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-13 22:15:08,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:15:09,602 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 22:15:09,605 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:15:09,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 36 [2022-07-13 22:15:09,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:15:09,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:15:09,909 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:15:09,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 51 [2022-07-13 22:15:10,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:15:10,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387715466] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:15:10,458 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:15:10,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24, 18] total 57 [2022-07-13 22:15:10,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227556009] [2022-07-13 22:15:10,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:15:10,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-07-13 22:15:10,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:15:10,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-07-13 22:15:10,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=2720, Unknown=0, NotChecked=0, Total=3192 [2022-07-13 22:15:10,464 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 153 [2022-07-13 22:15:10,468 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 136 transitions, 379 flow. Second operand has 57 states, 57 states have (on average 71.28070175438596) internal successors, (4063), 57 states have internal predecessors, (4063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:15:10,468 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:15:10,468 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 153 [2022-07-13 22:15:10,468 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:15:13,404 INFO L129 PetriNetUnfolder]: 4198/6888 cut-off events. [2022-07-13 22:15:13,404 INFO L130 PetriNetUnfolder]: For 5982/5997 co-relation queries the response was YES. [2022-07-13 22:15:13,417 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17926 conditions, 6888 events. 4198/6888 cut-off events. For 5982/5997 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 44818 event pairs, 387 based on Foata normal form. 2/6730 useless extension candidates. Maximal degree in co-relation 17914. Up to 2296 conditions per place. [2022-07-13 22:15:13,448 INFO L132 encePairwiseOnDemand]: 113/153 looper letters, 266 selfloop transitions, 104 changer transitions 10/436 dead transitions. [2022-07-13 22:15:13,448 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 436 transitions, 2224 flow [2022-07-13 22:15:13,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-07-13 22:15:13,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2022-07-13 22:15:13,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 3548 transitions. [2022-07-13 22:15:13,455 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.49339452092893893 [2022-07-13 22:15:13,455 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 3548 transitions. [2022-07-13 22:15:13,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 3548 transitions. [2022-07-13 22:15:13,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:15:13,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 3548 transitions. [2022-07-13 22:15:13,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 75.48936170212765) internal successors, (3548), 47 states have internal predecessors, (3548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:15:13,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 153.0) internal successors, (7344), 48 states have internal predecessors, (7344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:15:13,473 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 153.0) internal successors, (7344), 48 states have internal predecessors, (7344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:15:13,474 INFO L186 Difference]: Start difference. First operand has 150 places, 136 transitions, 379 flow. Second operand 47 states and 3548 transitions. [2022-07-13 22:15:13,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 436 transitions, 2224 flow [2022-07-13 22:15:13,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 436 transitions, 2174 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-07-13 22:15:13,511 INFO L242 Difference]: Finished difference. Result has 220 places, 229 transitions, 1139 flow [2022-07-13 22:15:13,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=1139, PETRI_PLACES=220, PETRI_TRANSITIONS=229} [2022-07-13 22:15:13,513 INFO L279 CegarLoopForPetriNet]: 137 programPoint places, 83 predicate places. [2022-07-13 22:15:13,513 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 229 transitions, 1139 flow [2022-07-13 22:15:13,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 71.28070175438596) internal successors, (4063), 57 states have internal predecessors, (4063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:15:13,515 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:15:13,515 INFO L200 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] [2022-07-13 22:15:13,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-13 22:15:13,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:15:13,752 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-13 22:15:13,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:15:13,752 INFO L85 PathProgramCache]: Analyzing trace with hash 934935682, now seen corresponding path program 2 times [2022-07-13 22:15:13,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:15:13,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146735026] [2022-07-13 22:15:13,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:15:13,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:15:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:15:14,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:15:14,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:15:14,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146735026] [2022-07-13 22:15:14,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146735026] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:15:14,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430920736] [2022-07-13 22:15:14,397 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 22:15:14,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:15:14,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:15:14,412 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:15:14,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 22:15:14,490 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 22:15:14,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:15:14,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-13 22:15:14,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:15:14,950 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:15:14,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 45 [2022-07-13 22:15:15,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 22:15:15,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:15:15,620 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:15:15,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 51 [2022-07-13 22:15:15,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 22:15:15,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430920736] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:15:15,982 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:15:15,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 16, 16] total 44 [2022-07-13 22:15:15,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327507864] [2022-07-13 22:15:15,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:15:15,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-13 22:15:15,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:15:15,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-13 22:15:15,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=1614, Unknown=0, NotChecked=0, Total=1892 [2022-07-13 22:15:15,989 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 153 [2022-07-13 22:15:15,991 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 229 transitions, 1139 flow. Second operand has 44 states, 44 states have (on average 69.1590909090909) internal successors, (3043), 44 states have internal predecessors, (3043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:15:15,991 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:15:15,991 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 153 [2022-07-13 22:15:15,992 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:15:21,776 INFO L129 PetriNetUnfolder]: 8669/14527 cut-off events. [2022-07-13 22:15:21,776 INFO L130 PetriNetUnfolder]: For 29571/29633 co-relation queries the response was YES. [2022-07-13 22:15:21,837 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46068 conditions, 14527 events. 8669/14527 cut-off events. For 29571/29633 co-relation queries the response was YES. Maximal size of possible extension queue 779. Compared 109060 event pairs, 1235 based on Foata normal form. 12/14420 useless extension candidates. Maximal degree in co-relation 46028. Up to 5999 conditions per place. [2022-07-13 22:15:21,896 INFO L132 encePairwiseOnDemand]: 118/153 looper letters, 500 selfloop transitions, 222 changer transitions 21/795 dead transitions. [2022-07-13 22:15:21,896 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 795 transitions, 5369 flow [2022-07-13 22:15:21,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-07-13 22:15:21,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2022-07-13 22:15:21,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 4957 transitions. [2022-07-13 22:15:21,903 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.48356257926055995 [2022-07-13 22:15:21,903 INFO L72 ComplementDD]: Start complementDD. Operand 67 states and 4957 transitions. [2022-07-13 22:15:21,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 4957 transitions. [2022-07-13 22:15:21,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:15:21,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 67 states and 4957 transitions. [2022-07-13 22:15:21,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 68 states, 67 states have (on average 73.98507462686567) internal successors, (4957), 67 states have internal predecessors, (4957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:15:21,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 68 states, 68 states have (on average 153.0) internal successors, (10404), 68 states have internal predecessors, (10404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:15:21,925 INFO L81 ComplementDD]: Finished complementDD. Result has 68 states, 68 states have (on average 153.0) internal successors, (10404), 68 states have internal predecessors, (10404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:15:21,925 INFO L186 Difference]: Start difference. First operand has 220 places, 229 transitions, 1139 flow. Second operand 67 states and 4957 transitions. [2022-07-13 22:15:21,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 795 transitions, 5369 flow [2022-07-13 22:15:22,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 795 transitions, 5303 flow, removed 22 selfloop flow, removed 14 redundant places. [2022-07-13 22:15:22,114 INFO L242 Difference]: Finished difference. Result has 305 places, 407 transitions, 3103 flow [2022-07-13 22:15:22,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=1101, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=67, PETRI_FLOW=3103, PETRI_PLACES=305, PETRI_TRANSITIONS=407} [2022-07-13 22:15:22,116 INFO L279 CegarLoopForPetriNet]: 137 programPoint places, 168 predicate places. [2022-07-13 22:15:22,116 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 407 transitions, 3103 flow [2022-07-13 22:15:22,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 69.1590909090909) internal successors, (3043), 44 states have internal predecessors, (3043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:15:22,126 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:15:22,127 INFO L200 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] [2022-07-13 22:15:22,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 22:15:22,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:15:22,347 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-13 22:15:22,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:15:22,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1096212486, now seen corresponding path program 3 times [2022-07-13 22:15:22,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:15:22,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001856546] [2022-07-13 22:15:22,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:15:22,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:15:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:15:23,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:15:23,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:15:23,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001856546] [2022-07-13 22:15:23,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001856546] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:15:23,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98408799] [2022-07-13 22:15:23,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 22:15:23,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:15:23,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:15:23,253 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:15:23,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 22:15:23,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-13 22:15:23,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:15:23,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-13 22:15:23,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:15:23,387 INFO L390 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 [2022-07-13 22:15:23,428 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 22:15:23,429 INFO L390 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 [2022-07-13 22:15:23,665 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-13 22:15:23,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-07-13 22:15:23,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 22:15:24,309 INFO L390 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 [2022-07-13 22:15:24,423 INFO L390 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 [2022-07-13 22:15:24,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-07-13 22:15:24,974 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 22:15:24,976 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:15:24,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 36 [2022-07-13 22:15:25,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:15:25,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:15:25,283 WARN L833 $PredicateComparison]: unable to prove that (and (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_227 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) c_~min2~0))) (forall ((v_ArrVal_227 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (not (< .cse0 c_~min2~0)) (= c_~min1~0 .cse0))))) is different from false [2022-07-13 22:15:26,604 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_226 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) c_~A~0.base) c_~A~0.offset))) (or (not (< .cse0 c_~min1~0)) (and (forall ((v_ArrVal_227 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (not (< .cse1 c_~min2~0)) (= .cse1 (select (select .cse2 c_~A~0.base) c_~A~0.offset)))))) (or (= c_~min2~0 .cse0) (forall ((v_ArrVal_227 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) c_~min2~0))))))) (forall ((v_ArrVal_226 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) c_~A~0.base) c_~A~0.offset) c_~min1~0) (and (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_227 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) c_~min2~0))) (forall ((v_ArrVal_227 (Array Int Int))) (let ((.cse3 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (not (< .cse3 c_~min2~0)) (= c_~min1~0 .cse3)))))))) (< 1 c_~N~0) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) is different from false [2022-07-13 22:15:26,658 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_226 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) c_~A~0.base) c_~A~0.offset))) (or (not (< .cse0 c_~min1~0)) (and (forall ((v_ArrVal_227 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (not (< .cse1 c_~min2~0)) (= .cse1 (select (select .cse2 c_~A~0.base) c_~A~0.offset)))))) (or (= c_~min2~0 .cse0) (forall ((v_ArrVal_227 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) c_~min2~0))))))) (forall ((v_ArrVal_226 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) c_~A~0.base) c_~A~0.offset) c_~min1~0) (and (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_227 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) c_~min2~0))) (forall ((v_ArrVal_227 (Array Int Int))) (let ((.cse3 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (not (< .cse3 c_~min2~0)) (= c_~min1~0 .cse3)))))))) (< 1 c_~N~0) (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) is different from false [2022-07-13 22:15:27,032 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (and (forall ((v_ArrVal_226 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (or (and (forall ((v_ArrVal_227 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (= c_~min1~0 .cse0) (not (< .cse0 c_~min2~0))))) (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_227 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min2~0)))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) c_~A~0.base) c_~A~0.offset) c_~min1~0))) (forall ((v_ArrVal_226 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) c_~A~0.base) c_~A~0.offset))) (or (not (< .cse1 c_~min1~0)) (and (forall ((v_ArrVal_227 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< .cse2 c_~min2~0)) (= (select (select .cse3 c_~A~0.base) c_~A~0.offset) .cse2))))) (or (= c_~min2~0 .cse1) (forall ((v_ArrVal_227 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min2~0)))))))) (< ~M~0 0) (<= 1 ~M~0))) is different from false [2022-07-13 22:15:27,828 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (< ~M~0 0) (and (forall ((v_ArrVal_226 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (let ((.cse2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (and (forall ((v_ArrVal_227 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (not (< .cse0 c_~min2~0)) (= .cse0 (select (select .cse1 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)))))) (or (forall ((v_ArrVal_227 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~min2~0)) (= c_~min2~0 .cse2))) (not (< .cse2 c_~min1~0))))) (forall ((v_ArrVal_226 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (or (and (forall ((v_ArrVal_227 (Array Int Int))) (let ((.cse3 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (= c_~min1~0 .cse3) (not (< .cse3 c_~min2~0))))) (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_227 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~min2~0)))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0)))) (<= 1 ~M~0))) is different from false [2022-07-13 22:15:28,447 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (and (forall ((v_ArrVal_226 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (or (and (forall ((v_ArrVal_227 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (= c_~min1~0 .cse0) (not (< .cse0 c_~min2~0))))) (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_227 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min2~0)))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0))) (forall ((v_ArrVal_226 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (not (< .cse1 c_~min1~0)) (and (or (= c_~min2~0 .cse1) (forall ((v_ArrVal_227 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min2~0))) (forall ((v_ArrVal_227 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (= .cse2 (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (not (< .cse2 c_~min2~0))))))))))) (< ~M~0 0) (<= 1 ~M~0))) is different from false [2022-07-13 22:15:28,785 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (< ~M~0 0) (and (forall ((v_ArrVal_226 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (and (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_227 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0))) (forall ((v_ArrVal_227 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse0 c_~min2~0)) (= c_~min1~0 .cse0))))))) (forall ((v_ArrVal_226 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (and (or (= c_~min2~0 .cse1) (forall ((v_ArrVal_227 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0))) (forall ((v_ArrVal_227 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse2 c_~min2~0)) (= .cse2 (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (not (< .cse1 c_~min1~0)))))) (<= 1 ~M~0))) is different from false [2022-07-13 22:15:30,393 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:15:30,394 INFO L390 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 174 treesize of output 114 [2022-07-13 22:15:30,422 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-07-13 22:15:30,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5779 treesize of output 5367 [2022-07-13 22:15:30,468 INFO L390 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 2816 treesize of output 2384 [2022-07-13 22:15:33,422 INFO L390 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 2326 treesize of output 1942 [2022-07-13 22:15:55,617 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-07-13 22:15:55,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 201 treesize of output 193 [2022-07-13 22:15:55,625 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-07-13 22:15:55,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 189 treesize of output 177 [2022-07-13 22:15:55,713 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:15:55,713 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 93 [2022-07-13 22:15:55,723 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 22:15:55,737 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-07-13 22:15:55,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 564 treesize of output 512 [2022-07-13 22:15:55,747 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-07-13 22:15:55,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 508 treesize of output 432 [2022-07-13 22:15:55,760 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-07-13 22:15:55,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 382 treesize of output 346 [2022-07-13 22:15:57,002 INFO L390 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 13 treesize of output 11 [2022-07-13 22:15:57,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-13 22:15:57,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98408799] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:15:57,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:15:57,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 26] total 71 [2022-07-13 22:15:57,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134564045] [2022-07-13 22:15:57,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:15:57,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-07-13 22:15:57,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:15:57,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-07-13 22:15:57,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=473, Invalid=3575, Unknown=12, NotChecked=910, Total=4970 [2022-07-13 22:15:57,015 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 153 [2022-07-13 22:15:57,018 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 407 transitions, 3103 flow. Second operand has 71 states, 71 states have (on average 56.901408450704224) internal successors, (4040), 71 states have internal predecessors, (4040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:15:57,018 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:15:57,018 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 153 [2022-07-13 22:15:57,018 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:16:25,977 INFO L129 PetriNetUnfolder]: 13106/21481 cut-off events. [2022-07-13 22:16:25,978 INFO L130 PetriNetUnfolder]: For 108335/108596 co-relation queries the response was YES. [2022-07-13 22:16:26,166 INFO L84 FinitePrefix]: Finished finitePrefix Result has 92282 conditions, 21481 events. 13106/21481 cut-off events. For 108335/108596 co-relation queries the response was YES. Maximal size of possible extension queue 1233. Compared 170014 event pairs, 2198 based on Foata normal form. 67/21217 useless extension candidates. Maximal degree in co-relation 92209. Up to 8992 conditions per place. [2022-07-13 22:16:26,261 INFO L132 encePairwiseOnDemand]: 107/153 looper letters, 515 selfloop transitions, 348 changer transitions 10/925 dead transitions. [2022-07-13 22:16:26,261 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 925 transitions, 8679 flow [2022-07-13 22:16:26,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-07-13 22:16:26,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2022-07-13 22:16:26,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 3950 transitions. [2022-07-13 22:16:26,266 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.403390522875817 [2022-07-13 22:16:26,266 INFO L72 ComplementDD]: Start complementDD. Operand 64 states and 3950 transitions. [2022-07-13 22:16:26,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 3950 transitions. [2022-07-13 22:16:26,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:16:26,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 64 states and 3950 transitions. [2022-07-13 22:16:26,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 65 states, 64 states have (on average 61.71875) internal successors, (3950), 64 states have internal predecessors, (3950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:16:26,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 65 states, 65 states have (on average 153.0) internal successors, (9945), 65 states have internal predecessors, (9945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:16:26,281 INFO L81 ComplementDD]: Finished complementDD. Result has 65 states, 65 states have (on average 153.0) internal successors, (9945), 65 states have internal predecessors, (9945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:16:26,281 INFO L186 Difference]: Start difference. First operand has 305 places, 407 transitions, 3103 flow. Second operand 64 states and 3950 transitions. [2022-07-13 22:16:26,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 925 transitions, 8679 flow [2022-07-13 22:16:27,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 925 transitions, 8457 flow, removed 78 selfloop flow, removed 22 redundant places. [2022-07-13 22:16:27,309 INFO L242 Difference]: Finished difference. Result has 371 places, 636 transitions, 6498 flow [2022-07-13 22:16:27,310 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=2943, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=64, PETRI_FLOW=6498, PETRI_PLACES=371, PETRI_TRANSITIONS=636} [2022-07-13 22:16:27,310 INFO L279 CegarLoopForPetriNet]: 137 programPoint places, 234 predicate places. [2022-07-13 22:16:27,310 INFO L495 AbstractCegarLoop]: Abstraction has has 371 places, 636 transitions, 6498 flow [2022-07-13 22:16:27,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 56.901408450704224) internal successors, (4040), 71 states have internal predecessors, (4040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:16:27,311 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:16:27,312 INFO L200 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] [2022-07-13 22:16:27,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-13 22:16:27,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:16:27,520 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-13 22:16:27,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:16:27,520 INFO L85 PathProgramCache]: Analyzing trace with hash -5287510, now seen corresponding path program 4 times [2022-07-13 22:16:27,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:16:27,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369384058] [2022-07-13 22:16:27,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:16:27,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:16:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:16:28,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:16:28,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:16:28,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369384058] [2022-07-13 22:16:28,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369384058] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:16:28,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462592796] [2022-07-13 22:16:28,155 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 22:16:28,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:16:28,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:16:28,156 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:16:28,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 22:16:28,228 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 22:16:28,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:16:28,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-13 22:16:28,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:16:28,252 INFO L390 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 [2022-07-13 22:16:28,280 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 22:16:28,280 INFO L390 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 18 [2022-07-13 22:16:28,529 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 22:16:28,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-13 22:16:29,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-07-13 22:16:29,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:16:29,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-07-13 22:16:29,790 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:16:29,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 43 [2022-07-13 22:16:30,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:16:30,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:16:30,628 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_263 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_263) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse0 (< .cse1 c_~min2~0))) (and (or (not .cse0) (= c_~min1~0 .cse1)) (or (= c_~min2~0 c_~min1~0) .cse0)))))) is different from false [2022-07-13 22:16:30,814 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_262 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (and (forall ((v_ArrVal_263 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_263) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< .cse0 c_~min2~0)) (= c_~min1~0 .cse0)))) (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_263 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_263) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min2~0)))))) is different from false [2022-07-13 22:16:31,185 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:16:31,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 493 treesize of output 437 [2022-07-13 22:16:31,196 INFO L390 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 60 treesize of output 48 [2022-07-13 22:16:31,214 INFO L390 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 60 treesize of output 42 [2022-07-13 22:16:31,237 INFO L390 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 268 treesize of output 220 [2022-07-13 22:16:31,242 INFO L390 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 220 treesize of output 196 [2022-07-13 22:16:33,380 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 22:16:33,381 INFO L390 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 10 treesize of output 8 [2022-07-13 22:16:33,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-13 22:16:33,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462592796] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:16:33,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:16:33,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31, 30] total 75 [2022-07-13 22:16:33,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565356258] [2022-07-13 22:16:33,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:16:33,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-07-13 22:16:33,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:16:33,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-07-13 22:16:33,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=509, Invalid=4753, Unknown=2, NotChecked=286, Total=5550 [2022-07-13 22:16:33,408 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 153 [2022-07-13 22:16:33,410 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 636 transitions, 6498 flow. Second operand has 75 states, 75 states have (on average 55.626666666666665) internal successors, (4172), 75 states have internal predecessors, (4172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:16:33,410 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:16:33,410 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 153 [2022-07-13 22:16:33,410 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:16:47,032 INFO L129 PetriNetUnfolder]: 23357/39024 cut-off events. [2022-07-13 22:16:47,032 INFO L130 PetriNetUnfolder]: For 397545/397845 co-relation queries the response was YES. [2022-07-13 22:16:47,932 INFO L84 FinitePrefix]: Finished finitePrefix Result has 211845 conditions, 39024 events. 23357/39024 cut-off events. For 397545/397845 co-relation queries the response was YES. Maximal size of possible extension queue 2072. Compared 339512 event pairs, 1359 based on Foata normal form. 62/38785 useless extension candidates. Maximal degree in co-relation 211747. Up to 7994 conditions per place. [2022-07-13 22:16:48,232 INFO L132 encePairwiseOnDemand]: 118/153 looper letters, 789 selfloop transitions, 896 changer transitions 20/1750 dead transitions. [2022-07-13 22:16:48,232 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 1750 transitions, 22249 flow [2022-07-13 22:16:48,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-07-13 22:16:48,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2022-07-13 22:16:48,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 4724 transitions. [2022-07-13 22:16:48,237 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.4062607499140007 [2022-07-13 22:16:48,237 INFO L72 ComplementDD]: Start complementDD. Operand 76 states and 4724 transitions. [2022-07-13 22:16:48,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 4724 transitions. [2022-07-13 22:16:48,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:16:48,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 76 states and 4724 transitions. [2022-07-13 22:16:48,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 77 states, 76 states have (on average 62.1578947368421) internal successors, (4724), 76 states have internal predecessors, (4724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:16:48,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 77 states, 77 states have (on average 153.0) internal successors, (11781), 77 states have internal predecessors, (11781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:16:48,254 INFO L81 ComplementDD]: Finished complementDD. Result has 77 states, 77 states have (on average 153.0) internal successors, (11781), 77 states have internal predecessors, (11781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:16:48,254 INFO L186 Difference]: Start difference. First operand has 371 places, 636 transitions, 6498 flow. Second operand 76 states and 4724 transitions. [2022-07-13 22:16:48,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 1750 transitions, 22249 flow [2022-07-13 22:16:53,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 1750 transitions, 21344 flow, removed 416 selfloop flow, removed 35 redundant places. [2022-07-13 22:16:53,906 INFO L242 Difference]: Finished difference. Result has 444 places, 1210 transitions, 17244 flow [2022-07-13 22:16:53,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=6175, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=636, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=377, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=76, PETRI_FLOW=17244, PETRI_PLACES=444, PETRI_TRANSITIONS=1210} [2022-07-13 22:16:53,907 INFO L279 CegarLoopForPetriNet]: 137 programPoint places, 307 predicate places. [2022-07-13 22:16:53,908 INFO L495 AbstractCegarLoop]: Abstraction has has 444 places, 1210 transitions, 17244 flow [2022-07-13 22:16:53,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 55.626666666666665) internal successors, (4172), 75 states have internal predecessors, (4172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:16:53,909 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:16:53,909 INFO L200 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] [2022-07-13 22:16:53,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 22:16:54,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:16:54,129 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-13 22:16:54,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:16:54,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1877669674, now seen corresponding path program 5 times [2022-07-13 22:16:54,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:16:54,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271437092] [2022-07-13 22:16:54,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:16:54,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:16:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:16:54,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:16:54,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:16:54,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271437092] [2022-07-13 22:16:54,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271437092] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:16:54,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720939005] [2022-07-13 22:16:54,700 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 22:16:54,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:16:54,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:16:54,701 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:16:54,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 22:16:54,778 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 22:16:54,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:16:54,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-13 22:16:54,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:16:55,461 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:16:55,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 43 [2022-07-13 22:16:55,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 22:16:55,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:16:55,947 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:16:55,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 51 [2022-07-13 22:16:56,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 22:16:56,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720939005] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:16:56,328 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:16:56,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21, 15] total 50 [2022-07-13 22:16:56,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095026556] [2022-07-13 22:16:56,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:16:56,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-13 22:16:56,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:16:56,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-13 22:16:56,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=2127, Unknown=0, NotChecked=0, Total=2450 [2022-07-13 22:16:56,333 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 153 [2022-07-13 22:16:56,335 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 1210 transitions, 17244 flow. Second operand has 50 states, 50 states have (on average 68.68) internal successors, (3434), 50 states have internal predecessors, (3434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:16:56,335 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:16:56,335 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 153 [2022-07-13 22:16:56,335 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:17:20,663 INFO L129 PetriNetUnfolder]: 33500/55434 cut-off events. [2022-07-13 22:17:20,664 INFO L130 PetriNetUnfolder]: For 990628/990807 co-relation queries the response was YES. [2022-07-13 22:17:22,588 INFO L84 FinitePrefix]: Finished finitePrefix Result has 363867 conditions, 55434 events. 33500/55434 cut-off events. For 990628/990807 co-relation queries the response was YES. Maximal size of possible extension queue 3017. Compared 504665 event pairs, 4559 based on Foata normal form. 25/55133 useless extension candidates. Maximal degree in co-relation 363743. Up to 29456 conditions per place. [2022-07-13 22:17:22,942 INFO L132 encePairwiseOnDemand]: 115/153 looper letters, 1097 selfloop transitions, 1793 changer transitions 7/2949 dead transitions. [2022-07-13 22:17:22,942 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 2949 transitions, 47556 flow [2022-07-13 22:17:22,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-07-13 22:17:22,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2022-07-13 22:17:22,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 7553 transitions. [2022-07-13 22:17:22,949 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.47467320261437906 [2022-07-13 22:17:22,950 INFO L72 ComplementDD]: Start complementDD. Operand 104 states and 7553 transitions. [2022-07-13 22:17:22,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 7553 transitions. [2022-07-13 22:17:22,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:17:22,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 104 states and 7553 transitions. [2022-07-13 22:17:22,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 105 states, 104 states have (on average 72.625) internal successors, (7553), 104 states have internal predecessors, (7553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:17:22,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 105 states, 105 states have (on average 153.0) internal successors, (16065), 105 states have internal predecessors, (16065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:17:22,974 INFO L81 ComplementDD]: Finished complementDD. Result has 105 states, 105 states have (on average 153.0) internal successors, (16065), 105 states have internal predecessors, (16065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:17:22,975 INFO L186 Difference]: Start difference. First operand has 444 places, 1210 transitions, 17244 flow. Second operand 104 states and 7553 transitions. [2022-07-13 22:17:22,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 2949 transitions, 47556 flow