./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-send-receive.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-send-receive.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 238e609d3671ff2de494998b0abc6a14651375b5eb423e7b66fc3d987b466268 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 10:39:16,238 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 10:39:16,240 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 10:39:16,275 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 10:39:16,276 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 10:39:16,277 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 10:39:16,278 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 10:39:16,280 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 10:39:16,282 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 10:39:16,285 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 10:39:16,286 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 10:39:16,287 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 10:39:16,288 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 10:39:16,289 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 10:39:16,290 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 10:39:16,292 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 10:39:16,293 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 10:39:16,294 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 10:39:16,295 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 10:39:16,298 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 10:39:16,300 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 10:39:16,300 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 10:39:16,301 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 10:39:16,302 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 10:39:16,303 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 10:39:16,308 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 10:39:16,308 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 10:39:16,308 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 10:39:16,309 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 10:39:16,309 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 10:39:16,310 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 10:39:16,310 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 10:39:16,312 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 10:39:16,312 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 10:39:16,313 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 10:39:16,313 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 10:39:16,313 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 10:39:16,314 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 10:39:16,314 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 10:39:16,314 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 10:39:16,315 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 10:39:16,316 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 10:39:16,317 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 10:39:16,339 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 10:39:16,340 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 10:39:16,340 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 10:39:16,340 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 10:39:16,341 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 10:39:16,341 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 10:39:16,341 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 10:39:16,341 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 10:39:16,341 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 10:39:16,342 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 10:39:16,342 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 10:39:16,342 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 10:39:16,342 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 10:39:16,343 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 10:39:16,343 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 10:39:16,343 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 10:39:16,343 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 10:39:16,343 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 10:39:16,344 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 10:39:16,344 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 10:39:16,344 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 10:39:16,344 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 10:39:16,345 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 10:39:16,345 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 10:39:16,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:39:16,345 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 10:39:16,345 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 10:39:16,345 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 10:39:16,345 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 10:39:16,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 10:39:16,346 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 10:39:16,346 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 10:39:16,346 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 10:39:16,346 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 -> 238e609d3671ff2de494998b0abc6a14651375b5eb423e7b66fc3d987b466268 [2022-07-12 10:39:16,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 10:39:16,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 10:39:16,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 10:39:16,560 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 10:39:16,561 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 10:39:16,562 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-send-receive.wvr.c [2022-07-12 10:39:16,613 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7d59d43d/b5f3e38acef04be7bd096889c00e30f8/FLAG3bebc286d [2022-07-12 10:39:16,983 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 10:39:16,983 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-send-receive.wvr.c [2022-07-12 10:39:16,989 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7d59d43d/b5f3e38acef04be7bd096889c00e30f8/FLAG3bebc286d [2022-07-12 10:39:17,004 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7d59d43d/b5f3e38acef04be7bd096889c00e30f8 [2022-07-12 10:39:17,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 10:39:17,007 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 10:39:17,009 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 10:39:17,010 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 10:39:17,012 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 10:39:17,012 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:39:17" (1/1) ... [2022-07-12 10:39:17,013 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42067692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:39:17, skipping insertion in model container [2022-07-12 10:39:17,013 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:39:17" (1/1) ... [2022-07-12 10:39:17,018 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 10:39:17,036 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 10:39:17,184 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-send-receive.wvr.c[3107,3120] [2022-07-12 10:39:17,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:39:17,193 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 10:39:17,207 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-send-receive.wvr.c[3107,3120] [2022-07-12 10:39:17,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:39:17,218 INFO L208 MainTranslator]: Completed translation [2022-07-12 10:39:17,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:39:17 WrapperNode [2022-07-12 10:39:17,219 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 10:39:17,220 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 10:39:17,220 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 10:39:17,220 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 10:39:17,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:39:17" (1/1) ... [2022-07-12 10:39:17,238 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:39:17" (1/1) ... [2022-07-12 10:39:17,253 INFO L137 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 161 [2022-07-12 10:39:17,254 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 10:39:17,254 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 10:39:17,254 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 10:39:17,255 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 10:39:17,259 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:39:17" (1/1) ... [2022-07-12 10:39:17,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:39:17" (1/1) ... [2022-07-12 10:39:17,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:39:17" (1/1) ... [2022-07-12 10:39:17,262 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:39:17" (1/1) ... [2022-07-12 10:39:17,270 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:39:17" (1/1) ... [2022-07-12 10:39:17,273 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:39:17" (1/1) ... [2022-07-12 10:39:17,274 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:39:17" (1/1) ... [2022-07-12 10:39:17,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 10:39:17,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 10:39:17,278 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 10:39:17,278 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 10:39:17,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:39:17" (1/1) ... [2022-07-12 10:39:17,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:39:17,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:39:17,299 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 10:39:17,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 10:39:17,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 10:39:17,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 10:39:17,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 10:39:17,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 10:39:17,325 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-12 10:39:17,326 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-12 10:39:17,326 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-12 10:39:17,329 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-12 10:39:17,329 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-12 10:39:17,329 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-12 10:39:17,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 10:39:17,329 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-12 10:39:17,330 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-12 10:39:17,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 10:39:17,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 10:39:17,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 10:39:17,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 10:39:17,331 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-12 10:39:17,406 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 10:39:17,407 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 10:39:17,598 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 10:39:17,648 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 10:39:17,648 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-12 10:39:17,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:39:17 BoogieIcfgContainer [2022-07-12 10:39:17,650 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 10:39:17,651 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 10:39:17,652 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 10:39:17,665 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 10:39:17,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 10:39:17" (1/3) ... [2022-07-12 10:39:17,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cedcdb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:39:17, skipping insertion in model container [2022-07-12 10:39:17,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:39:17" (2/3) ... [2022-07-12 10:39:17,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cedcdb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:39:17, skipping insertion in model container [2022-07-12 10:39:17,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:39:17" (3/3) ... [2022-07-12 10:39:17,668 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2022-07-12 10:39:17,672 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-12 10:39:17,679 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 10:39:17,679 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 10:39:17,679 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-12 10:39:17,752 INFO L135 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-12 10:39:17,796 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 142 places, 142 transitions, 308 flow [2022-07-12 10:39:17,873 INFO L129 PetriNetUnfolder]: 10/139 cut-off events. [2022-07-12 10:39:17,873 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-12 10:39:17,876 INFO L84 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 10/139 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 116. Up to 2 conditions per place. [2022-07-12 10:39:17,876 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 142 transitions, 308 flow [2022-07-12 10:39:17,884 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 128 transitions, 274 flow [2022-07-12 10:39:17,895 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:39:17,903 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@6c88b9ff, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@288d970 [2022-07-12 10:39:17,904 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-07-12 10:39:17,937 INFO L129 PetriNetUnfolder]: 10/127 cut-off events. [2022-07-12 10:39:17,937 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-12 10:39:17,937 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:39:17,938 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] [2022-07-12 10:39:17,939 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:39:17,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:39:17,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1295974227, now seen corresponding path program 1 times [2022-07-12 10:39:17,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:39:17,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932606522] [2022-07-12 10:39:17,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:39:17,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:39:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:39:18,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:39:18,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:39:18,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932606522] [2022-07-12 10:39:18,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932606522] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:39:18,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:39:18,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 10:39:18,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427765588] [2022-07-12 10:39:18,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:39:18,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 10:39:18,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:39:18,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 10:39:18,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 10:39:18,181 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 142 [2022-07-12 10:39:18,186 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 128 transitions, 274 flow. Second operand has 2 states, 2 states have (on average 130.0) internal successors, (260), 2 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:18,186 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:39:18,186 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 142 [2022-07-12 10:39:18,187 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:39:18,251 INFO L129 PetriNetUnfolder]: 21/174 cut-off events. [2022-07-12 10:39:18,251 INFO L130 PetriNetUnfolder]: For 26/27 co-relation queries the response was YES. [2022-07-12 10:39:18,253 INFO L84 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 174 events. 21/174 cut-off events. For 26/27 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 302 event pairs, 7 based on Foata normal form. 20/176 useless extension candidates. Maximal degree in co-relation 141. Up to 33 conditions per place. [2022-07-12 10:39:18,255 INFO L132 encePairwiseOnDemand]: 136/142 looper letters, 9 selfloop transitions, 0 changer transitions 2/122 dead transitions. [2022-07-12 10:39:18,256 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 122 transitions, 280 flow [2022-07-12 10:39:18,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 10:39:18,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-12 10:39:18,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 267 transitions. [2022-07-12 10:39:18,268 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9401408450704225 [2022-07-12 10:39:18,269 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 267 transitions. [2022-07-12 10:39:18,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 267 transitions. [2022-07-12 10:39:18,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:39:18,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 267 transitions. [2022-07-12 10:39:18,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 133.5) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:18,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:18,284 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:18,286 INFO L186 Difference]: Start difference. First operand has 128 places, 128 transitions, 274 flow. Second operand 2 states and 267 transitions. [2022-07-12 10:39:18,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 122 transitions, 280 flow [2022-07-12 10:39:18,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 122 transitions, 268 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-07-12 10:39:18,292 INFO L242 Difference]: Finished difference. Result has 123 places, 120 transitions, 246 flow [2022-07-12 10:39:18,293 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=246, PETRI_PLACES=123, PETRI_TRANSITIONS=120} [2022-07-12 10:39:18,295 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, -5 predicate places. [2022-07-12 10:39:18,296 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 120 transitions, 246 flow [2022-07-12 10:39:18,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 130.0) internal successors, (260), 2 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:18,296 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:39:18,296 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] [2022-07-12 10:39:18,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 10:39:18,297 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:39:18,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:39:18,297 INFO L85 PathProgramCache]: Analyzing trace with hash -56616445, now seen corresponding path program 1 times [2022-07-12 10:39:18,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:39:18,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363304696] [2022-07-12 10:39:18,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:39:18,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:39:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:39:18,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:39:18,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:39:18,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363304696] [2022-07-12 10:39:18,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363304696] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:39:18,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:39:18,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 10:39:18,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892367544] [2022-07-12 10:39:18,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:39:18,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 10:39:18,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:39:18,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 10:39:18,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 10:39:18,479 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 142 [2022-07-12 10:39:18,480 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 120 transitions, 246 flow. Second operand has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:18,480 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:39:18,480 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 142 [2022-07-12 10:39:18,480 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:39:18,622 INFO L129 PetriNetUnfolder]: 108/431 cut-off events. [2022-07-12 10:39:18,622 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-07-12 10:39:18,624 INFO L84 FinitePrefix]: Finished finitePrefix Result has 624 conditions, 431 events. 108/431 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1903 event pairs, 16 based on Foata normal form. 0/390 useless extension candidates. Maximal degree in co-relation 621. Up to 65 conditions per place. [2022-07-12 10:39:18,626 INFO L132 encePairwiseOnDemand]: 137/142 looper letters, 36 selfloop transitions, 5 changer transitions 0/143 dead transitions. [2022-07-12 10:39:18,626 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 143 transitions, 378 flow [2022-07-12 10:39:18,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 10:39:18,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-12 10:39:18,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 628 transitions. [2022-07-12 10:39:18,629 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8845070422535212 [2022-07-12 10:39:18,629 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 628 transitions. [2022-07-12 10:39:18,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 628 transitions. [2022-07-12 10:39:18,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:39:18,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 628 transitions. [2022-07-12 10:39:18,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:18,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:18,635 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:18,635 INFO L186 Difference]: Start difference. First operand has 123 places, 120 transitions, 246 flow. Second operand 5 states and 628 transitions. [2022-07-12 10:39:18,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 143 transitions, 378 flow [2022-07-12 10:39:18,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 143 transitions, 378 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-12 10:39:18,639 INFO L242 Difference]: Finished difference. Result has 128 places, 123 transitions, 277 flow [2022-07-12 10:39:18,639 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=277, PETRI_PLACES=128, PETRI_TRANSITIONS=123} [2022-07-12 10:39:18,640 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 0 predicate places. [2022-07-12 10:39:18,641 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 123 transitions, 277 flow [2022-07-12 10:39:18,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:18,641 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:39:18,641 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:39:18,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 10:39:18,642 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:39:18,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:39:18,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1034643297, now seen corresponding path program 2 times [2022-07-12 10:39:18,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:39:18,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584370545] [2022-07-12 10:39:18,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:39:18,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:39:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:39:18,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:39:18,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:39:18,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584370545] [2022-07-12 10:39:18,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584370545] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:39:18,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:39:18,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 10:39:18,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210269766] [2022-07-12 10:39:18,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:39:18,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 10:39:18,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:39:18,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 10:39:18,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 10:39:18,794 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 142 [2022-07-12 10:39:18,794 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 123 transitions, 277 flow. Second operand has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:18,794 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:39:18,794 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 142 [2022-07-12 10:39:18,795 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:39:18,894 INFO L129 PetriNetUnfolder]: 125/419 cut-off events. [2022-07-12 10:39:18,895 INFO L130 PetriNetUnfolder]: For 92/95 co-relation queries the response was YES. [2022-07-12 10:39:18,896 INFO L84 FinitePrefix]: Finished finitePrefix Result has 739 conditions, 419 events. 125/419 cut-off events. For 92/95 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1763 event pairs, 12 based on Foata normal form. 3/364 useless extension candidates. Maximal degree in co-relation 732. Up to 84 conditions per place. [2022-07-12 10:39:18,899 INFO L132 encePairwiseOnDemand]: 137/142 looper letters, 37 selfloop transitions, 7 changer transitions 0/146 dead transitions. [2022-07-12 10:39:18,900 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 146 transitions, 435 flow [2022-07-12 10:39:18,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 10:39:18,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-12 10:39:18,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 627 transitions. [2022-07-12 10:39:18,902 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8830985915492958 [2022-07-12 10:39:18,902 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 627 transitions. [2022-07-12 10:39:18,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 627 transitions. [2022-07-12 10:39:18,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:39:18,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 627 transitions. [2022-07-12 10:39:18,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:18,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:18,906 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:18,906 INFO L186 Difference]: Start difference. First operand has 128 places, 123 transitions, 277 flow. Second operand 5 states and 627 transitions. [2022-07-12 10:39:18,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 146 transitions, 435 flow [2022-07-12 10:39:18,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 146 transitions, 430 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-12 10:39:18,912 INFO L242 Difference]: Finished difference. Result has 134 places, 127 transitions, 320 flow [2022-07-12 10:39:18,913 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=320, PETRI_PLACES=134, PETRI_TRANSITIONS=127} [2022-07-12 10:39:18,914 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 6 predicate places. [2022-07-12 10:39:18,914 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 127 transitions, 320 flow [2022-07-12 10:39:18,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:18,915 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:39:18,915 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] [2022-07-12 10:39:18,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 10:39:18,916 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:39:18,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:39:18,916 INFO L85 PathProgramCache]: Analyzing trace with hash -707530407, now seen corresponding path program 3 times [2022-07-12 10:39:18,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:39:18,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176469790] [2022-07-12 10:39:18,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:39:18,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:39:18,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:39:19,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:39:19,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:39:19,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176469790] [2022-07-12 10:39:19,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176469790] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:39:19,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:39:19,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 10:39:19,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044999424] [2022-07-12 10:39:19,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:39:19,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 10:39:19,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:39:19,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 10:39:19,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 10:39:19,061 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 142 [2022-07-12 10:39:19,062 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 127 transitions, 320 flow. Second operand has 5 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:19,062 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:39:19,062 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 142 [2022-07-12 10:39:19,062 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:39:19,239 INFO L129 PetriNetUnfolder]: 200/770 cut-off events. [2022-07-12 10:39:19,240 INFO L130 PetriNetUnfolder]: For 274/282 co-relation queries the response was YES. [2022-07-12 10:39:19,242 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1377 conditions, 770 events. 200/770 cut-off events. For 274/282 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4673 event pairs, 30 based on Foata normal form. 12/711 useless extension candidates. Maximal degree in co-relation 1367. Up to 116 conditions per place. [2022-07-12 10:39:19,244 INFO L132 encePairwiseOnDemand]: 135/142 looper letters, 41 selfloop transitions, 9 changer transitions 16/167 dead transitions. [2022-07-12 10:39:19,244 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 167 transitions, 592 flow [2022-07-12 10:39:19,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 10:39:19,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-12 10:39:19,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 984 transitions. [2022-07-12 10:39:19,249 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8661971830985915 [2022-07-12 10:39:19,249 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 984 transitions. [2022-07-12 10:39:19,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 984 transitions. [2022-07-12 10:39:19,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:39:19,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 984 transitions. [2022-07-12 10:39:19,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 123.0) internal successors, (984), 8 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:19,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 142.0) internal successors, (1278), 9 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:19,264 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 142.0) internal successors, (1278), 9 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:19,265 INFO L186 Difference]: Start difference. First operand has 134 places, 127 transitions, 320 flow. Second operand 8 states and 984 transitions. [2022-07-12 10:39:19,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 167 transitions, 592 flow [2022-07-12 10:39:19,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 167 transitions, 585 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-12 10:39:19,268 INFO L242 Difference]: Finished difference. Result has 144 places, 127 transitions, 349 flow [2022-07-12 10:39:19,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=349, PETRI_PLACES=144, PETRI_TRANSITIONS=127} [2022-07-12 10:39:19,269 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 16 predicate places. [2022-07-12 10:39:19,270 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 127 transitions, 349 flow [2022-07-12 10:39:19,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:19,270 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:39:19,270 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] [2022-07-12 10:39:19,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 10:39:19,271 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:39:19,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:39:19,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1421287066, now seen corresponding path program 1 times [2022-07-12 10:39:19,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:39:19,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898447430] [2022-07-12 10:39:19,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:39:19,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:39:19,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:39:19,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:39:19,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:39:19,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898447430] [2022-07-12 10:39:19,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898447430] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:39:19,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:39:19,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 10:39:19,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487431989] [2022-07-12 10:39:19,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:39:19,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:39:19,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:39:19,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:39:19,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:39:19,344 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 142 [2022-07-12 10:39:19,345 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 127 transitions, 349 flow. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:19,345 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:39:19,345 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 142 [2022-07-12 10:39:19,345 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:39:19,385 INFO L129 PetriNetUnfolder]: 51/306 cut-off events. [2022-07-12 10:39:19,386 INFO L130 PetriNetUnfolder]: For 174/175 co-relation queries the response was YES. [2022-07-12 10:39:19,387 INFO L84 FinitePrefix]: Finished finitePrefix Result has 540 conditions, 306 events. 51/306 cut-off events. For 174/175 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 946 event pairs, 10 based on Foata normal form. 8/288 useless extension candidates. Maximal degree in co-relation 526. Up to 72 conditions per place. [2022-07-12 10:39:19,388 INFO L132 encePairwiseOnDemand]: 136/142 looper letters, 17 selfloop transitions, 5 changer transitions 0/127 dead transitions. [2022-07-12 10:39:19,388 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 127 transitions, 367 flow [2022-07-12 10:39:19,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:39:19,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 10:39:19,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2022-07-12 10:39:19,389 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8826291079812206 [2022-07-12 10:39:19,389 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2022-07-12 10:39:19,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2022-07-12 10:39:19,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:39:19,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2022-07-12 10:39:19,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:19,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:19,392 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:19,392 INFO L186 Difference]: Start difference. First operand has 144 places, 127 transitions, 349 flow. Second operand 3 states and 376 transitions. [2022-07-12 10:39:19,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 127 transitions, 367 flow [2022-07-12 10:39:19,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 127 transitions, 343 flow, removed 1 selfloop flow, removed 11 redundant places. [2022-07-12 10:39:19,395 INFO L242 Difference]: Finished difference. Result has 135 places, 125 transitions, 315 flow [2022-07-12 10:39:19,395 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=315, PETRI_PLACES=135, PETRI_TRANSITIONS=125} [2022-07-12 10:39:19,396 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 7 predicate places. [2022-07-12 10:39:19,396 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 125 transitions, 315 flow [2022-07-12 10:39:19,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:19,397 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:39:19,397 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] [2022-07-12 10:39:19,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 10:39:19,397 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:39:19,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:39:19,398 INFO L85 PathProgramCache]: Analyzing trace with hash 234318788, now seen corresponding path program 1 times [2022-07-12 10:39:19,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:39:19,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363266356] [2022-07-12 10:39:19,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:39:19,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:39:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:39:19,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:39:19,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:39:19,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363266356] [2022-07-12 10:39:19,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363266356] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:39:19,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:39:19,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 10:39:19,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736992844] [2022-07-12 10:39:19,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:39:19,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:39:19,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:39:19,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:39:19,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:39:19,444 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 142 [2022-07-12 10:39:19,445 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 125 transitions, 315 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:19,445 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:39:19,445 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 142 [2022-07-12 10:39:19,445 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:39:19,496 INFO L129 PetriNetUnfolder]: 93/395 cut-off events. [2022-07-12 10:39:19,497 INFO L130 PetriNetUnfolder]: For 176/176 co-relation queries the response was YES. [2022-07-12 10:39:19,498 INFO L84 FinitePrefix]: Finished finitePrefix Result has 760 conditions, 395 events. 93/395 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1494 event pairs, 23 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 748. Up to 129 conditions per place. [2022-07-12 10:39:19,499 INFO L132 encePairwiseOnDemand]: 139/142 looper letters, 19 selfloop transitions, 2 changer transitions 0/130 dead transitions. [2022-07-12 10:39:19,499 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 130 transitions, 375 flow [2022-07-12 10:39:19,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:39:19,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 10:39:19,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2022-07-12 10:39:19,501 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9061032863849765 [2022-07-12 10:39:19,501 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 386 transitions. [2022-07-12 10:39:19,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 386 transitions. [2022-07-12 10:39:19,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:39:19,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 386 transitions. [2022-07-12 10:39:19,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:19,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:19,503 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:19,503 INFO L186 Difference]: Start difference. First operand has 135 places, 125 transitions, 315 flow. Second operand 3 states and 386 transitions. [2022-07-12 10:39:19,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 130 transitions, 375 flow [2022-07-12 10:39:19,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 130 transitions, 371 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-12 10:39:19,506 INFO L242 Difference]: Finished difference. Result has 137 places, 125 transitions, 318 flow [2022-07-12 10:39:19,506 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=137, PETRI_TRANSITIONS=125} [2022-07-12 10:39:19,507 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 9 predicate places. [2022-07-12 10:39:19,507 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 125 transitions, 318 flow [2022-07-12 10:39:19,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:19,507 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:39:19,507 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] [2022-07-12 10:39:19,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 10:39:19,508 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:39:19,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:39:19,508 INFO L85 PathProgramCache]: Analyzing trace with hash 773977342, now seen corresponding path program 1 times [2022-07-12 10:39:19,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:39:19,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743444065] [2022-07-12 10:39:19,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:39:19,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:39:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:39:19,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:39:19,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:39:19,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743444065] [2022-07-12 10:39:19,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743444065] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:39:19,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:39:19,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 10:39:19,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318250072] [2022-07-12 10:39:19,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:39:19,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:39:19,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:39:19,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:39:19,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:39:19,595 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 142 [2022-07-12 10:39:19,596 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 125 transitions, 318 flow. Second operand has 8 states, 8 states have (on average 108.0) internal successors, (864), 8 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:19,596 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:39:19,597 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 142 [2022-07-12 10:39:19,597 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:39:19,757 INFO L129 PetriNetUnfolder]: 118/547 cut-off events. [2022-07-12 10:39:19,757 INFO L130 PetriNetUnfolder]: For 266/268 co-relation queries the response was YES. [2022-07-12 10:39:19,759 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1127 conditions, 547 events. 118/547 cut-off events. For 266/268 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2628 event pairs, 56 based on Foata normal form. 2/530 useless extension candidates. Maximal degree in co-relation 1114. Up to 194 conditions per place. [2022-07-12 10:39:19,760 INFO L132 encePairwiseOnDemand]: 132/142 looper letters, 30 selfloop transitions, 6 changer transitions 10/139 dead transitions. [2022-07-12 10:39:19,761 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 139 transitions, 443 flow [2022-07-12 10:39:19,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:39:19,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-12 10:39:19,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 990 transitions. [2022-07-12 10:39:19,763 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7746478873239436 [2022-07-12 10:39:19,763 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 990 transitions. [2022-07-12 10:39:19,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 990 transitions. [2022-07-12 10:39:19,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:39:19,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 990 transitions. [2022-07-12 10:39:19,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 110.0) internal successors, (990), 9 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:19,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 142.0) internal successors, (1420), 10 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:19,768 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 142.0) internal successors, (1420), 10 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:19,768 INFO L186 Difference]: Start difference. First operand has 137 places, 125 transitions, 318 flow. Second operand 9 states and 990 transitions. [2022-07-12 10:39:19,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 139 transitions, 443 flow [2022-07-12 10:39:19,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 139 transitions, 441 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-12 10:39:19,771 INFO L242 Difference]: Finished difference. Result has 148 places, 126 transitions, 342 flow [2022-07-12 10:39:19,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=342, PETRI_PLACES=148, PETRI_TRANSITIONS=126} [2022-07-12 10:39:19,771 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 20 predicate places. [2022-07-12 10:39:19,772 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 126 transitions, 342 flow [2022-07-12 10:39:19,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 108.0) internal successors, (864), 8 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:19,772 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:39:19,772 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:39:19,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 10:39:19,773 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:39:19,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:39:19,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1356837807, now seen corresponding path program 1 times [2022-07-12 10:39:19,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:39:19,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769798824] [2022-07-12 10:39:19,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:39:19,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:39:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:39:20,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:39:20,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:39:20,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769798824] [2022-07-12 10:39:20,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769798824] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:39:20,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898794947] [2022-07-12 10:39:20,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:39:20,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:39:20,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:39:20,489 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:39:20,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 10:39:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:39:20,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-12 10:39:20,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:39:20,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:39:20,689 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 10:39:20,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-12 10:39:20,740 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 10:39:20,741 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 16 treesize of output 22 [2022-07-12 10:39:21,163 INFO L356 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-07-12 10:39:21,164 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 20 treesize of output 30 [2022-07-12 10:39:21,311 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-12 10:39:21,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:39:21,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:39:21,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:39:21,967 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 23 treesize of output 7 [2022-07-12 10:39:22,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:39:22,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:39:23,835 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:39:23,835 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 68 treesize of output 56 [2022-07-12 10:39:23,847 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:39:23,847 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 2636 treesize of output 2524 [2022-07-12 10:39:23,887 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:39:23,887 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 1866 treesize of output 1786 [2022-07-12 10:39:23,916 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:39:23,916 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 2412 treesize of output 2236 [2022-07-12 10:39:23,954 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:39:23,954 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 2220 treesize of output 1852 [2022-07-12 10:39:27,218 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:39:27,218 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 68 treesize of output 56 [2022-07-12 10:39:27,232 INFO L356 Elim1Store]: treesize reduction 12, result has 25.0 percent of original size [2022-07-12 10:39:27,232 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 644 treesize of output 616 [2022-07-12 10:39:27,243 INFO L356 Elim1Store]: treesize reduction 12, result has 25.0 percent of original size [2022-07-12 10:39:27,243 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 612 treesize of output 520 [2022-07-12 10:39:27,258 INFO L356 Elim1Store]: treesize reduction 12, result has 25.0 percent of original size [2022-07-12 10:39:27,259 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 516 treesize of output 472 [2022-07-12 10:39:27,281 INFO L356 Elim1Store]: treesize reduction 12, result has 25.0 percent of original size [2022-07-12 10:39:27,282 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 468 treesize of output 448 [2022-07-12 10:39:30,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:39:30,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898794947] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:39:30,195 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:39:30,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26, 25] total 67 [2022-07-12 10:39:30,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652464201] [2022-07-12 10:39:30,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:39:30,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-07-12 10:39:30,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:39:30,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-07-12 10:39:30,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=3495, Unknown=185, NotChecked=0, Total=4422 [2022-07-12 10:39:30,202 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 142 [2022-07-12 10:39:30,206 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 126 transitions, 342 flow. Second operand has 67 states, 67 states have (on average 58.71641791044776) internal successors, (3934), 67 states have internal predecessors, (3934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:30,206 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:39:30,207 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 142 [2022-07-12 10:39:30,207 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:39:37,420 INFO L129 PetriNetUnfolder]: 7304/13113 cut-off events. [2022-07-12 10:39:37,420 INFO L130 PetriNetUnfolder]: For 8663/8663 co-relation queries the response was YES. [2022-07-12 10:39:37,451 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34258 conditions, 13113 events. 7304/13113 cut-off events. For 8663/8663 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 104866 event pairs, 550 based on Foata normal form. 408/13464 useless extension candidates. Maximal degree in co-relation 34241. Up to 1611 conditions per place. [2022-07-12 10:39:37,484 INFO L132 encePairwiseOnDemand]: 103/142 looper letters, 505 selfloop transitions, 152 changer transitions 54/758 dead transitions. [2022-07-12 10:39:37,484 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 758 transitions, 3897 flow [2022-07-12 10:39:37,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-07-12 10:39:37,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2022-07-12 10:39:37,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 5063 transitions. [2022-07-12 10:39:37,494 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.4571144817623691 [2022-07-12 10:39:37,494 INFO L72 ComplementDD]: Start complementDD. Operand 78 states and 5063 transitions. [2022-07-12 10:39:37,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 5063 transitions. [2022-07-12 10:39:37,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:39:37,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 78 states and 5063 transitions. [2022-07-12 10:39:37,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 79 states, 78 states have (on average 64.91025641025641) internal successors, (5063), 78 states have internal predecessors, (5063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:37,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 79 states, 79 states have (on average 142.0) internal successors, (11218), 79 states have internal predecessors, (11218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:37,516 INFO L81 ComplementDD]: Finished complementDD. Result has 79 states, 79 states have (on average 142.0) internal successors, (11218), 79 states have internal predecessors, (11218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:37,516 INFO L186 Difference]: Start difference. First operand has 148 places, 126 transitions, 342 flow. Second operand 78 states and 5063 transitions. [2022-07-12 10:39:37,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 758 transitions, 3897 flow [2022-07-12 10:39:37,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 758 transitions, 3737 flow, removed 75 selfloop flow, removed 7 redundant places. [2022-07-12 10:39:37,536 INFO L242 Difference]: Finished difference. Result has 257 places, 286 transitions, 1671 flow [2022-07-12 10:39:37,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=78, PETRI_FLOW=1671, PETRI_PLACES=257, PETRI_TRANSITIONS=286} [2022-07-12 10:39:37,537 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 129 predicate places. [2022-07-12 10:39:37,537 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 286 transitions, 1671 flow [2022-07-12 10:39:37,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 58.71641791044776) internal successors, (3934), 67 states have internal predecessors, (3934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:37,539 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:39:37,539 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:39:37,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-12 10:39:37,755 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-12 10:39:37,756 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:39:37,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:39:37,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1818539553, now seen corresponding path program 2 times [2022-07-12 10:39:37,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:39:37,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572050746] [2022-07-12 10:39:37,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:39:37,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:39:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:39:38,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:39:38,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:39:38,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572050746] [2022-07-12 10:39:38,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572050746] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:39:38,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580714484] [2022-07-12 10:39:38,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 10:39:38,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:39:38,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:39:38,088 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:39:38,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 10:39:38,172 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 10:39:38,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:39:38,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-12 10:39:38,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:39:38,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-12 10:39:39,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:39:39,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:39:39,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:39:39,272 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 18 treesize of output 20 [2022-07-12 10:39:39,320 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 23 treesize of output 7 [2022-07-12 10:39:39,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:39:39,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:39:39,523 WARN L833 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (< c_~front~0 0) (and (forall ((v_ArrVal_175 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_175 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))))) is different from false [2022-07-12 10:39:39,792 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_174 (Array Int Int))) (or (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (forall ((v_ArrVal_175 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))))) (forall ((v_ArrVal_174 (Array Int Int))) (or (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (forall ((v_ArrVal_175 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))))) (<= c_~n~0 c_~front~0) (< c_~front~0 0)) is different from false [2022-07-12 10:39:39,876 WARN L833 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (or (forall ((v_ArrVal_175 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)))) (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (forall ((v_ArrVal_175 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))))) (< c_~front~0 0)) is different from false [2022-07-12 10:39:39,976 WARN L833 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (< c_~front~0 0) (and (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (or (forall ((v_ArrVal_175 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) |c_ULTIMATE.start_main_#t~ret9#1.base|) (+ (* c_~front~0 4) |c_ULTIMATE.start_main_#t~ret9#1.offset|))) 1)) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_#t~ret9#1.base|) (+ (* c_~back~0 4) |c_ULTIMATE.start_main_#t~ret9#1.offset|)) 1)))) (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (or (forall ((v_ArrVal_175 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) |c_ULTIMATE.start_main_#t~ret9#1.base|) (+ (* c_~front~0 4) |c_ULTIMATE.start_main_#t~ret9#1.offset|))))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_#t~ret9#1.base|) (+ (* c_~back~0 4) |c_ULTIMATE.start_main_#t~ret9#1.offset|)) 1)))))) is different from false [2022-07-12 10:39:40,019 WARN L833 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (or (forall ((v_ArrVal_175 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) 1)) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)))) (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)) (forall ((v_ArrVal_175 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))))) (< c_~front~0 0)) is different from false [2022-07-12 10:39:40,036 WARN L833 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (forall ((v_ArrVal_175 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (or (forall ((v_ArrVal_175 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 1)) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1))))) (< c_~front~0 0)) is different from false [2022-07-12 10:39:40,052 WARN L833 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (forall ((v_ArrVal_175 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (or (forall ((v_ArrVal_175 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 1)) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1))))) (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (< c_~front~0 0)) is different from false [2022-07-12 10:39:40,088 WARN L833 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post20#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (and (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (forall ((v_ArrVal_175 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (or (forall ((v_ArrVal_175 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 1)) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1))))) (< c_~front~0 0)) is different from false [2022-07-12 10:39:40,115 WARN L833 $PredicateComparison]: unable to prove that (or (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (forall ((v_ArrVal_175 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (or (forall ((v_ArrVal_175 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 1)) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1))))) (< c_~front~0 0)) is different from false [2022-07-12 10:39:40,139 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:39:40,139 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 65 treesize of output 53 [2022-07-12 10:39:40,159 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:39:40,159 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 1504 treesize of output 1440 [2022-07-12 10:39:40,190 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:39:40,190 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 782 treesize of output 738 [2022-07-12 10:39:40,203 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:39:40,204 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 1364 treesize of output 1260 [2022-07-12 10:39:40,213 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 1142 treesize of output 950 [2022-07-12 10:39:41,292 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:39:41,293 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 65 treesize of output 53 [2022-07-12 10:39:41,296 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 10:39:41,302 INFO L356 Elim1Store]: treesize reduction 12, result has 25.0 percent of original size [2022-07-12 10:39:41,302 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 148 treesize of output 136 [2022-07-12 10:39:41,310 INFO L356 Elim1Store]: treesize reduction 12, result has 25.0 percent of original size [2022-07-12 10:39:41,310 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 132 treesize of output 112 [2022-07-12 10:39:41,325 INFO L356 Elim1Store]: treesize reduction 12, result has 25.0 percent of original size [2022-07-12 10:39:41,325 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 83 treesize of output 75 [2022-07-12 10:39:41,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-12 10:39:41,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580714484] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:39:41,858 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:39:41,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 26, 25] total 59 [2022-07-12 10:39:41,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388368866] [2022-07-12 10:39:41,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:39:41,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-07-12 10:39:41,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:39:41,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-07-12 10:39:41,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=2176, Unknown=16, NotChecked=936, Total=3422 [2022-07-12 10:39:41,862 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 142 [2022-07-12 10:39:41,864 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 286 transitions, 1671 flow. Second operand has 59 states, 59 states have (on average 62.932203389830505) internal successors, (3713), 59 states have internal predecessors, (3713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:41,864 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:39:41,864 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 142 [2022-07-12 10:39:41,864 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:39:48,796 INFO L129 PetriNetUnfolder]: 6823/12966 cut-off events. [2022-07-12 10:39:48,797 INFO L130 PetriNetUnfolder]: For 78617/78775 co-relation queries the response was YES. [2022-07-12 10:39:48,862 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47830 conditions, 12966 events. 6823/12966 cut-off events. For 78617/78775 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 107933 event pairs, 572 based on Foata normal form. 320/13206 useless extension candidates. Maximal degree in co-relation 47775. Up to 1449 conditions per place. [2022-07-12 10:39:48,903 INFO L132 encePairwiseOnDemand]: 106/142 looper letters, 507 selfloop transitions, 201 changer transitions 205/967 dead transitions. [2022-07-12 10:39:48,904 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 967 transitions, 8185 flow [2022-07-12 10:39:48,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-07-12 10:39:48,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2022-07-12 10:39:48,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 4897 transitions. [2022-07-12 10:39:48,909 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.478971048513302 [2022-07-12 10:39:48,909 INFO L72 ComplementDD]: Start complementDD. Operand 72 states and 4897 transitions. [2022-07-12 10:39:48,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 4897 transitions. [2022-07-12 10:39:48,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:39:48,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 72 states and 4897 transitions. [2022-07-12 10:39:48,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 73 states, 72 states have (on average 68.01388888888889) internal successors, (4897), 72 states have internal predecessors, (4897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:48,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 73 states, 73 states have (on average 142.0) internal successors, (10366), 73 states have internal predecessors, (10366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:48,925 INFO L81 ComplementDD]: Finished complementDD. Result has 73 states, 73 states have (on average 142.0) internal successors, (10366), 73 states have internal predecessors, (10366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:48,926 INFO L186 Difference]: Start difference. First operand has 257 places, 286 transitions, 1671 flow. Second operand 72 states and 4897 transitions. [2022-07-12 10:39:48,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 967 transitions, 8185 flow [2022-07-12 10:39:49,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 967 transitions, 7350 flow, removed 324 selfloop flow, removed 20 redundant places. [2022-07-12 10:39:49,161 INFO L242 Difference]: Finished difference. Result has 330 places, 377 transitions, 2878 flow [2022-07-12 10:39:49,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=1396, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=72, PETRI_FLOW=2878, PETRI_PLACES=330, PETRI_TRANSITIONS=377} [2022-07-12 10:39:49,162 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 202 predicate places. [2022-07-12 10:39:49,162 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 377 transitions, 2878 flow [2022-07-12 10:39:49,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 62.932203389830505) internal successors, (3713), 59 states have internal predecessors, (3713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:49,164 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:39:49,164 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:39:49,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 10:39:49,380 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-12 10:39:49,381 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:39:49,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:39:49,381 INFO L85 PathProgramCache]: Analyzing trace with hash 908513696, now seen corresponding path program 3 times [2022-07-12 10:39:49,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:39:49,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15075731] [2022-07-12 10:39:49,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:39:49,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:39:49,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:39:49,434 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 10:39:49,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:39:49,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15075731] [2022-07-12 10:39:49,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15075731] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:39:49,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:39:49,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 10:39:49,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999632917] [2022-07-12 10:39:49,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:39:49,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 10:39:49,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:39:49,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 10:39:49,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 10:39:49,437 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 142 [2022-07-12 10:39:49,437 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 377 transitions, 2878 flow. Second operand has 4 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:49,438 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:39:49,438 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 142 [2022-07-12 10:39:49,438 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:39:50,033 INFO L129 PetriNetUnfolder]: 1048/3714 cut-off events. [2022-07-12 10:39:50,033 INFO L130 PetriNetUnfolder]: For 46112/46646 co-relation queries the response was YES. [2022-07-12 10:39:50,065 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15393 conditions, 3714 events. 1048/3714 cut-off events. For 46112/46646 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 31877 event pairs, 96 based on Foata normal form. 151/3734 useless extension candidates. Maximal degree in co-relation 15317. Up to 836 conditions per place. [2022-07-12 10:39:50,080 INFO L132 encePairwiseOnDemand]: 138/142 looper letters, 160 selfloop transitions, 105 changer transitions 0/486 dead transitions. [2022-07-12 10:39:50,081 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 486 transitions, 4415 flow [2022-07-12 10:39:50,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 10:39:50,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-07-12 10:39:50,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 514 transitions. [2022-07-12 10:39:50,082 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9049295774647887 [2022-07-12 10:39:50,082 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 514 transitions. [2022-07-12 10:39:50,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 514 transitions. [2022-07-12 10:39:50,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:39:50,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 514 transitions. [2022-07-12 10:39:50,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:50,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:50,084 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:50,084 INFO L186 Difference]: Start difference. First operand has 330 places, 377 transitions, 2878 flow. Second operand 4 states and 514 transitions. [2022-07-12 10:39:50,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 486 transitions, 4415 flow [2022-07-12 10:39:50,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 486 transitions, 3985 flow, removed 150 selfloop flow, removed 42 redundant places. [2022-07-12 10:39:50,235 INFO L242 Difference]: Finished difference. Result has 293 places, 476 transitions, 4070 flow [2022-07-12 10:39:50,236 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=2550, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4070, PETRI_PLACES=293, PETRI_TRANSITIONS=476} [2022-07-12 10:39:50,237 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 165 predicate places. [2022-07-12 10:39:50,237 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 476 transitions, 4070 flow [2022-07-12 10:39:50,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:50,237 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:39:50,237 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:39:50,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 10:39:50,238 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:39:50,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:39:50,238 INFO L85 PathProgramCache]: Analyzing trace with hash 819852728, now seen corresponding path program 4 times [2022-07-12 10:39:50,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:39:50,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824040356] [2022-07-12 10:39:50,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:39:50,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:39:50,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:39:50,314 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:39:50,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:39:50,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824040356] [2022-07-12 10:39:50,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824040356] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:39:50,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:39:50,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 10:39:50,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354229842] [2022-07-12 10:39:50,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:39:50,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 10:39:50,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:39:50,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 10:39:50,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 10:39:50,316 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 142 [2022-07-12 10:39:50,317 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 476 transitions, 4070 flow. Second operand has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:50,317 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:39:50,317 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 142 [2022-07-12 10:39:50,317 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:39:51,244 INFO L129 PetriNetUnfolder]: 1357/5389 cut-off events. [2022-07-12 10:39:51,245 INFO L130 PetriNetUnfolder]: For 47051/47749 co-relation queries the response was YES. [2022-07-12 10:39:51,286 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21513 conditions, 5389 events. 1357/5389 cut-off events. For 47051/47749 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 51607 event pairs, 121 based on Foata normal form. 254/5508 useless extension candidates. Maximal degree in co-relation 21440. Up to 1125 conditions per place. [2022-07-12 10:39:51,307 INFO L132 encePairwiseOnDemand]: 138/142 looper letters, 307 selfloop transitions, 6 changer transitions 0/514 dead transitions. [2022-07-12 10:39:51,308 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 514 transitions, 5043 flow [2022-07-12 10:39:51,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 10:39:51,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-07-12 10:39:51,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 510 transitions. [2022-07-12 10:39:51,310 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.897887323943662 [2022-07-12 10:39:51,310 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 510 transitions. [2022-07-12 10:39:51,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 510 transitions. [2022-07-12 10:39:51,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:39:51,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 510 transitions. [2022-07-12 10:39:51,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:51,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:51,312 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:51,312 INFO L186 Difference]: Start difference. First operand has 293 places, 476 transitions, 4070 flow. Second operand 4 states and 510 transitions. [2022-07-12 10:39:51,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 514 transitions, 5043 flow [2022-07-12 10:39:51,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 514 transitions, 4945 flow, removed 49 selfloop flow, removed 0 redundant places. [2022-07-12 10:39:51,483 INFO L242 Difference]: Finished difference. Result has 298 places, 455 transitions, 3753 flow [2022-07-12 10:39:51,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=3684, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=449, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3753, PETRI_PLACES=298, PETRI_TRANSITIONS=455} [2022-07-12 10:39:51,483 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 170 predicate places. [2022-07-12 10:39:51,484 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 455 transitions, 3753 flow [2022-07-12 10:39:51,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:51,484 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:39:51,484 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:39:51,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 10:39:51,485 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:39:51,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:39:51,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1261411778, now seen corresponding path program 1 times [2022-07-12 10:39:51,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:39:51,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075849528] [2022-07-12 10:39:51,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:39:51,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:39:51,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:39:51,633 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 10:39:51,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:39:51,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075849528] [2022-07-12 10:39:51,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075849528] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:39:51,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660439679] [2022-07-12 10:39:51,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:39:51,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:39:51,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:39:51,636 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:39:51,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 10:39:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:39:51,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-12 10:39:51,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:39:52,018 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:39:52,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:39:52,408 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:39:52,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660439679] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:39:52,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:39:52,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 10] total 31 [2022-07-12 10:39:52,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924658872] [2022-07-12 10:39:52,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:39:52,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-12 10:39:52,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:39:52,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-12 10:39:52,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=776, Unknown=0, NotChecked=0, Total=930 [2022-07-12 10:39:52,413 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 142 [2022-07-12 10:39:52,479 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 455 transitions, 3753 flow. Second operand has 31 states, 31 states have (on average 104.96774193548387) internal successors, (3254), 31 states have internal predecessors, (3254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:52,479 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:39:52,479 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 142 [2022-07-12 10:39:52,479 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:39:53,513 INFO L129 PetriNetUnfolder]: 1073/3721 cut-off events. [2022-07-12 10:39:53,513 INFO L130 PetriNetUnfolder]: For 29810/30583 co-relation queries the response was YES. [2022-07-12 10:39:53,543 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15117 conditions, 3721 events. 1073/3721 cut-off events. For 29810/30583 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 30460 event pairs, 310 based on Foata normal form. 66/3691 useless extension candidates. Maximal degree in co-relation 15041. Up to 1598 conditions per place. [2022-07-12 10:39:53,555 INFO L132 encePairwiseOnDemand]: 125/142 looper letters, 149 selfloop transitions, 15 changer transitions 53/356 dead transitions. [2022-07-12 10:39:53,556 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 356 transitions, 3028 flow [2022-07-12 10:39:53,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-12 10:39:53,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-07-12 10:39:53,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2422 transitions. [2022-07-12 10:39:53,558 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.741579914268218 [2022-07-12 10:39:53,558 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 2422 transitions. [2022-07-12 10:39:53,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 2422 transitions. [2022-07-12 10:39:53,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:39:53,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 2422 transitions. [2022-07-12 10:39:53,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 105.30434782608695) internal successors, (2422), 23 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:53,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 142.0) internal successors, (3408), 24 states have internal predecessors, (3408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:53,564 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 142.0) internal successors, (3408), 24 states have internal predecessors, (3408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:53,564 INFO L186 Difference]: Start difference. First operand has 298 places, 455 transitions, 3753 flow. Second operand 23 states and 2422 transitions. [2022-07-12 10:39:53,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 356 transitions, 3028 flow [2022-07-12 10:39:53,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 356 transitions, 2914 flow, removed 52 selfloop flow, removed 13 redundant places. [2022-07-12 10:39:53,641 INFO L242 Difference]: Finished difference. Result has 288 places, 294 transitions, 2223 flow [2022-07-12 10:39:53,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=2369, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2223, PETRI_PLACES=288, PETRI_TRANSITIONS=294} [2022-07-12 10:39:53,642 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 160 predicate places. [2022-07-12 10:39:53,642 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 294 transitions, 2223 flow [2022-07-12 10:39:53,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 104.96774193548387) internal successors, (3254), 31 states have internal predecessors, (3254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:53,643 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:39:53,643 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:39:53,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 10:39:53,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:39:53,880 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:39:53,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:39:53,880 INFO L85 PathProgramCache]: Analyzing trace with hash -272176268, now seen corresponding path program 2 times [2022-07-12 10:39:53,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:39:53,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690401110] [2022-07-12 10:39:53,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:39:53,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:39:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:39:54,097 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 10:39:54,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:39:54,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690401110] [2022-07-12 10:39:54,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690401110] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:39:54,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319854051] [2022-07-12 10:39:54,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 10:39:54,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:39:54,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:39:54,100 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:39:54,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 10:39:54,181 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 10:39:54,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:39:54,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-12 10:39:54,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:39:54,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:39:54,383 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 10:39:54,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 10:39:55,227 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 18 treesize of output 20 [2022-07-12 10:39:55,297 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-07-12 10:39:55,297 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 23 treesize of output 10 [2022-07-12 10:39:55,342 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:39:55,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:39:55,435 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_277 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_277) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_277 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_277) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) (<= c_~n~0 c_~front~0) (<= c_~back~0 c_~front~0) (< c_~front~0 0)) is different from false [2022-07-12 10:39:55,498 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_277 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_277) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_277 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_277) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) (<= c_~n~0 c_~front~0) (<= c_~back~0 c_~front~0) (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (< c_~front~0 0)) is different from false [2022-07-12 10:39:55,508 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_277 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_277) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_277 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_277) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) (<= c_~n~0 c_~front~0) (<= c_~back~0 c_~front~0) (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (< c_~front~0 0)) is different from false [2022-07-12 10:39:55,527 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_277 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_277) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_277 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_277) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) (<= c_~n~0 c_~back~0) (<= c_~back~0 c_~front~0) (< c_~front~0 0)) is different from false [2022-07-12 10:39:55,562 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:39:55,562 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 82 treesize of output 74 [2022-07-12 10:39:55,568 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 11 treesize of output 5 [2022-07-12 10:39:57,106 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-07-12 10:39:57,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319854051] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:39:57,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:39:57,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 27, 27] total 62 [2022-07-12 10:39:57,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544815564] [2022-07-12 10:39:57,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:39:57,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-07-12 10:39:57,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:39:57,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-07-12 10:39:57,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=2918, Unknown=4, NotChecked=460, Total=3782 [2022-07-12 10:39:57,111 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 142 [2022-07-12 10:39:57,113 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 294 transitions, 2223 flow. Second operand has 62 states, 62 states have (on average 64.16129032258064) internal successors, (3978), 62 states have internal predecessors, (3978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:39:57,113 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:39:57,113 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 142 [2022-07-12 10:39:57,113 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:40:04,434 INFO L129 PetriNetUnfolder]: 11814/22799 cut-off events. [2022-07-12 10:40:04,435 INFO L130 PetriNetUnfolder]: For 136261/136325 co-relation queries the response was YES. [2022-07-12 10:40:04,679 INFO L84 FinitePrefix]: Finished finitePrefix Result has 97343 conditions, 22799 events. 11814/22799 cut-off events. For 136261/136325 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 194684 event pairs, 1635 based on Foata normal form. 101/22767 useless extension candidates. Maximal degree in co-relation 97271. Up to 11583 conditions per place. [2022-07-12 10:40:04,760 INFO L132 encePairwiseOnDemand]: 103/142 looper letters, 470 selfloop transitions, 603 changer transitions 0/1127 dead transitions. [2022-07-12 10:40:04,761 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 1127 transitions, 11401 flow [2022-07-12 10:40:04,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-07-12 10:40:04,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2022-07-12 10:40:04,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 5398 transitions. [2022-07-12 10:40:04,769 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.4751760563380282 [2022-07-12 10:40:04,769 INFO L72 ComplementDD]: Start complementDD. Operand 80 states and 5398 transitions. [2022-07-12 10:40:04,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 5398 transitions. [2022-07-12 10:40:04,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:40:04,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 80 states and 5398 transitions. [2022-07-12 10:40:04,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 81 states, 80 states have (on average 67.475) internal successors, (5398), 80 states have internal predecessors, (5398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:40:04,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 81 states, 81 states have (on average 142.0) internal successors, (11502), 81 states have internal predecessors, (11502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:40:04,795 INFO L81 ComplementDD]: Finished complementDD. Result has 81 states, 81 states have (on average 142.0) internal successors, (11502), 81 states have internal predecessors, (11502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:40:04,795 INFO L186 Difference]: Start difference. First operand has 288 places, 294 transitions, 2223 flow. Second operand 80 states and 5398 transitions. [2022-07-12 10:40:04,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 1127 transitions, 11401 flow [2022-07-12 10:40:05,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 1127 transitions, 10737 flow, removed 318 selfloop flow, removed 31 redundant places. [2022-07-12 10:40:05,320 INFO L242 Difference]: Finished difference. Result has 346 places, 851 transitions, 9478 flow [2022-07-12 10:40:05,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=2124, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=131, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=80, PETRI_FLOW=9478, PETRI_PLACES=346, PETRI_TRANSITIONS=851} [2022-07-12 10:40:05,320 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 218 predicate places. [2022-07-12 10:40:05,321 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 851 transitions, 9478 flow [2022-07-12 10:40:05,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 64.16129032258064) internal successors, (3978), 62 states have internal predecessors, (3978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:40:05,321 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:40:05,322 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:40:05,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 10:40:05,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:40:05,538 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:40:05,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:40:05,539 INFO L85 PathProgramCache]: Analyzing trace with hash 819256, now seen corresponding path program 3 times [2022-07-12 10:40:05,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:40:05,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327472801] [2022-07-12 10:40:05,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:40:05,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:40:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:40:05,891 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 10:40:05,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:40:05,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327472801] [2022-07-12 10:40:05,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327472801] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:40:05,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102661548] [2022-07-12 10:40:05,892 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 10:40:05,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:40:05,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:40:05,893 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:40:05,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 10:40:06,052 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-12 10:40:06,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:40:06,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-12 10:40:06,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:40:06,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:40:06,814 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 18 treesize of output 20 [2022-07-12 10:40:06,890 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:40:06,891 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 23 treesize of output 23 [2022-07-12 10:40:07,031 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:40:07,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:40:07,259 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_314 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_314) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_314 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_314) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) (<= c_~n~0 c_~back~0) (<= c_~back~0 c_~front~0) (< c_~front~0 0)) is different from false [2022-07-12 10:40:07,308 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:40:07,309 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 82 treesize of output 74 [2022-07-12 10:40:07,315 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 11 treesize of output 5 [2022-07-12 10:40:08,511 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-12 10:40:08,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102661548] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:40:08,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:40:08,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 27, 27] total 61 [2022-07-12 10:40:08,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171369999] [2022-07-12 10:40:08,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:40:08,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-07-12 10:40:08,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:40:08,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-07-12 10:40:08,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=433, Invalid=3110, Unknown=1, NotChecked=116, Total=3660 [2022-07-12 10:40:08,515 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 142 [2022-07-12 10:40:08,517 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 851 transitions, 9478 flow. Second operand has 61 states, 61 states have (on average 66.44262295081967) internal successors, (4053), 61 states have internal predecessors, (4053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:40:08,517 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:40:08,517 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 142 [2022-07-12 10:40:08,517 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:40:24,434 INFO L129 PetriNetUnfolder]: 23753/45354 cut-off events. [2022-07-12 10:40:24,434 INFO L130 PetriNetUnfolder]: For 988479/988669 co-relation queries the response was YES. [2022-07-12 10:40:25,556 INFO L84 FinitePrefix]: Finished finitePrefix Result has 300119 conditions, 45354 events. 23753/45354 cut-off events. For 988479/988669 co-relation queries the response was YES. Maximal size of possible extension queue 1109. Compared 421805 event pairs, 2193 based on Foata normal form. 163/45133 useless extension candidates. Maximal degree in co-relation 300025. Up to 21704 conditions per place. [2022-07-12 10:40:25,787 INFO L132 encePairwiseOnDemand]: 100/142 looper letters, 1176 selfloop transitions, 1507 changer transitions 0/2733 dead transitions. [2022-07-12 10:40:25,787 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 2733 transitions, 37551 flow [2022-07-12 10:40:25,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-07-12 10:40:25,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2022-07-12 10:40:25,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 7142 transitions. [2022-07-12 10:40:25,793 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.4883084917270614 [2022-07-12 10:40:25,793 INFO L72 ComplementDD]: Start complementDD. Operand 103 states and 7142 transitions. [2022-07-12 10:40:25,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 7142 transitions. [2022-07-12 10:40:25,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:40:25,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 103 states and 7142 transitions. [2022-07-12 10:40:25,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 104 states, 103 states have (on average 69.33980582524272) internal successors, (7142), 103 states have internal predecessors, (7142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:40:25,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 104 states, 104 states have (on average 142.0) internal successors, (14768), 104 states have internal predecessors, (14768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:40:25,813 INFO L81 ComplementDD]: Finished complementDD. Result has 104 states, 104 states have (on average 142.0) internal successors, (14768), 104 states have internal predecessors, (14768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:40:25,813 INFO L186 Difference]: Start difference. First operand has 346 places, 851 transitions, 9478 flow. Second operand 103 states and 7142 transitions. [2022-07-12 10:40:25,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 2733 transitions, 37551 flow [2022-07-12 10:40:31,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 2733 transitions, 37141 flow, removed 185 selfloop flow, removed 19 redundant places. [2022-07-12 10:40:31,279 INFO L242 Difference]: Finished difference. Result has 482 places, 2056 transitions, 30875 flow [2022-07-12 10:40:31,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=9254, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=851, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=482, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=103, PETRI_FLOW=30875, PETRI_PLACES=482, PETRI_TRANSITIONS=2056} [2022-07-12 10:40:31,280 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 354 predicate places. [2022-07-12 10:40:31,280 INFO L495 AbstractCegarLoop]: Abstraction has has 482 places, 2056 transitions, 30875 flow [2022-07-12 10:40:31,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 66.44262295081967) internal successors, (4053), 61 states have internal predecessors, (4053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:40:31,281 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:40:31,281 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:40:31,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 10:40:31,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-12 10:40:31,495 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:40:31,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:40:31,496 INFO L85 PathProgramCache]: Analyzing trace with hash -397130738, now seen corresponding path program 4 times [2022-07-12 10:40:31,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:40:31,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178644502] [2022-07-12 10:40:31,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:40:31,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:40:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:40:31,667 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 10:40:31,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:40:31,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178644502] [2022-07-12 10:40:31,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178644502] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:40:31,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223877553] [2022-07-12 10:40:31,668 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 10:40:31,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:40:31,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:40:31,672 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:40:31,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 10:40:31,759 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 10:40:31,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:40:31,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 57 conjunts are in the unsatisfiable core [2022-07-12 10:40:31,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:40:31,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:40:31,927 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 10:40:31,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 10:40:32,780 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 18 treesize of output 20 [2022-07-12 10:40:32,864 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-07-12 10:40:32,865 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 23 treesize of output 10 [2022-07-12 10:40:32,908 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:40:32,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:40:33,027 WARN L833 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_352 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_352) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_352 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_352) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) (< c_~front~0 0)) is different from false [2022-07-12 10:40:33,059 WARN L833 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (and (forall ((v_ArrVal_352 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_352) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_352 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_352) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) (< c_~front~0 0)) is different from false [2022-07-12 10:40:33,097 WARN L833 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_352 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_352) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_352 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_352) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (< c_~front~0 0)) is different from false [2022-07-12 10:40:33,116 WARN L833 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_352 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_352) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_352 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_352) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) (< c_~back~0 0) (< c_~front~0 0)) is different from false [2022-07-12 10:40:33,168 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:40:33,168 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 82 treesize of output 74 [2022-07-12 10:40:33,175 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 11 treesize of output 5 [2022-07-12 10:40:34,759 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-07-12 10:40:34,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223877553] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:40:34,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:40:34,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 27, 27] total 61 [2022-07-12 10:40:34,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218491453] [2022-07-12 10:40:34,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:40:34,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-07-12 10:40:34,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:40:34,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-07-12 10:40:34,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=2889, Unknown=4, NotChecked=452, Total=3660 [2022-07-12 10:40:34,762 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 142 [2022-07-12 10:40:34,764 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 482 places, 2056 transitions, 30875 flow. Second operand has 61 states, 61 states have (on average 62.459016393442624) internal successors, (3810), 61 states have internal predecessors, (3810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:40:34,764 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:40:34,764 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 142 [2022-07-12 10:40:34,764 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:41:08,230 INFO L129 PetriNetUnfolder]: 33312/63690 cut-off events. [2022-07-12 10:41:08,230 INFO L130 PetriNetUnfolder]: For 3044379/3045286 co-relation queries the response was YES.