./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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-hom.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 ceb4cfb737a49cea9ea1be451c16ebb29f48ae611a8c94fc546ca2e3471f0eb3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 10:34:35,547 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 10:34:35,549 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 10:34:35,591 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 10:34:35,591 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 10:34:35,593 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 10:34:35,594 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 10:34:35,596 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 10:34:35,598 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 10:34:35,602 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 10:34:35,603 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 10:34:35,608 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 10:34:35,608 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 10:34:35,610 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 10:34:35,611 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 10:34:35,614 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 10:34:35,614 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 10:34:35,615 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 10:34:35,617 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 10:34:35,622 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 10:34:35,623 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 10:34:35,624 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 10:34:35,624 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 10:34:35,625 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 10:34:35,626 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 10:34:35,632 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 10:34:35,633 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 10:34:35,633 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 10:34:35,634 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 10:34:35,635 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 10:34:35,636 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 10:34:35,636 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 10:34:35,637 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 10:34:35,638 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 10:34:35,638 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 10:34:35,639 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 10:34:35,640 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 10:34:35,640 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 10:34:35,641 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 10:34:35,641 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 10:34:35,641 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 10:34:35,643 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 10:34:35,643 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 10:34:35,669 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 10:34:35,670 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 10:34:35,670 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 10:34:35,670 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 10:34:35,671 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 10:34:35,671 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 10:34:35,672 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 10:34:35,672 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 10:34:35,672 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 10:34:35,673 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 10:34:35,673 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 10:34:35,673 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 10:34:35,673 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 10:34:35,673 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 10:34:35,673 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 10:34:35,674 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 10:34:35,674 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 10:34:35,674 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 10:34:35,674 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 10:34:35,674 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 10:34:35,675 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 10:34:35,675 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 10:34:35,675 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 10:34:35,675 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 10:34:35,675 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:34:35,675 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 10:34:35,676 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 10:34:35,676 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 10:34:35,676 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 10:34:35,676 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 10:34:35,676 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 10:34:35,677 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 10:34:35,677 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 10:34:35,677 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 -> ceb4cfb737a49cea9ea1be451c16ebb29f48ae611a8c94fc546ca2e3471f0eb3 [2022-07-12 10:34:35,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 10:34:35,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 10:34:35,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 10:34:35,928 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 10:34:35,929 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 10:34:35,931 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c [2022-07-12 10:34:36,002 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a2b419cc/7740e6aadbb74c509d74d8b725655230/FLAG49e4f141a [2022-07-12 10:34:36,339 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 10:34:36,340 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c [2022-07-12 10:34:36,346 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a2b419cc/7740e6aadbb74c509d74d8b725655230/FLAG49e4f141a [2022-07-12 10:34:36,769 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a2b419cc/7740e6aadbb74c509d74d8b725655230 [2022-07-12 10:34:36,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 10:34:36,774 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 10:34:36,778 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 10:34:36,778 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 10:34:36,781 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 10:34:36,782 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:34:36" (1/1) ... [2022-07-12 10:34:36,782 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@742e5592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:34:36, skipping insertion in model container [2022-07-12 10:34:36,783 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:34:36" (1/1) ... [2022-07-12 10:34:36,788 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 10:34:36,807 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 10:34:36,965 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-hom.wvr.c[2586,2599] [2022-07-12 10:34:36,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:34:36,984 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 10:34:37,001 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-hom.wvr.c[2586,2599] [2022-07-12 10:34:37,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:34:37,017 INFO L208 MainTranslator]: Completed translation [2022-07-12 10:34:37,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:34:37 WrapperNode [2022-07-12 10:34:37,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 10:34:37,019 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 10:34:37,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 10:34:37,019 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 10:34:37,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:34:37" (1/1) ... [2022-07-12 10:34:37,036 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:34:37" (1/1) ... [2022-07-12 10:34:37,053 INFO L137 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 106 [2022-07-12 10:34:37,054 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 10:34:37,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 10:34:37,055 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 10:34:37,055 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 10:34:37,065 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:34:37" (1/1) ... [2022-07-12 10:34:37,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:34:37" (1/1) ... [2022-07-12 10:34:37,068 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:34:37" (1/1) ... [2022-07-12 10:34:37,068 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:34:37" (1/1) ... [2022-07-12 10:34:37,075 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:34:37" (1/1) ... [2022-07-12 10:34:37,078 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:34:37" (1/1) ... [2022-07-12 10:34:37,080 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:34:37" (1/1) ... [2022-07-12 10:34:37,082 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 10:34:37,083 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 10:34:37,083 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 10:34:37,083 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 10:34:37,092 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:34:37" (1/1) ... [2022-07-12 10:34:37,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:34:37,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:34:37,113 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-12 10:34:37,123 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-12 10:34:37,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 10:34:37,147 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-12 10:34:37,147 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-12 10:34:37,147 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-12 10:34:37,148 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-12 10:34:37,148 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-12 10:34:37,148 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-12 10:34:37,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 10:34:37,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 10:34:37,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 10:34:37,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-12 10:34:37,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-12 10:34:37,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 10:34:37,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 10:34:37,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 10:34:37,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 10:34:37,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 10:34:37,152 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-12 10:34:37,280 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 10:34:37,281 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 10:34:37,553 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 10:34:37,599 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 10:34:37,600 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-12 10:34:37,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:34:37 BoogieIcfgContainer [2022-07-12 10:34:37,602 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 10:34:37,604 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 10:34:37,604 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 10:34:37,612 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 10:34:37,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 10:34:36" (1/3) ... [2022-07-12 10:34:37,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7565ed60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:34:37, skipping insertion in model container [2022-07-12 10:34:37,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:34:37" (2/3) ... [2022-07-12 10:34:37,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7565ed60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:34:37, skipping insertion in model container [2022-07-12 10:34:37,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:34:37" (3/3) ... [2022-07-12 10:34:37,615 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array-hom.wvr.c [2022-07-12 10:34:37,619 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-12 10:34:37,626 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 10:34:37,626 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 10:34:37,626 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-12 10:34:37,673 INFO L135 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-12 10:34:37,717 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 156 places, 159 transitions, 342 flow [2022-07-12 10:34:37,839 INFO L129 PetriNetUnfolder]: 13/156 cut-off events. [2022-07-12 10:34:37,839 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-12 10:34:37,843 INFO L84 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 156 events. 13/156 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 97 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 113. Up to 2 conditions per place. [2022-07-12 10:34:37,843 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 159 transitions, 342 flow [2022-07-12 10:34:37,851 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 145 transitions, 308 flow [2022-07-12 10:34:37,868 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:34:37,877 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@2078bcb9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7353ef31 [2022-07-12 10:34:37,877 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-07-12 10:34:37,923 INFO L129 PetriNetUnfolder]: 13/144 cut-off events. [2022-07-12 10:34:37,931 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-12 10:34:37,932 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:34:37,933 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] [2022-07-12 10:34:37,933 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-12 10:34:37,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:34:37,939 INFO L85 PathProgramCache]: Analyzing trace with hash 379312160, now seen corresponding path program 1 times [2022-07-12 10:34:37,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:34:37,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681455327] [2022-07-12 10:34:37,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:34:37,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:34:38,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:34:38,191 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-12 10:34:38,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:34:38,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681455327] [2022-07-12 10:34:38,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681455327] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:34:38,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:34:38,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 10:34:38,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693988178] [2022-07-12 10:34:38,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:34:38,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 10:34:38,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:34:38,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 10:34:38,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 10:34:38,237 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 159 [2022-07-12 10:34:38,242 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 145 transitions, 308 flow. Second operand has 2 states, 2 states have (on average 145.5) internal successors, (291), 2 states have internal predecessors, (291), 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-12 10:34:38,243 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:34:38,243 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 159 [2022-07-12 10:34:38,243 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:34:38,319 INFO L129 PetriNetUnfolder]: 42/270 cut-off events. [2022-07-12 10:34:38,319 INFO L130 PetriNetUnfolder]: For 50/51 co-relation queries the response was YES. [2022-07-12 10:34:38,324 INFO L84 FinitePrefix]: Finished finitePrefix Result has 361 conditions, 270 events. 42/270 cut-off events. For 50/51 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/281 useless extension candidates. Maximal degree in co-relation 216. Up to 59 conditions per place. [2022-07-12 10:34:38,327 INFO L132 encePairwiseOnDemand]: 151/159 looper letters, 9 selfloop transitions, 0 changer transitions 4/137 dead transitions. [2022-07-12 10:34:38,327 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 137 transitions, 310 flow [2022-07-12 10:34:38,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 10:34:38,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-12 10:34:38,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 299 transitions. [2022-07-12 10:34:38,339 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.940251572327044 [2022-07-12 10:34:38,340 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 299 transitions. [2022-07-12 10:34:38,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 299 transitions. [2022-07-12 10:34:38,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:34:38,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 299 transitions. [2022-07-12 10:34:38,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 149.5) internal successors, (299), 2 states have internal predecessors, (299), 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-12 10:34:38,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 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-12 10:34:38,350 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 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-12 10:34:38,352 INFO L186 Difference]: Start difference. First operand has 142 places, 145 transitions, 308 flow. Second operand 2 states and 299 transitions. [2022-07-12 10:34:38,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 137 transitions, 310 flow [2022-07-12 10:34:38,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 137 transitions, 298 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-07-12 10:34:38,358 INFO L242 Difference]: Finished difference. Result has 137 places, 133 transitions, 272 flow [2022-07-12 10:34:38,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=272, PETRI_PLACES=137, PETRI_TRANSITIONS=133} [2022-07-12 10:34:38,363 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, -5 predicate places. [2022-07-12 10:34:38,364 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 133 transitions, 272 flow [2022-07-12 10:34:38,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 145.5) internal successors, (291), 2 states have internal predecessors, (291), 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-12 10:34:38,364 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:34:38,364 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] [2022-07-12 10:34:38,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 10:34:38,365 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-12 10:34:38,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:34:38,366 INFO L85 PathProgramCache]: Analyzing trace with hash 191455911, now seen corresponding path program 1 times [2022-07-12 10:34:38,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:34:38,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596315978] [2022-07-12 10:34:38,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:34:38,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:34:38,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:34:38,698 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-12 10:34:38,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:34:38,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596315978] [2022-07-12 10:34:38,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596315978] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:34:38,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:34:38,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 10:34:38,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930171641] [2022-07-12 10:34:38,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:34:38,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:34:38,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:34:38,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:34:38,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:34:38,707 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 159 [2022-07-12 10:34:38,716 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 133 transitions, 272 flow. Second operand has 8 states, 8 states have (on average 104.5) internal successors, (836), 8 states have internal predecessors, (836), 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-12 10:34:38,716 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:34:38,716 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 159 [2022-07-12 10:34:38,717 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:34:38,994 INFO L129 PetriNetUnfolder]: 296/684 cut-off events. [2022-07-12 10:34:38,998 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-07-12 10:34:39,000 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1143 conditions, 684 events. 296/684 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2962 event pairs, 167 based on Foata normal form. 1/515 useless extension candidates. Maximal degree in co-relation 1140. Up to 421 conditions per place. [2022-07-12 10:34:39,004 INFO L132 encePairwiseOnDemand]: 149/159 looper letters, 44 selfloop transitions, 6 changer transitions 4/141 dead transitions. [2022-07-12 10:34:39,005 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 141 transitions, 396 flow [2022-07-12 10:34:39,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 10:34:39,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-12 10:34:39,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 855 transitions. [2022-07-12 10:34:39,012 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.6721698113207547 [2022-07-12 10:34:39,012 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 855 transitions. [2022-07-12 10:34:39,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 855 transitions. [2022-07-12 10:34:39,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:34:39,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 855 transitions. [2022-07-12 10:34:39,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 106.875) internal successors, (855), 8 states have internal predecessors, (855), 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-12 10:34:39,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 159.0) internal successors, (1431), 9 states have internal predecessors, (1431), 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-12 10:34:39,022 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 159.0) internal successors, (1431), 9 states have internal predecessors, (1431), 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-12 10:34:39,022 INFO L186 Difference]: Start difference. First operand has 137 places, 133 transitions, 272 flow. Second operand 8 states and 855 transitions. [2022-07-12 10:34:39,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 141 transitions, 396 flow [2022-07-12 10:34:39,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 141 transitions, 396 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-12 10:34:39,029 INFO L242 Difference]: Finished difference. Result has 144 places, 134 transitions, 300 flow [2022-07-12 10:34:39,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=300, PETRI_PLACES=144, PETRI_TRANSITIONS=134} [2022-07-12 10:34:39,031 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 2 predicate places. [2022-07-12 10:34:39,031 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 134 transitions, 300 flow [2022-07-12 10:34:39,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 104.5) internal successors, (836), 8 states have internal predecessors, (836), 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-12 10:34:39,032 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:34:39,032 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] [2022-07-12 10:34:39,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 10:34:39,033 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-12 10:34:39,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:34:39,034 INFO L85 PathProgramCache]: Analyzing trace with hash -553736524, now seen corresponding path program 1 times [2022-07-12 10:34:39,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:34:39,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998946165] [2022-07-12 10:34:39,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:34:39,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:34:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:34:39,207 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-12 10:34:39,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:34:39,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998946165] [2022-07-12 10:34:39,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998946165] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:34:39,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982066469] [2022-07-12 10:34:39,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:34:39,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:34:39,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:34:39,212 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-12 10:34:39,213 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-12 10:34:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:34:39,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 10:34:39,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:34:39,549 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-12 10:34:39,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:34:39,759 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-12 10:34:39,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982066469] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-12 10:34:39,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-12 10:34:39,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-07-12 10:34:39,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774627444] [2022-07-12 10:34:39,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:34:39,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:34:39,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:34:39,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:34:39,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-07-12 10:34:39,766 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 159 [2022-07-12 10:34:39,767 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 134 transitions, 300 flow. Second operand has 7 states, 7 states have (on average 122.42857142857143) internal successors, (857), 7 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-12 10:34:39,767 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:34:39,767 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 159 [2022-07-12 10:34:39,767 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:34:39,908 INFO L129 PetriNetUnfolder]: 183/623 cut-off events. [2022-07-12 10:34:39,909 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-07-12 10:34:39,911 INFO L84 FinitePrefix]: Finished finitePrefix Result has 949 conditions, 623 events. 183/623 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3079 event pairs, 80 based on Foata normal form. 0/532 useless extension candidates. Maximal degree in co-relation 941. Up to 141 conditions per place. [2022-07-12 10:34:39,913 INFO L132 encePairwiseOnDemand]: 151/159 looper letters, 33 selfloop transitions, 7 changer transitions 0/142 dead transitions. [2022-07-12 10:34:39,913 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 142 transitions, 398 flow [2022-07-12 10:34:39,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 10:34:39,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-12 10:34:39,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 873 transitions. [2022-07-12 10:34:39,916 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.784366576819407 [2022-07-12 10:34:39,916 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 873 transitions. [2022-07-12 10:34:39,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 873 transitions. [2022-07-12 10:34:39,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:34:39,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 873 transitions. [2022-07-12 10:34:39,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.71428571428571) internal successors, (873), 7 states have internal predecessors, (873), 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-12 10:34:39,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 159.0) internal successors, (1272), 8 states have internal predecessors, (1272), 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-12 10:34:39,922 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 159.0) internal successors, (1272), 8 states have internal predecessors, (1272), 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-12 10:34:39,922 INFO L186 Difference]: Start difference. First operand has 144 places, 134 transitions, 300 flow. Second operand 7 states and 873 transitions. [2022-07-12 10:34:39,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 142 transitions, 398 flow [2022-07-12 10:34:39,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 142 transitions, 380 flow, removed 3 selfloop flow, removed 7 redundant places. [2022-07-12 10:34:39,926 INFO L242 Difference]: Finished difference. Result has 144 places, 136 transitions, 315 flow [2022-07-12 10:34:39,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=315, PETRI_PLACES=144, PETRI_TRANSITIONS=136} [2022-07-12 10:34:39,928 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 2 predicate places. [2022-07-12 10:34:39,928 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 136 transitions, 315 flow [2022-07-12 10:34:39,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.42857142857143) internal successors, (857), 7 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-12 10:34:39,932 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:34:39,932 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] [2022-07-12 10:34:39,956 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-12 10:34:40,147 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-12 10:34:40,148 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-12 10:34:40,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:34:40,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1840372881, now seen corresponding path program 1 times [2022-07-12 10:34:40,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:34:40,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286751253] [2022-07-12 10:34:40,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:34:40,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:34:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:34:40,307 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-12 10:34:40,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:34:40,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286751253] [2022-07-12 10:34:40,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286751253] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:34:40,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863569340] [2022-07-12 10:34:40,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:34:40,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:34:40,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:34:40,312 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-12 10:34:40,320 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-12 10:34:40,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:34:40,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 10:34:40,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:34:40,599 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-12 10:34:40,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:34:40,795 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-12 10:34:40,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863569340] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-12 10:34:40,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-12 10:34:40,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-07-12 10:34:40,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830134260] [2022-07-12 10:34:40,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:34:40,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:34:40,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:34:40,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:34:40,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-07-12 10:34:40,801 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 159 [2022-07-12 10:34:40,803 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 136 transitions, 315 flow. Second operand has 9 states, 9 states have (on average 115.33333333333333) internal successors, (1038), 9 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:40,803 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:34:40,803 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 159 [2022-07-12 10:34:40,803 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:34:41,169 INFO L129 PetriNetUnfolder]: 850/1566 cut-off events. [2022-07-12 10:34:41,169 INFO L130 PetriNetUnfolder]: For 646/901 co-relation queries the response was YES. [2022-07-12 10:34:41,173 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3303 conditions, 1566 events. 850/1566 cut-off events. For 646/901 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8601 event pairs, 213 based on Foata normal form. 255/1656 useless extension candidates. Maximal degree in co-relation 3295. Up to 429 conditions per place. [2022-07-12 10:34:41,182 INFO L132 encePairwiseOnDemand]: 148/159 looper letters, 84 selfloop transitions, 17 changer transitions 0/196 dead transitions. [2022-07-12 10:34:41,183 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 196 transitions, 688 flow [2022-07-12 10:34:41,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 10:34:41,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-12 10:34:41,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1327 transitions. [2022-07-12 10:34:41,186 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7587192681532304 [2022-07-12 10:34:41,186 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1327 transitions. [2022-07-12 10:34:41,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1327 transitions. [2022-07-12 10:34:41,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:34:41,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1327 transitions. [2022-07-12 10:34:41,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 120.63636363636364) internal successors, (1327), 11 states have internal predecessors, (1327), 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-12 10:34:41,193 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 159.0) internal successors, (1908), 12 states have internal predecessors, (1908), 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-12 10:34:41,193 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 159.0) internal successors, (1908), 12 states have internal predecessors, (1908), 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-12 10:34:41,193 INFO L186 Difference]: Start difference. First operand has 144 places, 136 transitions, 315 flow. Second operand 11 states and 1327 transitions. [2022-07-12 10:34:41,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 196 transitions, 688 flow [2022-07-12 10:34:41,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 196 transitions, 675 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-12 10:34:41,198 INFO L242 Difference]: Finished difference. Result has 154 places, 147 transitions, 395 flow [2022-07-12 10:34:41,198 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=395, PETRI_PLACES=154, PETRI_TRANSITIONS=147} [2022-07-12 10:34:41,199 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 12 predicate places. [2022-07-12 10:34:41,199 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 147 transitions, 395 flow [2022-07-12 10:34:41,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.33333333333333) internal successors, (1038), 9 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:41,200 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:34:41,200 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] [2022-07-12 10:34:41,230 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-12 10:34:41,411 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-12 10:34:41,412 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-12 10:34:41,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:34:41,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1817451035, now seen corresponding path program 2 times [2022-07-12 10:34:41,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:34:41,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596900521] [2022-07-12 10:34:41,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:34:41,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:34:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:34:41,510 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-12 10:34:41,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:34:41,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596900521] [2022-07-12 10:34:41,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596900521] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:34:41,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792021251] [2022-07-12 10:34:41,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 10:34:41,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:34:41,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:34:41,512 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-12 10:34:41,515 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-12 10:34:41,600 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 10:34:41,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:34:41,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 10:34:41,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:34:41,791 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-12 10:34:41,791 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:34:41,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792021251] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:34:41,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:34:41,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-07-12 10:34:41,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894727109] [2022-07-12 10:34:41,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:34:41,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:34:41,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:34:41,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:34:41,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-07-12 10:34:41,795 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 159 [2022-07-12 10:34:41,796 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 147 transitions, 395 flow. Second operand has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 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-12 10:34:41,796 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:34:41,796 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 159 [2022-07-12 10:34:41,796 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:34:42,088 INFO L129 PetriNetUnfolder]: 608/1360 cut-off events. [2022-07-12 10:34:42,088 INFO L130 PetriNetUnfolder]: For 932/1135 co-relation queries the response was YES. [2022-07-12 10:34:42,092 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3077 conditions, 1360 events. 608/1360 cut-off events. For 932/1135 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 7591 event pairs, 200 based on Foata normal form. 240/1566 useless extension candidates. Maximal degree in co-relation 3065. Up to 535 conditions per place. [2022-07-12 10:34:42,099 INFO L132 encePairwiseOnDemand]: 150/159 looper letters, 48 selfloop transitions, 13 changer transitions 0/160 dead transitions. [2022-07-12 10:34:42,100 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 160 transitions, 570 flow [2022-07-12 10:34:42,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 10:34:42,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-12 10:34:42,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 905 transitions. [2022-07-12 10:34:42,102 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7114779874213837 [2022-07-12 10:34:42,102 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 905 transitions. [2022-07-12 10:34:42,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 905 transitions. [2022-07-12 10:34:42,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:34:42,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 905 transitions. [2022-07-12 10:34:42,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 113.125) internal successors, (905), 8 states have internal predecessors, (905), 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-12 10:34:42,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 159.0) internal successors, (1431), 9 states have internal predecessors, (1431), 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-12 10:34:42,107 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 159.0) internal successors, (1431), 9 states have internal predecessors, (1431), 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-12 10:34:42,107 INFO L186 Difference]: Start difference. First operand has 154 places, 147 transitions, 395 flow. Second operand 8 states and 905 transitions. [2022-07-12 10:34:42,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 160 transitions, 570 flow [2022-07-12 10:34:42,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 160 transitions, 563 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-12 10:34:42,113 INFO L242 Difference]: Finished difference. Result has 159 places, 150 transitions, 456 flow [2022-07-12 10:34:42,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=456, PETRI_PLACES=159, PETRI_TRANSITIONS=150} [2022-07-12 10:34:42,114 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 17 predicate places. [2022-07-12 10:34:42,114 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 150 transitions, 456 flow [2022-07-12 10:34:42,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 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-12 10:34:42,115 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:34:42,115 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, 1, 1, 1, 1] [2022-07-12 10:34:42,139 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-12 10:34:42,331 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-12 10:34:42,332 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-12 10:34:42,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:34:42,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1490878222, now seen corresponding path program 1 times [2022-07-12 10:34:42,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:34:42,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170604184] [2022-07-12 10:34:42,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:34:42,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:34:42,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:34:43,197 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-12 10:34:43,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:34:43,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170604184] [2022-07-12 10:34:43,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170604184] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:34:43,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765471004] [2022-07-12 10:34:43,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:34:43,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:34:43,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:34:43,200 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-12 10:34:43,227 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-12 10:34:43,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:34:43,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-12 10:34:43,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:34:44,419 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-07-12 10:34:44,420 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 36 [2022-07-12 10:34:44,617 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-12 10:34:44,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:34:44,946 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:34:44,946 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-12 10:34:45,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:34:45,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765471004] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:34:45,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:34:45,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 21, 21] total 58 [2022-07-12 10:34:45,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048897741] [2022-07-12 10:34:45,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:34:45,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-07-12 10:34:45,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:34:45,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-07-12 10:34:45,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=584, Invalid=2722, Unknown=0, NotChecked=0, Total=3306 [2022-07-12 10:34:45,806 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 159 [2022-07-12 10:34:45,810 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 150 transitions, 456 flow. Second operand has 58 states, 58 states have (on average 71.39655172413794) internal successors, (4141), 58 states have internal predecessors, (4141), 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-12 10:34:45,811 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:34:45,811 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 159 [2022-07-12 10:34:45,811 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:34:51,586 INFO L129 PetriNetUnfolder]: 8356/13792 cut-off events. [2022-07-12 10:34:51,587 INFO L130 PetriNetUnfolder]: For 14091/14450 co-relation queries the response was YES. [2022-07-12 10:34:51,639 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36671 conditions, 13792 events. 8356/13792 cut-off events. For 14091/14450 co-relation queries the response was YES. Maximal size of possible extension queue 769. Compared 102262 event pairs, 982 based on Foata normal form. 275/13847 useless extension candidates. Maximal degree in co-relation 36657. Up to 3808 conditions per place. [2022-07-12 10:34:51,724 INFO L132 encePairwiseOnDemand]: 114/159 looper letters, 427 selfloop transitions, 136 changer transitions 21/642 dead transitions. [2022-07-12 10:34:51,725 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 642 transitions, 3741 flow [2022-07-12 10:34:51,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-07-12 10:34:51,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2022-07-12 10:34:51,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 4837 transitions. [2022-07-12 10:34:51,737 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.47533411949685533 [2022-07-12 10:34:51,737 INFO L72 ComplementDD]: Start complementDD. Operand 64 states and 4837 transitions. [2022-07-12 10:34:51,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 4837 transitions. [2022-07-12 10:34:51,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:34:51,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 64 states and 4837 transitions. [2022-07-12 10:34:51,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 65 states, 64 states have (on average 75.578125) internal successors, (4837), 64 states have internal predecessors, (4837), 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-12 10:34:51,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 65 states, 65 states have (on average 159.0) internal successors, (10335), 65 states have internal predecessors, (10335), 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-12 10:34:51,768 INFO L81 ComplementDD]: Finished complementDD. Result has 65 states, 65 states have (on average 159.0) internal successors, (10335), 65 states have internal predecessors, (10335), 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-12 10:34:51,769 INFO L186 Difference]: Start difference. First operand has 159 places, 150 transitions, 456 flow. Second operand 64 states and 4837 transitions. [2022-07-12 10:34:51,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 642 transitions, 3741 flow [2022-07-12 10:34:51,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 642 transitions, 3608 flow, removed 11 selfloop flow, removed 5 redundant places. [2022-07-12 10:34:51,868 INFO L242 Difference]: Finished difference. Result has 266 places, 270 transitions, 1618 flow [2022-07-12 10:34:51,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=64, PETRI_FLOW=1618, PETRI_PLACES=266, PETRI_TRANSITIONS=270} [2022-07-12 10:34:51,872 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 124 predicate places. [2022-07-12 10:34:51,872 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 270 transitions, 1618 flow [2022-07-12 10:34:51,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 71.39655172413794) internal successors, (4141), 58 states have internal predecessors, (4141), 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-12 10:34:51,874 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:34:51,874 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, 1, 1, 1, 1] [2022-07-12 10:34:51,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 10:34:52,087 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-12 10:34:52,087 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-12 10:34:52,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:34:52,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1409400304, now seen corresponding path program 2 times [2022-07-12 10:34:52,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:34:52,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3734289] [2022-07-12 10:34:52,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:34:52,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:34:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:34:52,887 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-12 10:34:52,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:34:52,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3734289] [2022-07-12 10:34:52,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3734289] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:34:52,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456353998] [2022-07-12 10:34:52,888 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 10:34:52,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:34:52,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:34:52,892 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-12 10:34:52,903 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-12 10:34:52,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 10:34:52,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:34:53,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-12 10:34:53,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:34:53,105 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-12 10:34:53,379 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 10:34:53,380 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 11 treesize of output 11 [2022-07-12 10:34:53,557 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 11 treesize of output 7 [2022-07-12 10:34:53,834 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-12 10:34:53,950 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-12 10:34:54,073 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-12 10:34:54,552 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:34:54,553 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-12 10:34:54,993 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-12 10:34:54,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:34:59,191 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:34:59,192 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 94 treesize of output 70 [2022-07-12 10:34:59,208 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-07-12 10:34:59,208 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 3473 treesize of output 3317 [2022-07-12 10:34:59,261 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-07-12 10:34:59,262 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 3313 treesize of output 3093 [2022-07-12 10:34:59,314 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-07-12 10:34:59,315 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 3089 treesize of output 2981 [2022-07-12 10:34:59,366 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-07-12 10:34:59,367 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 2977 treesize of output 2533 [2022-07-12 10:35:18,605 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:35:18,606 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 61 treesize of output 49 [2022-07-12 10:35:18,619 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-07-12 10:35:18,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 2187 treesize of output 2095 [2022-07-12 10:35:18,660 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-07-12 10:35:18,661 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 2091 treesize of output 1839 [2022-07-12 10:35:18,698 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-07-12 10:35:18,699 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 1835 treesize of output 1711 [2022-07-12 10:35:18,734 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-07-12 10:35:18,735 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 1707 treesize of output 1647 [2022-07-12 10:35:34,768 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 10:35:34,769 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 90 treesize of output 1 [2022-07-12 10:35:34,781 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 10:35:34,781 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 123 treesize of output 1 [2022-07-12 10:35:34,987 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-12 10:35:35,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:35:35,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456353998] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:35:35,048 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:35:35,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30, 26] total 71 [2022-07-12 10:35:35,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896167377] [2022-07-12 10:35:35,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:35:35,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-07-12 10:35:35,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:35:35,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-07-12 10:35:35,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=929, Invalid=3958, Unknown=83, NotChecked=0, Total=4970 [2022-07-12 10:35:35,055 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 159 [2022-07-12 10:35:35,058 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 270 transitions, 1618 flow. Second operand has 71 states, 71 states have (on average 55.985915492957744) internal successors, (3975), 71 states have internal predecessors, (3975), 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-12 10:35:35,058 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:35:35,058 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 159 [2022-07-12 10:35:35,058 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:35:44,816 INFO L129 PetriNetUnfolder]: 16654/26391 cut-off events. [2022-07-12 10:35:44,816 INFO L130 PetriNetUnfolder]: For 140399/140469 co-relation queries the response was YES. [2022-07-12 10:35:45,005 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103517 conditions, 26391 events. 16654/26391 cut-off events. For 140399/140469 co-relation queries the response was YES. Maximal size of possible extension queue 1450. Compared 205594 event pairs, 2813 based on Foata normal form. 13/26248 useless extension candidates. Maximal degree in co-relation 103455. Up to 10413 conditions per place. [2022-07-12 10:35:45,192 INFO L132 encePairwiseOnDemand]: 117/159 looper letters, 453 selfloop transitions, 414 changer transitions 18/932 dead transitions. [2022-07-12 10:35:45,192 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 932 transitions, 8233 flow [2022-07-12 10:35:45,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-07-12 10:35:45,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2022-07-12 10:35:45,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 4006 transitions. [2022-07-12 10:35:45,203 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.3817419477796836 [2022-07-12 10:35:45,203 INFO L72 ComplementDD]: Start complementDD. Operand 66 states and 4006 transitions. [2022-07-12 10:35:45,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 4006 transitions. [2022-07-12 10:35:45,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:35:45,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 66 states and 4006 transitions. [2022-07-12 10:35:45,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 67 states, 66 states have (on average 60.696969696969695) internal successors, (4006), 66 states have internal predecessors, (4006), 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-12 10:35:45,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 67 states, 67 states have (on average 159.0) internal successors, (10653), 67 states have internal predecessors, (10653), 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-12 10:35:45,243 INFO L81 ComplementDD]: Finished complementDD. Result has 67 states, 67 states have (on average 159.0) internal successors, (10653), 67 states have internal predecessors, (10653), 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-12 10:35:45,243 INFO L186 Difference]: Start difference. First operand has 266 places, 270 transitions, 1618 flow. Second operand 66 states and 4006 transitions. [2022-07-12 10:35:45,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 932 transitions, 8233 flow [2022-07-12 10:35:46,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 932 transitions, 8033 flow, removed 52 selfloop flow, removed 27 redundant places. [2022-07-12 10:35:46,120 INFO L242 Difference]: Finished difference. Result has 325 places, 630 transitions, 6327 flow [2022-07-12 10:35:46,120 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=1537, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=66, PETRI_FLOW=6327, PETRI_PLACES=325, PETRI_TRANSITIONS=630} [2022-07-12 10:35:46,121 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 183 predicate places. [2022-07-12 10:35:46,121 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 630 transitions, 6327 flow [2022-07-12 10:35:46,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 55.985915492957744) internal successors, (3975), 71 states have internal predecessors, (3975), 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-12 10:35:46,123 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:35:46,123 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, 1, 1, 1, 1] [2022-07-12 10:35:46,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-12 10:35:46,339 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-12 10:35:46,339 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-12 10:35:46,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:35:46,340 INFO L85 PathProgramCache]: Analyzing trace with hash -422739406, now seen corresponding path program 3 times [2022-07-12 10:35:46,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:35:46,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675478346] [2022-07-12 10:35:46,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:35:46,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:35:46,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:35:47,377 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-12 10:35:47,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:35:47,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675478346] [2022-07-12 10:35:47,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675478346] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:35:47,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773366069] [2022-07-12 10:35:47,378 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 10:35:47,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:35:47,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:35:47,379 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-12 10:35:47,379 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-12 10:35:47,459 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-12 10:35:47,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:35:47,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-12 10:35:47,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:35:48,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:35:48,268 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 47 treesize of output 45 [2022-07-12 10:35:48,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:35:48,461 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-12 10:35:48,797 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:35:48,797 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-12 10:35:49,196 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-12 10:35:49,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:35:50,273 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:35:50,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 273 treesize of output 273 [2022-07-12 10:35:50,291 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 97 treesize of output 85 [2022-07-12 10:35:50,295 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 112 treesize of output 88 [2022-07-12 10:35:50,416 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 9 treesize of output 3 [2022-07-12 10:35:50,424 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 41 treesize of output 29 [2022-07-12 10:35:51,497 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-12 10:35:51,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773366069] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:35:51,498 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:35:51,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 28, 28] total 78 [2022-07-12 10:35:51,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391074034] [2022-07-12 10:35:51,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:35:51,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-07-12 10:35:51,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:35:51,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-07-12 10:35:51,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1091, Invalid=4911, Unknown=4, NotChecked=0, Total=6006 [2022-07-12 10:35:51,505 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 159 [2022-07-12 10:35:51,508 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 630 transitions, 6327 flow. Second operand has 78 states, 78 states have (on average 63.65384615384615) internal successors, (4965), 78 states have internal predecessors, (4965), 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-12 10:35:51,508 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:35:51,508 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 159 [2022-07-12 10:35:51,508 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:36:21,196 INFO L129 PetriNetUnfolder]: 31181/55244 cut-off events. [2022-07-12 10:36:21,196 INFO L130 PetriNetUnfolder]: For 629176/631672 co-relation queries the response was YES. [2022-07-12 10:36:22,193 INFO L84 FinitePrefix]: Finished finitePrefix Result has 280355 conditions, 55244 events. 31181/55244 cut-off events. For 629176/631672 co-relation queries the response was YES. Maximal size of possible extension queue 2906. Compared 537684 event pairs, 913 based on Foata normal form. 1912/56672 useless extension candidates. Maximal degree in co-relation 280274. Up to 12560 conditions per place. [2022-07-12 10:36:22,562 INFO L132 encePairwiseOnDemand]: 111/159 looper letters, 1250 selfloop transitions, 2871 changer transitions 47/4260 dead transitions. [2022-07-12 10:36:22,563 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 536 places, 4260 transitions, 54287 flow [2022-07-12 10:36:22,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 220 states. [2022-07-12 10:36:22,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2022-07-12 10:36:22,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 14909 transitions. [2022-07-12 10:36:22,595 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.4262149799885649 [2022-07-12 10:36:22,595 INFO L72 ComplementDD]: Start complementDD. Operand 220 states and 14909 transitions. [2022-07-12 10:36:22,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 220 states and 14909 transitions. [2022-07-12 10:36:22,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:36:22,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 220 states and 14909 transitions. [2022-07-12 10:36:22,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 221 states, 220 states have (on average 67.76818181818182) internal successors, (14909), 220 states have internal predecessors, (14909), 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-12 10:36:22,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 221 states, 221 states have (on average 159.0) internal successors, (35139), 221 states have internal predecessors, (35139), 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-12 10:36:22,686 INFO L81 ComplementDD]: Finished complementDD. Result has 221 states, 221 states have (on average 159.0) internal successors, (35139), 221 states have internal predecessors, (35139), 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-12 10:36:22,687 INFO L186 Difference]: Start difference. First operand has 325 places, 630 transitions, 6327 flow. Second operand 220 states and 14909 transitions. [2022-07-12 10:36:22,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 536 places, 4260 transitions, 54287 flow [2022-07-12 10:36:29,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 511 places, 4260 transitions, 51520 flow, removed 1350 selfloop flow, removed 25 redundant places. [2022-07-12 10:36:29,166 INFO L242 Difference]: Finished difference. Result has 642 places, 3284 transitions, 47096 flow [2022-07-12 10:36:29,167 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=5802, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=630, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=388, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=220, PETRI_FLOW=47096, PETRI_PLACES=642, PETRI_TRANSITIONS=3284} [2022-07-12 10:36:29,168 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 500 predicate places. [2022-07-12 10:36:29,168 INFO L495 AbstractCegarLoop]: Abstraction has has 642 places, 3284 transitions, 47096 flow [2022-07-12 10:36:29,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 63.65384615384615) internal successors, (4965), 78 states have internal predecessors, (4965), 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-12 10:36:29,170 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:36:29,170 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, 1, 1, 1, 1] [2022-07-12 10:36:29,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 10:36:29,383 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-12 10:36:29,384 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-12 10:36:29,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:36:29,384 INFO L85 PathProgramCache]: Analyzing trace with hash -237247938, now seen corresponding path program 1 times [2022-07-12 10:36:29,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:36:29,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861256103] [2022-07-12 10:36:29,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:36:29,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:36:29,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:36:30,074 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-12 10:36:30,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:36:30,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861256103] [2022-07-12 10:36:30,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861256103] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:36:30,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154879176] [2022-07-12 10:36:30,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:36:30,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:36:30,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:36:30,076 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-12 10:36:30,101 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-12 10:36:30,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:36:30,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-12 10:36:30,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:36:30,805 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 15 treesize of output 11 [2022-07-12 10:36:31,375 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-12 10:36:31,539 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-12 10:36:31,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:36:31,797 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 27 treesize of output 27 [2022-07-12 10:36:32,022 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-07-12 10:36:32,022 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 61 treesize of output 32 [2022-07-12 10:36:32,219 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-12 10:36:32,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:36:32,455 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_265 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (not (< .cse0 c_~min2~0)) (= c_~min1~0 .cse0) (not (< .cse0 c_~min3~0))))) (or (= c_~min1~0 c_~min3~0) (forall ((v_ArrVal_265 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) c_~min3~0)) (not (< c_~min3~0 c_~min2~0)))) is different from false [2022-07-12 10:36:32,795 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (not (< c_~min3~0 c_~min2~0)))) (and (or (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264))) (let ((.cse1 (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))))) (or (< (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) c_~min3~0) (= .cse1 c_~min3~0) (not (< .cse1 c_~min1~0)))))) .cse2) (or (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264))) (or (< (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) c_~min3~0) (< (select (select .cse3 c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) c_~min1~0)))) (= c_~min1~0 c_~min3~0) .cse2) (forall ((v_ArrVal_264 (Array Int Int))) (or (forall ((v_ArrVal_265 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (not (< .cse4 c_~min2~0)) (not (< .cse4 c_~min3~0)) (= (select (select .cse5 c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) .cse4))))) (not (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) c_~min1~0)))) (forall ((v_ArrVal_264 (Array Int Int))) (or (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) c_~min1~0) (forall ((v_ArrVal_265 (Array Int Int))) (let ((.cse6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (not (< .cse6 c_~min2~0)) (= c_~min1~0 .cse6) (not (< .cse6 c_~min3~0))))))))) is different from false [2022-07-12 10:36:32,979 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (not (< c_~min3~0 c_~min2~0)))) (and (or (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264))) (let ((.cse1 (select (select .cse0 c_~A~0.base) c_~A~0.offset))) (or (< (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) c_~min3~0) (not (< .cse1 c_~min1~0)) (= c_~min3~0 .cse1))))) .cse2) (forall ((v_ArrVal_264 (Array Int Int))) (or (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264) c_~A~0.base) c_~A~0.offset) c_~min1~0) (forall ((v_ArrVal_265 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (not (< .cse3 c_~min2~0)) (= c_~min1~0 .cse3) (not (< .cse3 c_~min3~0))))))) (or (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264))) (or (< (select (select .cse4 c_~A~0.base) c_~A~0.offset) c_~min1~0) (< (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) c_~min3~0)))) (= c_~min1~0 c_~min3~0) .cse2) (forall ((v_ArrVal_264 (Array Int Int))) (or (forall ((v_ArrVal_265 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264))) (let ((.cse6 (select (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (= (select (select .cse5 c_~A~0.base) c_~A~0.offset) .cse6) (not (< .cse6 c_~min2~0)) (not (< .cse6 c_~min3~0)))))) (not (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264) c_~A~0.base) c_~A~0.offset) c_~min1~0)))))) is different from false [2022-07-12 10:36:33,069 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (not (< c_~min3~0 c_~min2~0)))) (and (or (= c_~min1~0 c_~min3~0) (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264))) (or (< (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~min1~0) (< (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) c_~min3~0)))) .cse1) (or .cse1 (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264))) (let ((.cse2 (select (select .cse3 c_~A~0.base) c_~A~0.offset))) (or (= .cse2 c_~min3~0) (not (< .cse2 c_~min1~0)) (< (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) c_~min3~0)))))) (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264) c_~A~0.base) c_~A~0.offset) c_~min1~0) (forall ((v_ArrVal_265 (Array Int Int))) (let ((.cse4 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (not (< .cse4 c_~min3~0)) (not (< .cse4 c_~min2~0)) (= c_~min1~0 .cse4)))))) (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (or (forall ((v_ArrVal_265 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264))) (let ((.cse6 (select (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (= (select (select .cse5 c_~A~0.base) c_~A~0.offset) .cse6) (not (< .cse6 c_~min3~0)) (not (< .cse6 c_~min2~0)))))) (not (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264) c_~A~0.base) c_~A~0.offset) c_~min1~0)))))) is different from false [2022-07-12 10:36:33,237 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse1 (not (< c_~min3~0 c_~min2~0)))) (and (or (= c_~min1~0 c_~min3~0) (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264))) (or (< (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~min1~0) (< (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) c_~min3~0)))) .cse1) (or .cse1 (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264))) (let ((.cse2 (select (select .cse3 c_~A~0.base) c_~A~0.offset))) (or (= .cse2 c_~min3~0) (not (< .cse2 c_~min1~0)) (< (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) c_~min3~0)))))) (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264) c_~A~0.base) c_~A~0.offset) c_~min1~0) (forall ((v_ArrVal_265 (Array Int Int))) (let ((.cse4 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (not (< .cse4 c_~min3~0)) (not (< .cse4 c_~min2~0)) (= c_~min1~0 .cse4)))))) (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (or (forall ((v_ArrVal_265 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264))) (let ((.cse6 (select (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (= (select (select .cse5 c_~A~0.base) c_~A~0.offset) .cse6) (not (< .cse6 c_~min3~0)) (not (< .cse6 c_~min2~0)))))) (not (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264) c_~A~0.base) c_~A~0.offset) c_~min1~0)))))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) is different from false [2022-07-12 10:36:33,286 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse1 (not (< c_~min3~0 c_~min2~0)))) (and (or (= c_~min1~0 c_~min3~0) (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264))) (or (< (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~min1~0) (< (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) c_~min3~0)))) .cse1) (or .cse1 (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264))) (let ((.cse2 (select (select .cse3 c_~A~0.base) c_~A~0.offset))) (or (= .cse2 c_~min3~0) (not (< .cse2 c_~min1~0)) (< (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) c_~min3~0)))))) (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264) c_~A~0.base) c_~A~0.offset) c_~min1~0) (forall ((v_ArrVal_265 (Array Int Int))) (let ((.cse4 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (not (< .cse4 c_~min3~0)) (not (< .cse4 c_~min2~0)) (= c_~min1~0 .cse4)))))) (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (or (forall ((v_ArrVal_265 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264))) (let ((.cse6 (select (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (= (select (select .cse5 c_~A~0.base) c_~A~0.offset) .cse6) (not (< .cse6 c_~min3~0)) (not (< .cse6 c_~min2~0)))))) (not (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264) c_~A~0.base) c_~A~0.offset) c_~min1~0)))))) (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) is different from false [2022-07-12 10:36:36,154 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:36:36,154 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 147 treesize of output 99 [2022-07-12 10:36:36,190 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:36:36,190 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 13820 treesize of output 12672 [2022-07-12 10:36:36,276 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:36:36,277 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 12660 treesize of output 11932 [2022-07-12 10:36:36,360 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 11810 treesize of output 9890 [2022-07-12 10:36:36,447 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:36:36,448 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 10000 treesize of output 8532