./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-inc-subseq.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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-inc-subseq.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 cd94157895dc71e9f24fce5dbc4a71d4e4b55c4da9be28372139a3001decae0a --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 21:50:41,032 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 21:50:41,034 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 21:50:41,080 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 21:50:41,081 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 21:50:41,082 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 21:50:41,085 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 21:50:41,090 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 21:50:41,092 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 21:50:41,097 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 21:50:41,098 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 21:50:41,100 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 21:50:41,101 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 21:50:41,103 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 21:50:41,104 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 21:50:41,107 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 21:50:41,108 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 21:50:41,109 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 21:50:41,111 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 21:50:41,114 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 21:50:41,118 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 21:50:41,119 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 21:50:41,120 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 21:50:41,121 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 21:50:41,122 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 21:50:41,126 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 21:50:41,126 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 21:50:41,127 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 21:50:41,128 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 21:50:41,128 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 21:50:41,129 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 21:50:41,131 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 21:50:41,132 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 21:50:41,133 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 21:50:41,133 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 21:50:41,134 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 21:50:41,134 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 21:50:41,135 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 21:50:41,135 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 21:50:41,135 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 21:50:41,136 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 21:50:41,137 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 21:50:41,139 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 21:50:41,171 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 21:50:41,172 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 21:50:41,172 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 21:50:41,172 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 21:50:41,173 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 21:50:41,173 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 21:50:41,174 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 21:50:41,174 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 21:50:41,174 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 21:50:41,175 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 21:50:41,175 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 21:50:41,175 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 21:50:41,175 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 21:50:41,176 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 21:50:41,176 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 21:50:41,176 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 21:50:41,176 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 21:50:41,176 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 21:50:41,177 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 21:50:41,177 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 21:50:41,178 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 21:50:41,178 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 21:50:41,178 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 21:50:41,178 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 21:50:41,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 21:50:41,179 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 21:50:41,179 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 21:50:41,179 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 21:50:41,179 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 21:50:41,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 21:50:41,180 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 21:50:41,180 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 21:50:41,180 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 21:50:41,180 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 -> cd94157895dc71e9f24fce5dbc4a71d4e4b55c4da9be28372139a3001decae0a [2022-07-22 21:50:41,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 21:50:41,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 21:50:41,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 21:50:41,415 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 21:50:41,415 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 21:50:41,416 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-inc-subseq.wvr.c [2022-07-22 21:50:41,471 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4b31ea27/d0cc72179547421888a20c944e87b72c/FLAGf3207722c [2022-07-22 21:50:41,867 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 21:50:41,867 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-inc-subseq.wvr.c [2022-07-22 21:50:41,872 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4b31ea27/d0cc72179547421888a20c944e87b72c/FLAGf3207722c [2022-07-22 21:50:42,275 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4b31ea27/d0cc72179547421888a20c944e87b72c [2022-07-22 21:50:42,277 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 21:50:42,278 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 21:50:42,279 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 21:50:42,279 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 21:50:42,281 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 21:50:42,281 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:50:42" (1/1) ... [2022-07-22 21:50:42,282 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d9b6c4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:50:42, skipping insertion in model container [2022-07-22 21:50:42,282 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:50:42" (1/1) ... [2022-07-22 21:50:42,293 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 21:50:42,310 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 21:50:42,460 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-inc-subseq.wvr.c[2924,2937] [2022-07-22 21:50:42,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 21:50:42,474 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 21:50:42,496 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-inc-subseq.wvr.c[2924,2937] [2022-07-22 21:50:42,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 21:50:42,511 INFO L208 MainTranslator]: Completed translation [2022-07-22 21:50:42,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:50:42 WrapperNode [2022-07-22 21:50:42,512 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 21:50:42,513 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 21:50:42,513 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 21:50:42,514 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 21:50:42,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:50:42" (1/1) ... [2022-07-22 21:50:42,529 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:50:42" (1/1) ... [2022-07-22 21:50:42,553 INFO L137 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 191 [2022-07-22 21:50:42,554 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 21:50:42,554 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 21:50:42,554 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 21:50:42,555 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 21:50:42,562 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:50:42" (1/1) ... [2022-07-22 21:50:42,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:50:42" (1/1) ... [2022-07-22 21:50:42,576 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:50:42" (1/1) ... [2022-07-22 21:50:42,577 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:50:42" (1/1) ... [2022-07-22 21:50:42,584 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:50:42" (1/1) ... [2022-07-22 21:50:42,602 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:50:42" (1/1) ... [2022-07-22 21:50:42,604 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:50:42" (1/1) ... [2022-07-22 21:50:42,607 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 21:50:42,619 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 21:50:42,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 21:50:42,619 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 21:50:42,620 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:50:42" (1/1) ... [2022-07-22 21:50:42,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 21:50:42,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:50:42,656 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-22 21:50:42,682 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-22 21:50:42,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 21:50:42,698 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 21:50:42,698 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 21:50:42,698 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 21:50:42,698 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 21:50:42,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 21:50:42,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 21:50:42,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 21:50:42,699 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 21:50:42,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 21:50:42,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 21:50:42,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 21:50:42,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 21:50:42,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 21:50:42,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 21:50:42,702 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-22 21:50:42,772 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 21:50:42,773 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 21:50:43,054 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 21:50:43,155 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 21:50:43,155 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-22 21:50:43,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:50:43 BoogieIcfgContainer [2022-07-22 21:50:43,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 21:50:43,160 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 21:50:43,160 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 21:50:43,166 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 21:50:43,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 09:50:42" (1/3) ... [2022-07-22 21:50:43,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a7fbb9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:50:43, skipping insertion in model container [2022-07-22 21:50:43,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:50:42" (2/3) ... [2022-07-22 21:50:43,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a7fbb9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:50:43, skipping insertion in model container [2022-07-22 21:50:43,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:50:43" (3/3) ... [2022-07-22 21:50:43,169 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-inc-subseq.wvr.c [2022-07-22 21:50:43,174 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-22 21:50:43,182 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 21:50:43,182 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 21:50:43,183 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-22 21:50:43,253 INFO L135 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-22 21:50:43,283 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 181 places, 189 transitions, 394 flow [2022-07-22 21:50:43,364 INFO L129 PetriNetUnfolder]: 15/187 cut-off events. [2022-07-22 21:50:43,364 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 21:50:43,370 INFO L84 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 187 events. 15/187 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/171 useless extension candidates. Maximal degree in co-relation 152. Up to 2 conditions per place. [2022-07-22 21:50:43,370 INFO L82 GeneralOperation]: Start removeDead. Operand has 181 places, 189 transitions, 394 flow [2022-07-22 21:50:43,375 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 178 transitions, 368 flow [2022-07-22 21:50:43,384 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 21:50:43,393 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@7c921f76, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4adf6480 [2022-07-22 21:50:43,395 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-07-22 21:50:43,429 INFO L129 PetriNetUnfolder]: 15/177 cut-off events. [2022-07-22 21:50:43,429 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 21:50:43,430 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:50:43,430 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, 1, 1, 1, 1, 1, 1] [2022-07-22 21:50:43,431 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:50:43,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:50:43,436 INFO L85 PathProgramCache]: Analyzing trace with hash 577602676, now seen corresponding path program 1 times [2022-07-22 21:50:43,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:50:43,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760303718] [2022-07-22 21:50:43,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:50:43,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:50:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:50:43,694 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-22 21:50:43,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:50:43,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760303718] [2022-07-22 21:50:43,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760303718] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:50:43,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:50:43,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 21:50:43,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837135972] [2022-07-22 21:50:43,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:50:43,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 21:50:43,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:50:43,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 21:50:43,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 21:50:43,742 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 189 [2022-07-22 21:50:43,755 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 178 transitions, 368 flow. Second operand has 2 states, 2 states have (on average 174.5) internal successors, (349), 2 states have internal predecessors, (349), 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-22 21:50:43,761 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:50:43,761 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 189 [2022-07-22 21:50:43,762 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:50:43,827 INFO L129 PetriNetUnfolder]: 14/193 cut-off events. [2022-07-22 21:50:43,828 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-07-22 21:50:43,829 INFO L84 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 193 events. 14/193 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 172 event pairs, 3 based on Foata normal form. 15/194 useless extension candidates. Maximal degree in co-relation 147. Up to 20 conditions per place. [2022-07-22 21:50:43,831 INFO L132 encePairwiseOnDemand]: 179/189 looper letters, 7 selfloop transitions, 0 changer transitions 6/168 dead transitions. [2022-07-22 21:50:43,831 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 168 transitions, 362 flow [2022-07-22 21:50:43,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 21:50:43,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-22 21:50:43,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 359 transitions. [2022-07-22 21:50:43,843 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9497354497354498 [2022-07-22 21:50:43,844 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 359 transitions. [2022-07-22 21:50:43,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 359 transitions. [2022-07-22 21:50:43,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:50:43,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 359 transitions. [2022-07-22 21:50:43,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 179.5) internal successors, (359), 2 states have internal predecessors, (359), 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-22 21:50:43,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 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-22 21:50:43,858 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 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-22 21:50:43,860 INFO L186 Difference]: Start difference. First operand has 170 places, 178 transitions, 368 flow. Second operand 2 states and 359 transitions. [2022-07-22 21:50:43,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 168 transitions, 362 flow [2022-07-22 21:50:43,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 168 transitions, 354 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-22 21:50:43,869 INFO L242 Difference]: Finished difference. Result has 167 places, 162 transitions, 328 flow [2022-07-22 21:50:43,871 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=328, PETRI_PLACES=167, PETRI_TRANSITIONS=162} [2022-07-22 21:50:43,875 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, -3 predicate places. [2022-07-22 21:50:43,876 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 162 transitions, 328 flow [2022-07-22 21:50:43,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 174.5) internal successors, (349), 2 states have internal predecessors, (349), 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-22 21:50:43,877 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:50:43,877 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, 1, 1, 1, 1, 1, 1] [2022-07-22 21:50:43,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 21:50:43,878 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:50:43,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:50:43,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1660907215, now seen corresponding path program 1 times [2022-07-22 21:50:43,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:50:43,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311295467] [2022-07-22 21:50:43,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:50:43,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:50:44,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:50:44,247 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-22 21:50:44,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:50:44,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311295467] [2022-07-22 21:50:44,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311295467] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:50:44,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:50:44,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 21:50:44,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730322482] [2022-07-22 21:50:44,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:50:44,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 21:50:44,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:50:44,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 21:50:44,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-22 21:50:44,253 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 189 [2022-07-22 21:50:44,254 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 162 transitions, 328 flow. Second operand has 6 states, 6 states have (on average 136.66666666666666) internal successors, (820), 6 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:50:44,255 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:50:44,255 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 189 [2022-07-22 21:50:44,255 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:50:44,475 INFO L129 PetriNetUnfolder]: 56/309 cut-off events. [2022-07-22 21:50:44,476 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-07-22 21:50:44,480 INFO L84 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 309 events. 56/309 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 848 event pairs, 12 based on Foata normal form. 0/287 useless extension candidates. Maximal degree in co-relation 445. Up to 64 conditions per place. [2022-07-22 21:50:44,482 INFO L132 encePairwiseOnDemand]: 183/189 looper letters, 45 selfloop transitions, 5 changer transitions 0/171 dead transitions. [2022-07-22 21:50:44,482 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 171 transitions, 447 flow [2022-07-22 21:50:44,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 21:50:44,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-07-22 21:50:44,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 837 transitions. [2022-07-22 21:50:44,491 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7380952380952381 [2022-07-22 21:50:44,491 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 837 transitions. [2022-07-22 21:50:44,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 837 transitions. [2022-07-22 21:50:44,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:50:44,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 837 transitions. [2022-07-22 21:50:44,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 139.5) internal successors, (837), 6 states have internal predecessors, (837), 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-22 21:50:44,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 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-22 21:50:44,504 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 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-22 21:50:44,504 INFO L186 Difference]: Start difference. First operand has 167 places, 162 transitions, 328 flow. Second operand 6 states and 837 transitions. [2022-07-22 21:50:44,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 171 transitions, 447 flow [2022-07-22 21:50:44,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 171 transitions, 447 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-22 21:50:44,512 INFO L242 Difference]: Finished difference. Result has 167 places, 163 transitions, 346 flow [2022-07-22 21:50:44,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=346, PETRI_PLACES=167, PETRI_TRANSITIONS=163} [2022-07-22 21:50:44,514 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, -3 predicate places. [2022-07-22 21:50:44,514 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 163 transitions, 346 flow [2022-07-22 21:50:44,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 136.66666666666666) internal successors, (820), 6 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:50:44,515 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:50:44,516 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:50:44,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 21:50:44,516 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:50:44,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:50:44,518 INFO L85 PathProgramCache]: Analyzing trace with hash 730860721, now seen corresponding path program 1 times [2022-07-22 21:50:44,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:50:44,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876992604] [2022-07-22 21:50:44,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:50:44,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:50:44,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:50:44,705 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-22 21:50:44,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:50:44,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876992604] [2022-07-22 21:50:44,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876992604] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:50:44,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:50:44,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 21:50:44,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985327712] [2022-07-22 21:50:44,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:50:44,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:50:44,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:50:44,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:50:44,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-22 21:50:44,713 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 189 [2022-07-22 21:50:44,715 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 163 transitions, 346 flow. Second operand has 7 states, 7 states have (on average 141.14285714285714) internal successors, (988), 7 states have internal predecessors, (988), 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-22 21:50:44,715 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:50:44,715 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 189 [2022-07-22 21:50:44,715 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:50:44,878 INFO L129 PetriNetUnfolder]: 57/353 cut-off events. [2022-07-22 21:50:44,878 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-07-22 21:50:44,879 INFO L84 FinitePrefix]: Finished finitePrefix Result has 530 conditions, 353 events. 57/353 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 981 event pairs, 12 based on Foata normal form. 4/338 useless extension candidates. Maximal degree in co-relation 525. Up to 60 conditions per place. [2022-07-22 21:50:44,881 INFO L132 encePairwiseOnDemand]: 179/189 looper letters, 46 selfloop transitions, 8 changer transitions 7/182 dead transitions. [2022-07-22 21:50:44,881 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 182 transitions, 511 flow [2022-07-22 21:50:44,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 21:50:44,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-22 21:50:44,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1158 transitions. [2022-07-22 21:50:44,885 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7658730158730159 [2022-07-22 21:50:44,885 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1158 transitions. [2022-07-22 21:50:44,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1158 transitions. [2022-07-22 21:50:44,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:50:44,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1158 transitions. [2022-07-22 21:50:44,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 144.75) internal successors, (1158), 8 states have internal predecessors, (1158), 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-22 21:50:44,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 189.0) internal successors, (1701), 9 states have internal predecessors, (1701), 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-22 21:50:44,895 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 189.0) internal successors, (1701), 9 states have internal predecessors, (1701), 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-22 21:50:44,895 INFO L186 Difference]: Start difference. First operand has 167 places, 163 transitions, 346 flow. Second operand 8 states and 1158 transitions. [2022-07-22 21:50:44,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 182 transitions, 511 flow [2022-07-22 21:50:44,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 182 transitions, 501 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-22 21:50:44,902 INFO L242 Difference]: Finished difference. Result has 172 places, 164 transitions, 364 flow [2022-07-22 21:50:44,902 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=364, PETRI_PLACES=172, PETRI_TRANSITIONS=164} [2022-07-22 21:50:44,904 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, 2 predicate places. [2022-07-22 21:50:44,904 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 164 transitions, 364 flow [2022-07-22 21:50:44,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 141.14285714285714) internal successors, (988), 7 states have internal predecessors, (988), 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-22 21:50:44,905 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:50:44,906 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:50:44,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 21:50:44,906 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:50:44,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:50:44,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1033182428, now seen corresponding path program 1 times [2022-07-22 21:50:44,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:50:44,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827923887] [2022-07-22 21:50:44,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:50:44,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:50:44,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:50:45,022 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-22 21:50:45,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:50:45,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827923887] [2022-07-22 21:50:45,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827923887] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:50:45,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:50:45,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 21:50:45,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836441940] [2022-07-22 21:50:45,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:50:45,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 21:50:45,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:50:45,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 21:50:45,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 21:50:45,030 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 189 [2022-07-22 21:50:45,031 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 164 transitions, 364 flow. Second operand has 4 states, 4 states have (on average 158.75) internal successors, (635), 4 states have internal predecessors, (635), 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-22 21:50:45,031 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:50:45,031 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 189 [2022-07-22 21:50:45,031 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:50:45,165 INFO L129 PetriNetUnfolder]: 156/581 cut-off events. [2022-07-22 21:50:45,165 INFO L130 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2022-07-22 21:50:45,167 INFO L84 FinitePrefix]: Finished finitePrefix Result has 966 conditions, 581 events. 156/581 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2610 event pairs, 14 based on Foata normal form. 0/541 useless extension candidates. Maximal degree in co-relation 959. Up to 141 conditions per place. [2022-07-22 21:50:45,171 INFO L132 encePairwiseOnDemand]: 183/189 looper letters, 44 selfloop transitions, 11 changer transitions 0/194 dead transitions. [2022-07-22 21:50:45,171 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 194 transitions, 558 flow [2022-07-22 21:50:45,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 21:50:45,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-22 21:50:45,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 823 transitions. [2022-07-22 21:50:45,174 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.870899470899471 [2022-07-22 21:50:45,174 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 823 transitions. [2022-07-22 21:50:45,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 823 transitions. [2022-07-22 21:50:45,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:50:45,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 823 transitions. [2022-07-22 21:50:45,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 164.6) internal successors, (823), 5 states have internal predecessors, (823), 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-22 21:50:45,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 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-22 21:50:45,184 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 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-22 21:50:45,184 INFO L186 Difference]: Start difference. First operand has 172 places, 164 transitions, 364 flow. Second operand 5 states and 823 transitions. [2022-07-22 21:50:45,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 194 transitions, 558 flow [2022-07-22 21:50:45,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 194 transitions, 534 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-07-22 21:50:45,190 INFO L242 Difference]: Finished difference. Result has 172 places, 174 transitions, 437 flow [2022-07-22 21:50:45,190 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=437, PETRI_PLACES=172, PETRI_TRANSITIONS=174} [2022-07-22 21:50:45,191 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, 2 predicate places. [2022-07-22 21:50:45,196 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 174 transitions, 437 flow [2022-07-22 21:50:45,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 158.75) internal successors, (635), 4 states have internal predecessors, (635), 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-22 21:50:45,197 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:50:45,197 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:50:45,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 21:50:45,198 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:50:45,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:50:45,198 INFO L85 PathProgramCache]: Analyzing trace with hash -2124401224, now seen corresponding path program 2 times [2022-07-22 21:50:45,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:50:45,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483901569] [2022-07-22 21:50:45,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:50:45,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:50:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:50:45,338 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-22 21:50:45,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:50:45,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483901569] [2022-07-22 21:50:45,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483901569] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:50:45,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:50:45,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 21:50:45,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395131276] [2022-07-22 21:50:45,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:50:45,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 21:50:45,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:50:45,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 21:50:45,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 21:50:45,342 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 189 [2022-07-22 21:50:45,343 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 174 transitions, 437 flow. Second operand has 5 states, 5 states have (on average 144.2) internal successors, (721), 5 states have internal predecessors, (721), 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-22 21:50:45,344 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:50:45,344 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 189 [2022-07-22 21:50:45,344 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:50:45,468 INFO L129 PetriNetUnfolder]: 106/528 cut-off events. [2022-07-22 21:50:45,468 INFO L130 PetriNetUnfolder]: For 330/355 co-relation queries the response was YES. [2022-07-22 21:50:45,470 INFO L84 FinitePrefix]: Finished finitePrefix Result has 994 conditions, 528 events. 106/528 cut-off events. For 330/355 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2395 event pairs, 13 based on Foata normal form. 8/515 useless extension candidates. Maximal degree in co-relation 985. Up to 100 conditions per place. [2022-07-22 21:50:45,473 INFO L132 encePairwiseOnDemand]: 184/189 looper letters, 51 selfloop transitions, 2 changer transitions 4/190 dead transitions. [2022-07-22 21:50:45,473 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 190 transitions, 630 flow [2022-07-22 21:50:45,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 21:50:45,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-22 21:50:45,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 734 transitions. [2022-07-22 21:50:45,475 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7767195767195767 [2022-07-22 21:50:45,475 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 734 transitions. [2022-07-22 21:50:45,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 734 transitions. [2022-07-22 21:50:45,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:50:45,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 734 transitions. [2022-07-22 21:50:45,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 146.8) internal successors, (734), 5 states have internal predecessors, (734), 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-22 21:50:45,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 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-22 21:50:45,480 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 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-22 21:50:45,480 INFO L186 Difference]: Start difference. First operand has 172 places, 174 transitions, 437 flow. Second operand 5 states and 734 transitions. [2022-07-22 21:50:45,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 190 transitions, 630 flow [2022-07-22 21:50:45,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 190 transitions, 630 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-22 21:50:45,486 INFO L242 Difference]: Finished difference. Result has 179 places, 175 transitions, 453 flow [2022-07-22 21:50:45,486 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=453, PETRI_PLACES=179, PETRI_TRANSITIONS=175} [2022-07-22 21:50:45,487 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, 9 predicate places. [2022-07-22 21:50:45,487 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 175 transitions, 453 flow [2022-07-22 21:50:45,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 144.2) internal successors, (721), 5 states have internal predecessors, (721), 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-22 21:50:45,487 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:50:45,488 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, 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-22 21:50:45,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 21:50:45,488 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:50:45,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:50:45,489 INFO L85 PathProgramCache]: Analyzing trace with hash -8030758, now seen corresponding path program 1 times [2022-07-22 21:50:45,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:50:45,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852976408] [2022-07-22 21:50:45,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:50:45,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:50:45,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:50:45,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 21:50:45,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:50:45,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852976408] [2022-07-22 21:50:45,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852976408] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:50:45,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:50:45,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 21:50:45,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517025450] [2022-07-22 21:50:45,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:50:45,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 21:50:45,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:50:45,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 21:50:45,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 21:50:45,554 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 189 [2022-07-22 21:50:45,554 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 175 transitions, 453 flow. Second operand has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 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-22 21:50:45,554 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:50:45,555 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 189 [2022-07-22 21:50:45,555 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:50:45,620 INFO L129 PetriNetUnfolder]: 78/488 cut-off events. [2022-07-22 21:50:45,620 INFO L130 PetriNetUnfolder]: For 286/308 co-relation queries the response was YES. [2022-07-22 21:50:45,622 INFO L84 FinitePrefix]: Finished finitePrefix Result has 893 conditions, 488 events. 78/488 cut-off events. For 286/308 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1966 event pairs, 9 based on Foata normal form. 11/480 useless extension candidates. Maximal degree in co-relation 880. Up to 106 conditions per place. [2022-07-22 21:50:45,624 INFO L132 encePairwiseOnDemand]: 186/189 looper letters, 29 selfloop transitions, 2 changer transitions 2/185 dead transitions. [2022-07-22 21:50:45,624 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 185 transitions, 570 flow [2022-07-22 21:50:45,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 21:50:45,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-22 21:50:45,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 515 transitions. [2022-07-22 21:50:45,626 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.908289241622575 [2022-07-22 21:50:45,627 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 515 transitions. [2022-07-22 21:50:45,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 515 transitions. [2022-07-22 21:50:45,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:50:45,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 515 transitions. [2022-07-22 21:50:45,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 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-22 21:50:45,630 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 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-22 21:50:45,630 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 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-22 21:50:45,630 INFO L186 Difference]: Start difference. First operand has 179 places, 175 transitions, 453 flow. Second operand 3 states and 515 transitions. [2022-07-22 21:50:45,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 185 transitions, 570 flow [2022-07-22 21:50:45,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 185 transitions, 564 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-07-22 21:50:45,636 INFO L242 Difference]: Finished difference. Result has 177 places, 176 transitions, 463 flow [2022-07-22 21:50:45,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=463, PETRI_PLACES=177, PETRI_TRANSITIONS=176} [2022-07-22 21:50:45,637 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, 7 predicate places. [2022-07-22 21:50:45,637 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 176 transitions, 463 flow [2022-07-22 21:50:45,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 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-22 21:50:45,638 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:50:45,638 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, 1, 1, 1, 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-22 21:50:45,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 21:50:45,639 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:50:45,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:50:45,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1086060663, now seen corresponding path program 1 times [2022-07-22 21:50:45,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:50:45,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515412040] [2022-07-22 21:50:45,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:50:45,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:50:45,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:50:45,716 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 21:50:45,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:50:45,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515412040] [2022-07-22 21:50:45,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515412040] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:50:45,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:50:45,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 21:50:45,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944079350] [2022-07-22 21:50:45,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:50:45,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 21:50:45,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:50:45,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 21:50:45,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 21:50:45,721 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 189 [2022-07-22 21:50:45,722 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 176 transitions, 463 flow. Second operand has 6 states, 6 states have (on average 149.83333333333334) internal successors, (899), 6 states have internal predecessors, (899), 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-22 21:50:45,722 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:50:45,722 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 189 [2022-07-22 21:50:45,722 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:50:45,883 INFO L129 PetriNetUnfolder]: 77/620 cut-off events. [2022-07-22 21:50:45,884 INFO L130 PetriNetUnfolder]: For 367/396 co-relation queries the response was YES. [2022-07-22 21:50:45,886 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1137 conditions, 620 events. 77/620 cut-off events. For 367/396 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2606 event pairs, 16 based on Foata normal form. 15/608 useless extension candidates. Maximal degree in co-relation 1125. Up to 110 conditions per place. [2022-07-22 21:50:45,888 INFO L132 encePairwiseOnDemand]: 179/189 looper letters, 38 selfloop transitions, 8 changer transitions 22/202 dead transitions. [2022-07-22 21:50:45,888 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 202 transitions, 685 flow [2022-07-22 21:50:45,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 21:50:45,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-22 21:50:45,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1361 transitions. [2022-07-22 21:50:45,892 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8001175778953556 [2022-07-22 21:50:45,893 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1361 transitions. [2022-07-22 21:50:45,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1361 transitions. [2022-07-22 21:50:45,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:50:45,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1361 transitions. [2022-07-22 21:50:45,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 151.22222222222223) internal successors, (1361), 9 states have internal predecessors, (1361), 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-22 21:50:45,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 189.0) internal successors, (1890), 10 states have internal predecessors, (1890), 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-22 21:50:45,900 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 189.0) internal successors, (1890), 10 states have internal predecessors, (1890), 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-22 21:50:45,901 INFO L186 Difference]: Start difference. First operand has 177 places, 176 transitions, 463 flow. Second operand 9 states and 1361 transitions. [2022-07-22 21:50:45,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 202 transitions, 685 flow [2022-07-22 21:50:45,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 202 transitions, 683 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-22 21:50:45,907 INFO L242 Difference]: Finished difference. Result has 186 places, 177 transitions, 489 flow [2022-07-22 21:50:45,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=489, PETRI_PLACES=186, PETRI_TRANSITIONS=177} [2022-07-22 21:50:45,908 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, 16 predicate places. [2022-07-22 21:50:45,908 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 177 transitions, 489 flow [2022-07-22 21:50:45,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 149.83333333333334) internal successors, (899), 6 states have internal predecessors, (899), 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-22 21:50:45,909 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:50:45,909 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 21:50:45,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 21:50:45,910 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:50:45,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:50:45,910 INFO L85 PathProgramCache]: Analyzing trace with hash -751624308, now seen corresponding path program 1 times [2022-07-22 21:50:45,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:50:45,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765062361] [2022-07-22 21:50:45,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:50:45,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:50:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:50:47,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:50:47,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:50:47,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765062361] [2022-07-22 21:50:47,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765062361] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:50:47,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838075812] [2022-07-22 21:50:47,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:50:47,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:50:47,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:50:47,583 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-22 21:50:47,598 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-22 21:50:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:50:47,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-22 21:50:47,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:50:49,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 21:50:49,391 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 21:50:49,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:50:49,886 INFO L356 Elim1Store]: treesize reduction 23, result has 77.2 percent of original size [2022-07-22 21:50:49,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 101 [2022-07-22 21:50:51,357 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 21:50:51,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838075812] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:50:51,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:50:51,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 24, 19] total 63 [2022-07-22 21:50:51,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223063022] [2022-07-22 21:50:51,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:50:51,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-07-22 21:50:51,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:50:51,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-07-22 21:50:51,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=545, Invalid=3361, Unknown=0, NotChecked=0, Total=3906 [2022-07-22 21:50:51,367 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 189 [2022-07-22 21:50:51,373 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 177 transitions, 489 flow. Second operand has 63 states, 63 states have (on average 59.476190476190474) internal successors, (3747), 63 states have internal predecessors, (3747), 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-22 21:50:51,373 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:50:51,373 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 189 [2022-07-22 21:50:51,373 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:51:05,796 INFO L129 PetriNetUnfolder]: 9164/17955 cut-off events. [2022-07-22 21:51:05,796 INFO L130 PetriNetUnfolder]: For 11386/11386 co-relation queries the response was YES. [2022-07-22 21:51:05,855 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45147 conditions, 17955 events. 9164/17955 cut-off events. For 11386/11386 co-relation queries the response was YES. Maximal size of possible extension queue 861. Compared 165866 event pairs, 721 based on Foata normal form. 32/17327 useless extension candidates. Maximal degree in co-relation 45133. Up to 2845 conditions per place. [2022-07-22 21:51:05,930 INFO L132 encePairwiseOnDemand]: 142/189 looper letters, 825 selfloop transitions, 284 changer transitions 218/1376 dead transitions. [2022-07-22 21:51:05,931 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 1376 transitions, 7649 flow [2022-07-22 21:51:05,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2022-07-22 21:51:05,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2022-07-22 21:51:05,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 8023 transitions. [2022-07-22 21:51:05,950 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.3395978835978836 [2022-07-22 21:51:05,950 INFO L72 ComplementDD]: Start complementDD. Operand 125 states and 8023 transitions. [2022-07-22 21:51:05,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 8023 transitions. [2022-07-22 21:51:05,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:51:05,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 125 states and 8023 transitions. [2022-07-22 21:51:05,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 126 states, 125 states have (on average 64.184) internal successors, (8023), 125 states have internal predecessors, (8023), 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-22 21:51:06,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 126 states, 126 states have (on average 189.0) internal successors, (23814), 126 states have internal predecessors, (23814), 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-22 21:51:06,021 INFO L81 ComplementDD]: Finished complementDD. Result has 126 states, 126 states have (on average 189.0) internal successors, (23814), 126 states have internal predecessors, (23814), 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-22 21:51:06,022 INFO L186 Difference]: Start difference. First operand has 186 places, 177 transitions, 489 flow. Second operand 125 states and 8023 transitions. [2022-07-22 21:51:06,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 1376 transitions, 7649 flow [2022-07-22 21:51:06,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 1376 transitions, 7615 flow, removed 7 selfloop flow, removed 6 redundant places. [2022-07-22 21:51:06,073 INFO L242 Difference]: Finished difference. Result has 371 places, 492 transitions, 3069 flow [2022-07-22 21:51:06,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=125, PETRI_FLOW=3069, PETRI_PLACES=371, PETRI_TRANSITIONS=492} [2022-07-22 21:51:06,076 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, 201 predicate places. [2022-07-22 21:51:06,077 INFO L495 AbstractCegarLoop]: Abstraction has has 371 places, 492 transitions, 3069 flow [2022-07-22 21:51:06,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 59.476190476190474) internal successors, (3747), 63 states have internal predecessors, (3747), 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-22 21:51:06,090 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:51:06,091 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 21:51:06,119 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-22 21:51:06,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:51:06,308 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:51:06,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:51:06,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1738378008, now seen corresponding path program 2 times [2022-07-22 21:51:06,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:51:06,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659132916] [2022-07-22 21:51:06,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:51:06,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:51:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:51:07,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 21:51:07,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:51:07,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659132916] [2022-07-22 21:51:07,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659132916] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:51:07,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239153295] [2022-07-22 21:51:07,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 21:51:07,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:51:07,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:51:07,584 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-22 21:51:07,584 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-22 21:51:07,722 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 21:51:07,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 21:51:07,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-22 21:51:07,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:51:07,806 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-22 21:51:08,208 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 21:51:08,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-07-22 21:51:09,060 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 21:51:09,060 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-22 21:51:09,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 21:51:09,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 21:51:09,991 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 14 treesize of output 16 [2022-07-22 21:51:10,320 INFO L356 Elim1Store]: treesize reduction 14, result has 65.9 percent of original size [2022-07-22 21:51:10,320 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 30 treesize of output 36 [2022-07-22 21:51:10,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 21:51:10,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:51:12,350 INFO L356 Elim1Store]: treesize reduction 25, result has 84.2 percent of original size [2022-07-22 21:51:12,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1871 treesize of output 1727 [2022-07-22 21:51:12,392 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:51:12,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1590 treesize of output 1531 [2022-07-22 21:51:12,428 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:51:12,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1482 treesize of output 1315 [2022-07-22 21:51:12,454 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:51:12,455 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 1266 treesize of output 1187 [2022-07-22 21:51:12,484 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:51:12,484 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 1170 treesize of output 995 [2022-07-22 21:51:23,421 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-22 21:51:23,427 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-22 21:51:23,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 21:51:23,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239153295] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:51:23,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:51:23,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 36, 32] total 89 [2022-07-22 21:51:23,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689615321] [2022-07-22 21:51:23,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:51:23,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-07-22 21:51:23,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:51:23,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-07-22 21:51:23,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=770, Invalid=7036, Unknown=26, NotChecked=0, Total=7832 [2022-07-22 21:51:23,511 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 189 [2022-07-22 21:51:23,516 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 492 transitions, 3069 flow. Second operand has 89 states, 89 states have (on average 56.449438202247194) internal successors, (5024), 89 states have internal predecessors, (5024), 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-22 21:51:23,516 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:51:23,516 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 189 [2022-07-22 21:51:23,516 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:51:28,572 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~n~0 c_~end~0)) (.cse1 (not (= (mod c_~ok~0 256) 0))) (.cse2 (= (* c_~end~0 4) (* c_~start~0 4))) (.cse3 (= (* c_~i~0 4) 0)) (.cse4 (< c_~end~0 0)) (.cse5 (< c_~start~0 c_~end~0))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 1) (or .cse0 (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~A~0.base)) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) .cse1 .cse2 .cse3) .cse4 .cse5) (or .cse0 .cse4 (and .cse1 .cse2 (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse3) .cse5) (= c_~i~0 0) (or .cse0 .cse4 (and (forall ((v_ArrVal_160 (Array Int Int)) (~queue~0.base Int) (v_ArrVal_159 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_159) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_160))) (let ((.cse6 (select .cse7 ~queue~0.base))) (or (<= |c_ULTIMATE.start_main_#t~mem14#1| (select .cse6 (+ (* c_~start~0 4) c_~queue~0.offset))) (not (= (select .cse6 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse7 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))))))) (or .cse1 (forall ((v_ArrVal_160 (Array Int Int)) (~queue~0.base Int) (v_ArrVal_159 (Array Int Int))) (not (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_159) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_160))) (= (select (select .cse8 ~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse8 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))))))) .cse5) (= (+ (- 1) c_~ok~0) 0) (= c_~ok~0 1) (<= c_~start~0 c_~end~0) (<= c_~end~0 c_~start~0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|) (or .cse0 (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse1 .cse2 .cse3 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) .cse4 .cse5) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-07-22 21:51:46,203 INFO L129 PetriNetUnfolder]: 15059/28382 cut-off events. [2022-07-22 21:51:46,204 INFO L130 PetriNetUnfolder]: For 268139/268205 co-relation queries the response was YES. [2022-07-22 21:51:46,748 INFO L84 FinitePrefix]: Finished finitePrefix Result has 132394 conditions, 28382 events. 15059/28382 cut-off events. For 268139/268205 co-relation queries the response was YES. Maximal size of possible extension queue 1422. Compared 271691 event pairs, 2331 based on Foata normal form. 32/28364 useless extension candidates. Maximal degree in co-relation 132312. Up to 14794 conditions per place. [2022-07-22 21:51:46,902 INFO L132 encePairwiseOnDemand]: 131/189 looper letters, 1076 selfloop transitions, 664 changer transitions 62/1849 dead transitions. [2022-07-22 21:51:46,902 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 492 places, 1849 transitions, 17485 flow [2022-07-22 21:51:46,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2022-07-22 21:51:46,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2022-07-22 21:51:46,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 8300 transitions. [2022-07-22 21:51:46,927 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.30926298531932334 [2022-07-22 21:51:46,928 INFO L72 ComplementDD]: Start complementDD. Operand 142 states and 8300 transitions. [2022-07-22 21:51:46,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 142 states and 8300 transitions. [2022-07-22 21:51:46,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:51:46,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 142 states and 8300 transitions. [2022-07-22 21:51:46,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 143 states, 142 states have (on average 58.45070422535211) internal successors, (8300), 142 states have internal predecessors, (8300), 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-22 21:51:46,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 143 states, 143 states have (on average 189.0) internal successors, (27027), 143 states have internal predecessors, (27027), 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-22 21:51:47,001 INFO L81 ComplementDD]: Finished complementDD. Result has 143 states, 143 states have (on average 189.0) internal successors, (27027), 143 states have internal predecessors, (27027), 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-22 21:51:47,001 INFO L186 Difference]: Start difference. First operand has 371 places, 492 transitions, 3069 flow. Second operand 142 states and 8300 transitions. [2022-07-22 21:51:47,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 492 places, 1849 transitions, 17485 flow [2022-07-22 21:51:48,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 1849 transitions, 15940 flow, removed 729 selfloop flow, removed 30 redundant places. [2022-07-22 21:51:48,430 INFO L242 Difference]: Finished difference. Result has 525 places, 1122 transitions, 10322 flow [2022-07-22 21:51:48,431 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=2726, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=142, PETRI_FLOW=10322, PETRI_PLACES=525, PETRI_TRANSITIONS=1122} [2022-07-22 21:51:48,431 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, 355 predicate places. [2022-07-22 21:51:48,432 INFO L495 AbstractCegarLoop]: Abstraction has has 525 places, 1122 transitions, 10322 flow [2022-07-22 21:51:48,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 56.449438202247194) internal successors, (5024), 89 states have internal predecessors, (5024), 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-22 21:51:48,434 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:51:48,434 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 21:51:48,462 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-22 21:51:48,647 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,SelfDestructingSolverStorable8 [2022-07-22 21:51:48,648 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:51:48,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:51:48,648 INFO L85 PathProgramCache]: Analyzing trace with hash -620764720, now seen corresponding path program 3 times [2022-07-22 21:51:48,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:51:48,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405644291] [2022-07-22 21:51:48,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:51:48,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:51:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:51:49,838 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 21:51:49,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:51:49,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405644291] [2022-07-22 21:51:49,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405644291] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:51:49,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302741094] [2022-07-22 21:51:49,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 21:51:49,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:51:49,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:51:49,841 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-22 21:51:49,842 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-22 21:51:49,969 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-22 21:51:49,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 21:51:49,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 79 conjunts are in the unsatisfiable core [2022-07-22 21:51:49,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:51:49,986 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-22 21:51:50,019 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 21:51:50,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-07-22 21:51:50,382 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-07-22 21:51:50,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-07-22 21:51:50,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-22 21:51:51,260 INFO L356 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-07-22 21:51:51,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 25 [2022-07-22 21:51:51,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-22 21:51:52,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 21:51:52,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-22 21:51:53,070 INFO L356 Elim1Store]: treesize reduction 15, result has 48.3 percent of original size [2022-07-22 21:51:53,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 26 [2022-07-22 21:51:53,128 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 21:51:53,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:51:53,563 WARN L833 $PredicateComparison]: unable to prove that (or (and (or (forall ((v_ArrVal_200 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (= (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) (select (select .cse0 c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)))))) (not (= (mod c_~ok~0 256) 0))) (forall ((v_ArrVal_200 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse1 (select .cse2 c_~queue~0.base))) (or (<= c_~v_old~0 (select .cse1 (+ (* c_~start~0 4) c_~queue~0.offset))) (not (= (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) (select .cse1 (+ (* c_~end~0 4) c_~queue~0.offset))))))))) (not (< c_~end~0 c_~n~0)) (< c_~start~0 0) (not (<= 0 c_~end~0)) (<= c_~n~0 c_~start~0)) is different from false [2022-07-22 21:51:54,077 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (and (forall ((~i~0 Int) (v_ArrVal_199 (Array Int Int))) (or (forall ((v_ArrVal_200 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse0 (select .cse1 c_~queue~0.base))) (or (not (= (select .cse0 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse1 c_~A~0.base) (+ c_~A~0.offset (* ~i~0 4))))) (<= c_~v_old~0 (select .cse0 (+ (* c_~start~0 4) c_~queue~0.offset))))))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) c_~A~0.base) (+ c_~A~0.offset (* ~i~0 4))) c_~last~0))) (or (not (= (mod c_~ok~0 256) 0)) (forall ((~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199)) (.cse3 (+ c_~A~0.offset (* ~i~0 4)))) (or (not (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (= (select (select .cse2 c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse2 c_~A~0.base) .cse3)))) (< (select (select .cse4 c_~A~0.base) .cse3) c_~last~0)))))) (< c_~start~0 0) (not (<= 0 c_~end~0)) (<= c_~n~0 c_~start~0)) is different from false [2022-07-22 21:51:54,181 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (< c_~start~0 0) (not (<= 0 c_~end~0)) (<= c_~n~0 c_~start~0) (and (or (not (= (mod c_~ok~0 256) 0)) (forall ((~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199)) (.cse1 (+ c_~A~0.offset (* ~i~0 4)))) (or (not (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (= (select (select .cse0 c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse0 c_~A~0.base) .cse1)))) (< (select (select .cse2 c_~A~0.base) .cse1) c_~v_old~0))))) (forall ((~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199))) (let ((.cse4 (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse5 (+ c_~A~0.offset (* ~i~0 4))) (.cse3 (select .cse4 c_~queue~0.base))) (or (not (= (select .cse3 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse4 c_~A~0.base) .cse5))) (< (select (select .cse6 c_~A~0.base) .cse5) c_~v_old~0) (<= c_~v_old~0 (select .cse3 (+ (* c_~start~0 4) c_~queue~0.offset)))))))))) is different from false [2022-07-22 21:51:54,237 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (< c_~start~0 0) (not (<= 0 c_~end~0)) (and (or (forall ((~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199)) (.cse1 (+ c_~A~0.offset (* ~i~0 4)))) (or (not (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (= (select (select .cse0 c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse0 c_~A~0.base) .cse1)))) (< (select (select .cse2 c_~A~0.base) .cse1) |c_ULTIMATE.start_main_#t~mem14#1|)))) (not (= (mod c_~ok~0 256) 0))) (forall ((~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199))) (let ((.cse4 (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse5 (+ c_~A~0.offset (* ~i~0 4))) (.cse3 (select .cse4 c_~queue~0.base))) (or (not (= (select .cse3 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse4 c_~A~0.base) .cse5))) (< (select (select .cse6 c_~A~0.base) .cse5) |c_ULTIMATE.start_main_#t~mem14#1|) (<= |c_ULTIMATE.start_main_#t~mem14#1| (select .cse3 (+ (* c_~start~0 4) c_~queue~0.offset))))))))) (<= c_~n~0 c_~start~0)) is different from false [2022-07-22 21:51:54,728 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (and (or (not (= (mod c_~ok~0 256) 0)) (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse1 (+ (* ~i~0 4) ~A~0.offset)) (.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_#t~ret13#1.base|) .cse1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_#t~ret13#1.base|) ~A~0.offset)) (not (let ((.cse2 (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (= (select (select .cse2 c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse2 |c_ULTIMATE.start_main_#t~ret13#1.base|) .cse1)))))))) (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199))) (let ((.cse7 (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_#t~ret13#1.base|) ~A~0.offset)) (.cse4 (select .cse7 c_~queue~0.base)) (.cse6 (+ (* ~i~0 4) ~A~0.offset))) (or (<= .cse3 (select .cse4 (+ (* c_~start~0 4) c_~queue~0.offset))) (< (select (select .cse5 |c_ULTIMATE.start_main_#t~ret13#1.base|) .cse6) .cse3) (not (= (select .cse4 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse7 |c_ULTIMATE.start_main_#t~ret13#1.base|) .cse6))))))))) (< c_~start~0 0) (not (<= 0 c_~end~0)) (<= c_~n~0 c_~start~0)) is different from false [2022-07-22 21:51:54,806 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (< c_~start~0 0) (and (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199))) (let ((.cse4 (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse1 (+ (* ~i~0 4) ~A~0.offset)) (.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) ~A~0.offset)) (.cse3 (select .cse4 c_~queue~0.base))) (or (< (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse1) .cse2) (not (= (select .cse3 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse1))) (<= .cse2 (select .cse3 (+ (* c_~start~0 4) c_~queue~0.offset)))))))) (or (not (= (mod c_~ok~0 256) 0)) (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse6 (+ (* ~i~0 4) ~A~0.offset)) (.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199))) (or (< (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse6) (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) ~A~0.offset)) (not (let ((.cse7 (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (= (select (select .cse7 c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse6))))))))) (not (<= 0 c_~end~0)) (<= c_~n~0 c_~start~0)) is different from false [2022-07-22 21:51:55,244 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (and (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_198 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_198) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse1 (select .cse2 c_~queue~0.base)) (.cse3 (+ (* ~i~0 4) ~A~0.offset)) (.cse0 (select v_ArrVal_198 ~A~0.offset))) (or (<= .cse0 (select .cse1 (+ (* c_~start~0 4) c_~queue~0.offset))) (not (= (select .cse1 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse3))) (< (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse3) .cse0)))))) (or (not (= (mod c_~ok~0 256) 0)) (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_198 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_198) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199)) (.cse6 (+ (* ~i~0 4) ~A~0.offset))) (or (not (let ((.cse5 (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (= (select (select .cse5 c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse6)))) (< (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse6) (select v_ArrVal_198 ~A~0.offset))))))) (< c_~start~0 0) (not (<= 0 c_~end~0)) (<= c_~n~0 c_~start~0)) is different from false [2022-07-22 21:51:55,446 WARN L833 $PredicateComparison]: unable to prove that (or (and (or (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_198 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| v_ArrVal_198) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199)) (.cse1 (+ (* ~i~0 4) ~A~0.offset))) (or (not (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (= (select (select .cse0 c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base|) .cse1)))) (< (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base|) .cse1) (select v_ArrVal_198 ~A~0.offset))))) (not (= (mod c_~ok~0 256) 0))) (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_198 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| v_ArrVal_198) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199))) (let ((.cse4 (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse3 (select .cse4 c_~queue~0.base)) (.cse5 (+ (* ~i~0 4) ~A~0.offset)) (.cse6 (select v_ArrVal_198 ~A~0.offset))) (or (not (= (select .cse3 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base|) .cse5))) (<= .cse6 (select .cse3 (+ (* c_~start~0 4) c_~queue~0.offset))) (< (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base|) .cse5) .cse6))))))) (not (< c_~end~0 c_~n~0)) (< c_~start~0 0) (not (<= 0 c_~end~0)) (<= c_~n~0 c_~start~0)) is different from false [2022-07-22 21:51:57,917 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:51:57,918 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-22 21:51:57,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1702 treesize of output 1638 [2022-07-22 21:51:57,942 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:51:57,942 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 1606 treesize of output 1239 [2022-07-22 21:51:57,962 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:51:57,962 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 1238 treesize of output 1056 [2022-07-22 21:51:57,989 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:51:57,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1056 treesize of output 942 [2022-07-22 21:51:58,478 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:51:58,479 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 128 treesize of output 92 [2022-07-22 21:51:58,490 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:51:58,491 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 3711 treesize of output 3583 [2022-07-22 21:51:58,521 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:51:58,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3551 treesize of output 3185 [2022-07-22 21:51:58,553 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:51:58,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3128 treesize of output 2360 [2022-07-22 21:51:58,603 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:51:58,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2337 treesize of output 2079 [2022-07-22 21:52:02,312 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-22 21:52:02,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302741094] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:52:02,312 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:52:02,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 37, 37] total 95 [2022-07-22 21:52:02,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39629009] [2022-07-22 21:52:02,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:52:02,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2022-07-22 21:52:02,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:52:02,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2022-07-22 21:52:02,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=697, Invalid=6728, Unknown=89, NotChecked=1416, Total=8930 [2022-07-22 21:52:02,319 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 189 [2022-07-22 21:52:02,323 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 1122 transitions, 10322 flow. Second operand has 95 states, 95 states have (on average 56.11578947368421) internal successors, (5331), 95 states have internal predecessors, (5331), 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-22 21:52:02,323 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:52:02,323 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 189 [2022-07-22 21:52:02,323 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:52:10,910 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (not (< c_~end~0 c_~n~0))) (.cse1 (< c_~start~0 0)) (.cse8 (not (= (mod c_~ok~0 256) 0))) (.cse2 (not (<= 0 c_~end~0))) (.cse12 (<= c_~n~0 c_~start~0))) (and (or .cse0 .cse1 .cse2 (and (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199))) (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) ~A~0.offset)) (.cse6 (select .cse7 c_~queue~0.base)) (.cse4 (+ (* ~i~0 4) ~A~0.offset))) (or (< (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse4) .cse5) (<= .cse5 (select .cse6 (+ (* c_~start~0 4) c_~queue~0.offset))) (not (= (select .cse6 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse4)))))))) (or .cse8 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse10 (+ (* ~i~0 4) ~A~0.offset)) (.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199))) (or (< (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse10) (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) ~A~0.offset)) (not (let ((.cse11 (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (= (select (select .cse11 c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse10))))))))) .cse12) (or .cse0 .cse1 (and (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199))) (let ((.cse17 (store .cse13 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse14 (+ (* ~i~0 4) ~A~0.offset)) (.cse15 (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) ~A~0.offset)) (.cse16 (select .cse17 c_~queue~0.base))) (or (< (select (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse14) .cse15) (not (= (select .cse16 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse14))) (<= .cse15 (select .cse16 (+ (* c_~start~0 4) c_~queue~0.offset)))))))) (or .cse8 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse19 (+ (* ~i~0 4) ~A~0.offset)) (.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199))) (or (< (select (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse19) (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) ~A~0.offset)) (not (let ((.cse20 (store .cse18 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (= (select (select .cse20 c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse19))))))))) .cse2 .cse12))) is different from false [2022-07-22 21:52:11,691 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (not (< c_~end~0 c_~n~0))) (.cse6 (not (= (mod c_~ok~0 256) 0))) (.cse1 (< c_~start~0 0)) (.cse2 (not (<= 0 c_~end~0))) (.cse11 (<= c_~n~0 c_~start~0))) (and (or .cse0 .cse1 .cse2 (and (or (forall ((~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199)) (.cse4 (+ c_~A~0.offset (* ~i~0 4)))) (or (not (let ((.cse3 (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (= (select (select .cse3 c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse3 c_~A~0.base) .cse4)))) (< (select (select .cse5 c_~A~0.base) .cse4) |c_ULTIMATE.start_main_#t~mem14#1|)))) .cse6) (forall ((~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199))) (let ((.cse8 (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse9 (+ c_~A~0.offset (* ~i~0 4))) (.cse7 (select .cse8 c_~queue~0.base))) (or (not (= (select .cse7 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse8 c_~A~0.base) .cse9))) (< (select (select .cse10 c_~A~0.base) .cse9) |c_ULTIMATE.start_main_#t~mem14#1|) (<= |c_ULTIMATE.start_main_#t~mem14#1| (select .cse7 (+ (* c_~start~0 4) c_~queue~0.offset))))))))) .cse11) (or .cse0 (and (or .cse6 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse13 (+ (* ~i~0 4) ~A~0.offset)) (.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199))) (or (< (select (select .cse12 c_~A~0.base) .cse13) (select (select |c_#memory_int| c_~A~0.base) ~A~0.offset)) (not (let ((.cse14 (store .cse12 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (= (select (select .cse14 c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse14 c_~A~0.base) .cse13)))))))) (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199))) (let ((.cse19 (store .cse15 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse16 (+ (* ~i~0 4) ~A~0.offset)) (.cse17 (select (select |c_#memory_int| c_~A~0.base) ~A~0.offset)) (.cse18 (select .cse19 c_~queue~0.base))) (or (< (select (select .cse15 c_~A~0.base) .cse16) .cse17) (not (= (select .cse18 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse19 c_~A~0.base) .cse16))) (<= .cse17 (select .cse18 (+ (* c_~start~0 4) c_~queue~0.offset))))))))) .cse1 .cse2 .cse11))) is different from false [2022-07-22 21:52:12,881 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (not (= (mod c_~ok~0 256) 0))) (.cse0 (not (< c_~end~0 c_~n~0))) (.cse6 (< c_~start~0 0)) (.cse7 (not (<= 0 c_~end~0))) (.cse8 (<= c_~n~0 c_~start~0))) (and (or .cse0 (and (or .cse1 (forall ((~i~0 Int) (v_ArrVal_200 (Array Int Int))) (let ((.cse2 (+ c_~A~0.offset (* ~i~0 4)))) (or (< (select (select |c_#memory_int| c_~A~0.base) .cse2) c_~last~0) (not (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (= (select (select .cse3 c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse3 c_~A~0.base) .cse2)))))))) (forall ((~i~0 Int)) (or (forall ((v_ArrVal_200 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse4 (select .cse5 c_~queue~0.base))) (or (<= c_~v_old~0 (select .cse4 (+ (* c_~start~0 4) c_~queue~0.offset))) (not (= (select .cse4 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse5 c_~A~0.base) (+ c_~A~0.offset (* ~i~0 4))))))))) (< (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* ~i~0 4))) c_~last~0)))) .cse6 .cse7 .cse8) (or (and (or (forall ((v_ArrVal_200 (Array Int Int))) (not (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (= (select (select .cse9 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) (select (select .cse9 c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)))))) .cse1) (forall ((v_ArrVal_200 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse10 (select .cse11 c_~queue~0.base))) (or (<= c_~v_old~0 (select .cse10 (+ (* c_~start~0 4) c_~queue~0.offset))) (not (= (select (select .cse11 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) (select .cse10 (+ (* c_~end~0 4) c_~queue~0.offset))))))))) (< (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) c_~last~0) .cse0 .cse6 .cse7 .cse8))) is different from false [2022-07-22 21:52:29,013 INFO L129 PetriNetUnfolder]: 22383/42695 cut-off events. [2022-07-22 21:52:29,013 INFO L130 PetriNetUnfolder]: For 897697/897782 co-relation queries the response was YES. [2022-07-22 21:52:30,368 INFO L84 FinitePrefix]: Finished finitePrefix Result has 300670 conditions, 42695 events. 22383/42695 cut-off events. For 897697/897782 co-relation queries the response was YES. Maximal size of possible extension queue 2074. Compared 436248 event pairs, 5307 based on Foata normal form. 38/42587 useless extension candidates. Maximal degree in co-relation 300547. Up to 21033 conditions per place. [2022-07-22 21:52:30,668 INFO L132 encePairwiseOnDemand]: 129/189 looper letters, 1321 selfloop transitions, 813 changer transitions 21/2202 dead transitions. [2022-07-22 21:52:30,668 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 583 places, 2202 transitions, 26210 flow [2022-07-22 21:52:30,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-07-22 21:52:30,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2022-07-22 21:52:30,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 4383 transitions. [2022-07-22 21:52:30,675 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.3133848133848134 [2022-07-22 21:52:30,676 INFO L72 ComplementDD]: Start complementDD. Operand 74 states and 4383 transitions. [2022-07-22 21:52:30,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 4383 transitions. [2022-07-22 21:52:30,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:52:30,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 74 states and 4383 transitions. [2022-07-22 21:52:30,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 75 states, 74 states have (on average 59.229729729729726) internal successors, (4383), 74 states have internal predecessors, (4383), 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-22 21:52:30,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 75 states, 75 states have (on average 189.0) internal successors, (14175), 75 states have internal predecessors, (14175), 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-22 21:52:30,697 INFO L81 ComplementDD]: Finished complementDD. Result has 75 states, 75 states have (on average 189.0) internal successors, (14175), 75 states have internal predecessors, (14175), 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-22 21:52:30,697 INFO L186 Difference]: Start difference. First operand has 525 places, 1122 transitions, 10322 flow. Second operand 74 states and 4383 transitions. [2022-07-22 21:52:30,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 583 places, 2202 transitions, 26210 flow [2022-07-22 21:52:35,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 531 places, 2202 transitions, 25308 flow, removed 398 selfloop flow, removed 52 redundant places. [2022-07-22 21:52:35,560 INFO L242 Difference]: Finished difference. Result has 566 places, 1656 transitions, 18615 flow [2022-07-22 21:52:35,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=9682, PETRI_DIFFERENCE_MINUEND_PLACES=458, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=352, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=520, PETRI_DIFFERENCE_SUBTRAHEND_STATES=74, PETRI_FLOW=18615, PETRI_PLACES=566, PETRI_TRANSITIONS=1656} [2022-07-22 21:52:35,562 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, 396 predicate places. [2022-07-22 21:52:35,562 INFO L495 AbstractCegarLoop]: Abstraction has has 566 places, 1656 transitions, 18615 flow [2022-07-22 21:52:35,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 95 states, 95 states have (on average 56.11578947368421) internal successors, (5331), 95 states have internal predecessors, (5331), 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-22 21:52:35,563 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:52:35,563 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 21:52:35,590 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-22 21:52:35,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:52:35,788 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:52:35,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:52:35,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1898873328, now seen corresponding path program 4 times [2022-07-22 21:52:35,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:52:35,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401316507] [2022-07-22 21:52:35,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:52:35,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:52:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:52:37,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:52:37,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:52:37,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401316507] [2022-07-22 21:52:37,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401316507] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:52:37,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763442610] [2022-07-22 21:52:37,908 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 21:52:37,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:52:37,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:52:37,909 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-22 21:52:37,910 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-22 21:52:37,998 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 21:52:37,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 21:52:38,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-22 21:52:38,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:52:39,158 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 11 treesize of output 7 [2022-07-22 21:52:39,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 21:52:39,628 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 14 treesize of output 16 [2022-07-22 21:52:39,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 21:52:39,831 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 14 treesize of output 16 [2022-07-22 21:52:40,192 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-22 21:52:40,193 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 34 treesize of output 10 [2022-07-22 21:52:40,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:52:40,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:52:40,646 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (not (<= 0 c_~end~0)) (and (or (not (= (mod c_~ok~0 256) 0)) (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (= (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) (select (select .cse0 ~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset))))))) (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (let ((.cse2 (select .cse1 ~queue~0.base))) (or (not (= (select (select .cse1 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) (select .cse2 (+ (* c_~end~0 4) c_~queue~0.offset)))) (<= c_~v_old~0 (select .cse2 (+ (* c_~start~0 4) c_~queue~0.offset))))))))) is different from false [2022-07-22 21:52:40,792 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_235 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_235) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (let ((.cse0 (select .cse1 ~queue~0.base))) (or (<= c_~v_old~0 (select .cse0 (+ (* c_~start~0 4) c_~queue~0.offset))) (not (= (select .cse0 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse1 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))))))) (or (not (= (mod c_~ok~0 256) 0)) (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_235 (Array Int Int))) (not (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_235) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (= (select (select .cse2 ~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))))))) (not (< c_~end~0 c_~n~0)) (not (<= 0 c_~end~0))) is different from false [2022-07-22 21:52:40,873 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (not (<= 0 c_~end~0)) (and (or (not (= (mod c_~ok~0 256) 0)) (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_235 (Array Int Int))) (not (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_235) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (= (select (select .cse0 ~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4)))))))) (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_235 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_235) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (let ((.cse1 (select .cse2 ~queue~0.base))) (or (<= |c_ULTIMATE.start_main_#t~mem14#1| (select .cse1 (+ (* c_~start~0 4) c_~queue~0.offset))) (not (= (select .cse1 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))))))))) is different from false [2022-07-22 21:52:40,896 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (and (or (not (= (mod c_~ok~0 256) 0)) (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_235 (Array Int Int))) (not (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_235) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (= (select (select .cse0 ~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4)))))))) (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_235 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_235) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (let ((.cse1 (select .cse2 ~queue~0.base))) (or (<= (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (select .cse1 (+ (* c_~start~0 4) c_~queue~0.offset))) (not (= (select .cse1 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4)))))))))) (not (<= 0 c_~end~0))) is different from false [2022-07-22 21:52:41,022 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (not (<= 0 c_~end~0)) (and (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_235 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_235) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (let ((.cse0 (select .cse1 ~queue~0.base))) (or (not (= (select .cse0 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse1 |c_ULTIMATE.start_main_#t~ret13#1.base|) (+ |c_ULTIMATE.start_main_#t~ret13#1.offset| (* c_~i~0 4))))) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_#t~ret13#1.base|) |c_ULTIMATE.start_main_#t~ret13#1.offset|) (select .cse0 (+ (* c_~start~0 4) c_~queue~0.offset))))))) (or (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_235 (Array Int Int))) (not (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_235) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (= (select (select .cse2 ~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse2 |c_ULTIMATE.start_main_#t~ret13#1.base|) (+ |c_ULTIMATE.start_main_#t~ret13#1.offset| (* c_~i~0 4))))))) (not (= (mod c_~ok~0 256) 0))))) is different from false [2022-07-22 21:52:41,056 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (not (<= 0 c_~end~0)) (and (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_235 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_235) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (let ((.cse0 (select .cse1 ~queue~0.base))) (or (not (= (select .cse0 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* c_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (select .cse0 (+ (* c_~start~0 4) c_~queue~0.offset))))))) (or (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_235 (Array Int Int))) (not (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_235) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (= (select (select .cse2 ~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* c_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))) (not (= (mod c_~ok~0 256) 0))))) is different from false [2022-07-22 21:52:41,075 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (not (<= 0 c_~end~0)) (and (or (not (= (mod c_~ok~0 256) 0)) (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_235 (Array Int Int))) (not (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_235) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (= (select (select .cse0 ~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* c_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_235 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_235) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (let ((.cse1 (select .cse2 ~queue~0.base))) (or (not (= (select .cse1 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* c_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select .cse1 (+ (* c_~start~0 4) c_~queue~0.offset))))))))) is different from false [2022-07-22 21:52:41,152 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:52:41,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 72 [2022-07-22 21:52:41,170 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:52:41,171 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 1085 treesize of output 1055 [2022-07-22 21:52:41,219 INFO L356 Elim1Store]: treesize reduction 44, result has 54.6 percent of original size [2022-07-22 21:52:41,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1499 treesize of output 1480 [2022-07-22 21:52:41,260 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:52:41,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1516 treesize of output 1300 [2022-07-22 21:52:41,294 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:52:41,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1086 treesize of output 1002 [2022-07-22 21:52:44,411 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:52:44,411 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 126 treesize of output 124 [2022-07-22 21:52:44,631 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:52:44,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 178 treesize of output 254 [2022-07-22 21:52:45,336 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:52:45,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 45 [2022-07-22 21:52:45,341 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 21:52:45,342 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 21:52:45,349 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-07-22 21:52:45,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 218 treesize of output 138 [2022-07-22 21:52:46,908 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-22 21:52:46,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763442610] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:52:46,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:52:46,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 31, 29] total 87 [2022-07-22 21:52:46,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139303574] [2022-07-22 21:52:46,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:52:46,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2022-07-22 21:52:46,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:52:46,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2022-07-22 21:52:46,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=555, Invalid=5786, Unknown=7, NotChecked=1134, Total=7482 [2022-07-22 21:52:46,914 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 189 [2022-07-22 21:52:46,917 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 1656 transitions, 18615 flow. Second operand has 87 states, 87 states have (on average 59.49425287356322) internal successors, (5176), 87 states have internal predecessors, (5176), 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-22 21:52:46,917 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:52:46,917 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 189 [2022-07-22 21:52:46,917 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand