/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_REDUNDANT_FLOW -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 13:24:45,590 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 13:24:45,591 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 13:24:45,623 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 13:24:45,624 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 13:24:45,624 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 13:24:45,625 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 13:24:45,626 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 13:24:45,627 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 13:24:45,628 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 13:24:45,629 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 13:24:45,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 13:24:45,630 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 13:24:45,630 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 13:24:45,631 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 13:24:45,632 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 13:24:45,632 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 13:24:45,633 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 13:24:45,634 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 13:24:45,635 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 13:24:45,636 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 13:24:45,637 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 13:24:45,637 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 13:24:45,638 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 13:24:45,640 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 13:24:45,640 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 13:24:45,641 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 13:24:45,641 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 13:24:45,641 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 13:24:45,642 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 13:24:45,642 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 13:24:45,643 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 13:24:45,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 13:24:45,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 13:24:45,644 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 13:24:45,644 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 13:24:45,645 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 13:24:45,645 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 13:24:45,645 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 13:24:45,646 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 13:24:45,646 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 13:24:45,647 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-12 13:24:45,662 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 13:24:45,663 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 13:24:45,663 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 13:24:45,663 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 13:24:45,664 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 13:24:45,664 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 13:24:45,664 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 13:24:45,664 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 13:24:45,665 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 13:24:45,665 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 13:24:45,665 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 13:24:45,665 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 13:24:45,665 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 13:24:45,665 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 13:24:45,665 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 13:24:45,665 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 13:24:45,666 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 13:24:45,666 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 13:24:45,666 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 13:24:45,666 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 13:24:45,666 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 13:24:45,666 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 13:24:45,666 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 13:24:45,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 13:24:45,667 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 13:24:45,667 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 13:24:45,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 13:24:45,667 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-12 13:24:45,667 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 13:24:45,667 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 13:24:45,667 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 13:24:45,668 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.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_REDUNDANT_FLOW [2022-12-12 13:24:45,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 13:24:45,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 13:24:45,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 13:24:45,921 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 13:24:45,921 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 13:24:45,924 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c [2022-12-12 13:24:46,816 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 13:24:47,002 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 13:24:47,003 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c [2022-12-12 13:24:47,007 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf104de41/c6a989e07437488c8aeccb337a1c09c6/FLAGd6f25b466 [2022-12-12 13:24:47,018 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf104de41/c6a989e07437488c8aeccb337a1c09c6 [2022-12-12 13:24:47,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 13:24:47,021 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 13:24:47,022 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 13:24:47,022 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 13:24:47,024 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 13:24:47,024 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 01:24:47" (1/1) ... [2022-12-12 13:24:47,025 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@794795d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:24:47, skipping insertion in model container [2022-12-12 13:24:47,025 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 01:24:47" (1/1) ... [2022-12-12 13:24:47,029 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 13:24:47,041 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 13:24:47,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 13:24:47,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 13:24:47,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 13:24:47,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 13:24:47,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 13:24:47,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 13:24:47,201 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c[2553,2566] [2022-12-12 13:24:47,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 13:24:47,224 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 13:24:47,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 13:24:47,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 13:24:47,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 13:24:47,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 13:24:47,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 13:24:47,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 13:24:47,257 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c[2553,2566] [2022-12-12 13:24:47,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 13:24:47,274 INFO L208 MainTranslator]: Completed translation [2022-12-12 13:24:47,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:24:47 WrapperNode [2022-12-12 13:24:47,275 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 13:24:47,276 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 13:24:47,277 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 13:24:47,277 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 13:24:47,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:24:47" (1/1) ... [2022-12-12 13:24:47,296 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:24:47" (1/1) ... [2022-12-12 13:24:47,317 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 101 [2022-12-12 13:24:47,318 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 13:24:47,319 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 13:24:47,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 13:24:47,319 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 13:24:47,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:24:47" (1/1) ... [2022-12-12 13:24:47,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:24:47" (1/1) ... [2022-12-12 13:24:47,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:24:47" (1/1) ... [2022-12-12 13:24:47,339 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:24:47" (1/1) ... [2022-12-12 13:24:47,344 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:24:47" (1/1) ... [2022-12-12 13:24:47,346 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:24:47" (1/1) ... [2022-12-12 13:24:47,347 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:24:47" (1/1) ... [2022-12-12 13:24:47,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:24:47" (1/1) ... [2022-12-12 13:24:47,350 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 13:24:47,350 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 13:24:47,350 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 13:24:47,350 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 13:24:47,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:24:47" (1/1) ... [2022-12-12 13:24:47,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 13:24:47,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:24:47,379 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-12-12 13:24:47,387 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-12-12 13:24:47,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 13:24:47,419 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-12 13:24:47,419 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-12 13:24:47,419 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-12 13:24:47,419 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-12 13:24:47,419 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-12 13:24:47,419 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-12 13:24:47,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 13:24:47,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 13:24:47,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 13:24:47,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 13:24:47,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 13:24:47,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-12 13:24:47,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 13:24:47,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 13:24:47,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-12 13:24:47,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 13:24:47,421 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 13:24:47,524 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 13:24:47,525 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 13:24:47,789 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 13:24:47,833 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 13:24:47,833 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-12 13:24:47,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 01:24:47 BoogieIcfgContainer [2022-12-12 13:24:47,835 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 13:24:47,837 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 13:24:47,837 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 13:24:47,839 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 13:24:47,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 01:24:47" (1/3) ... [2022-12-12 13:24:47,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@713e7556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 01:24:47, skipping insertion in model container [2022-12-12 13:24:47,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:24:47" (2/3) ... [2022-12-12 13:24:47,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@713e7556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 01:24:47, skipping insertion in model container [2022-12-12 13:24:47,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 01:24:47" (3/3) ... [2022-12-12 13:24:47,841 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array.wvr.c [2022-12-12 13:24:47,853 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 13:24:47,853 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-12 13:24:47,853 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 13:24:47,913 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-12 13:24:47,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 141 transitions, 306 flow [2022-12-12 13:24:47,976 INFO L130 PetriNetUnfolder]: 12/138 cut-off events. [2022-12-12 13:24:47,976 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-12 13:24:47,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 12/138 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 92 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-12-12 13:24:47,980 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 141 transitions, 306 flow [2022-12-12 13:24:47,984 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 128 transitions, 274 flow [2022-12-12 13:24:47,991 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 13:24:47,996 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=false, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@50d61d01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 13:24:47,996 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-12 13:24:48,017 INFO L130 PetriNetUnfolder]: 12/127 cut-off events. [2022-12-12 13:24:48,017 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-12 13:24:48,018 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:24:48,018 INFO L214 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] [2022-12-12 13:24:48,019 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-12-12 13:24:48,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:24:48,022 INFO L85 PathProgramCache]: Analyzing trace with hash 633810826, now seen corresponding path program 1 times [2022-12-12 13:24:48,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:24:48,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693910446] [2022-12-12 13:24:48,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:24:48,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:24:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:24:48,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:24:48,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:24:48,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693910446] [2022-12-12 13:24:48,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693910446] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 13:24:48,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 13:24:48,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 13:24:48,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899397032] [2022-12-12 13:24:48,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 13:24:48,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 13:24:48,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:24:48,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 13:24:48,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-12 13:24:48,641 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 141 [2022-12-12 13:24:48,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 128 transitions, 274 flow. Second operand has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 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-12-12 13:24:48,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:24:48,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 141 [2022-12-12 13:24:48,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:24:48,884 INFO L130 PetriNetUnfolder]: 54/337 cut-off events. [2022-12-12 13:24:48,884 INFO L131 PetriNetUnfolder]: For 71/72 co-relation queries the response was YES. [2022-12-12 13:24:48,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 337 events. 54/337 cut-off events. For 71/72 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1166 event pairs, 6 based on Foata normal form. 62/359 useless extension candidates. Maximal degree in co-relation 275. Up to 52 conditions per place. [2022-12-12 13:24:48,891 INFO L137 encePairwiseOnDemand]: 121/141 looper letters, 39 selfloop transitions, 6 changer transitions 10/144 dead transitions. [2022-12-12 13:24:48,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 144 transitions, 443 flow [2022-12-12 13:24:48,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 13:24:48,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 13:24:48,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 981 transitions. [2022-12-12 13:24:48,908 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7730496453900709 [2022-12-12 13:24:48,911 INFO L295 CegarLoopForPetriNet]: 126 programPoint places, 8 predicate places. [2022-12-12 13:24:48,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 144 transitions, 443 flow [2022-12-12 13:24:48,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 144 transitions, 387 flow, removed 13 selfloop flow, removed 6 redundant places. [2022-12-12 13:24:48,919 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 144 transitions, 387 flow [2022-12-12 13:24:48,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 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-12-12 13:24:48,920 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:24:48,920 INFO L214 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-12-12 13:24:48,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 13:24:48,921 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-12-12 13:24:48,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:24:48,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1466465809, now seen corresponding path program 1 times [2022-12-12 13:24:48,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:24:48,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551372877] [2022-12-12 13:24:48,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:24:48,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:24:48,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:24:49,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:24:49,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:24:49,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551372877] [2022-12-12 13:24:49,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551372877] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 13:24:49,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 13:24:49,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 13:24:49,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931531962] [2022-12-12 13:24:49,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 13:24:49,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 13:24:49,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:24:49,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 13:24:49,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-12 13:24:49,126 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 141 [2022-12-12 13:24:49,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 144 transitions, 387 flow. Second operand has 7 states, 7 states have (on average 104.42857142857143) internal successors, (731), 7 states have internal predecessors, (731), 0 states have call successors, (0), 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-12-12 13:24:49,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:24:49,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 141 [2022-12-12 13:24:49,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:24:49,382 INFO L130 PetriNetUnfolder]: 373/1219 cut-off events. [2022-12-12 13:24:49,383 INFO L131 PetriNetUnfolder]: For 344/409 co-relation queries the response was YES. [2022-12-12 13:24:49,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2199 conditions, 1219 events. 373/1219 cut-off events. For 344/409 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 7722 event pairs, 127 based on Foata normal form. 0/1033 useless extension candidates. Maximal degree in co-relation 466. Up to 422 conditions per place. [2022-12-12 13:24:49,392 INFO L137 encePairwiseOnDemand]: 132/141 looper letters, 69 selfloop transitions, 8 changer transitions 11/177 dead transitions. [2022-12-12 13:24:49,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 177 transitions, 664 flow [2022-12-12 13:24:49,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 13:24:49,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 13:24:49,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 864 transitions. [2022-12-12 13:24:49,394 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7659574468085106 [2022-12-12 13:24:49,395 INFO L295 CegarLoopForPetriNet]: 126 programPoint places, 9 predicate places. [2022-12-12 13:24:49,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 177 transitions, 664 flow [2022-12-12 13:24:49,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 177 transitions, 649 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-12 13:24:49,402 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 177 transitions, 649 flow [2022-12-12 13:24:49,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 104.42857142857143) internal successors, (731), 7 states have internal predecessors, (731), 0 states have call successors, (0), 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-12-12 13:24:49,402 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:24:49,403 INFO L214 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-12-12 13:24:49,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 13:24:49,403 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-12-12 13:24:49,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:24:49,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1758512283, now seen corresponding path program 1 times [2022-12-12 13:24:49,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:24:49,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118514590] [2022-12-12 13:24:49,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:24:49,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:24:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:24:49,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:24:49,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:24:49,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118514590] [2022-12-12 13:24:49,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118514590] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 13:24:49,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 13:24:49,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-12 13:24:49,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965788696] [2022-12-12 13:24:49,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 13:24:49,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 13:24:49,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:24:49,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 13:24:49,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-12-12 13:24:49,725 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 141 [2022-12-12 13:24:49,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 177 transitions, 649 flow. Second operand has 8 states, 8 states have (on average 86.75) internal successors, (694), 8 states have internal predecessors, (694), 0 states have call successors, (0), 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-12-12 13:24:49,726 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:24:49,726 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 141 [2022-12-12 13:24:49,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:24:49,923 INFO L130 PetriNetUnfolder]: 682/1465 cut-off events. [2022-12-12 13:24:49,924 INFO L131 PetriNetUnfolder]: For 719/893 co-relation queries the response was YES. [2022-12-12 13:24:49,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3565 conditions, 1465 events. 682/1465 cut-off events. For 719/893 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 8861 event pairs, 416 based on Foata normal form. 1/1103 useless extension candidates. Maximal degree in co-relation 1125. Up to 947 conditions per place. [2022-12-12 13:24:49,933 INFO L137 encePairwiseOnDemand]: 131/141 looper letters, 62 selfloop transitions, 6 changer transitions 15/153 dead transitions. [2022-12-12 13:24:49,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 153 transitions, 662 flow [2022-12-12 13:24:49,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 13:24:49,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 13:24:49,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 716 transitions. [2022-12-12 13:24:49,935 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6347517730496454 [2022-12-12 13:24:49,936 INFO L295 CegarLoopForPetriNet]: 126 programPoint places, 12 predicate places. [2022-12-12 13:24:49,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 153 transitions, 662 flow [2022-12-12 13:24:49,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 153 transitions, 588 flow, removed 33 selfloop flow, removed 3 redundant places. [2022-12-12 13:24:49,940 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 153 transitions, 588 flow [2022-12-12 13:24:49,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 86.75) internal successors, (694), 8 states have internal predecessors, (694), 0 states have call successors, (0), 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-12-12 13:24:49,940 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:24:49,941 INFO L214 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] [2022-12-12 13:24:49,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 13:24:49,941 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-12-12 13:24:49,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:24:49,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1783149541, now seen corresponding path program 1 times [2022-12-12 13:24:49,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:24:49,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891171893] [2022-12-12 13:24:49,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:24:49,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:24:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:24:50,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:24:50,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:24:50,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891171893] [2022-12-12 13:24:50,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891171893] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 13:24:50,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141398068] [2022-12-12 13:24:50,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:24:50,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:24:50,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:24:50,093 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-12-12 13:24:50,124 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-12-12 13:24:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:24:50,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-12 13:24:50,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 13:24:50,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:24:50,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 13:24:50,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:24:50,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141398068] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-12 13:24:50,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-12 13:24:50,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-12-12 13:24:50,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796235564] [2022-12-12 13:24:50,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 13:24:50,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-12 13:24:50,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:24:50,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-12 13:24:50,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-12-12 13:24:50,603 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 141 [2022-12-12 13:24:50,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 153 transitions, 588 flow. Second operand has 9 states, 9 states have (on average 97.33333333333333) internal successors, (876), 9 states have internal predecessors, (876), 0 states have call successors, (0), 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-12-12 13:24:50,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:24:50,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 141 [2022-12-12 13:24:50,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:24:51,035 INFO L130 PetriNetUnfolder]: 1920/3543 cut-off events. [2022-12-12 13:24:51,036 INFO L131 PetriNetUnfolder]: For 3706/4857 co-relation queries the response was YES. [2022-12-12 13:24:51,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11237 conditions, 3543 events. 1920/3543 cut-off events. For 3706/4857 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 23984 event pairs, 518 based on Foata normal form. 6/2830 useless extension candidates. Maximal degree in co-relation 1736. Up to 2115 conditions per place. [2022-12-12 13:24:51,058 INFO L137 encePairwiseOnDemand]: 130/141 looper letters, 130 selfloop transitions, 17 changer transitions 15/244 dead transitions. [2022-12-12 13:24:51,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 244 transitions, 1517 flow [2022-12-12 13:24:51,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-12 13:24:51,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-12 13:24:51,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1131 transitions. [2022-12-12 13:24:51,061 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7292069632495164 [2022-12-12 13:24:51,062 INFO L295 CegarLoopForPetriNet]: 126 programPoint places, 19 predicate places. [2022-12-12 13:24:51,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 244 transitions, 1517 flow [2022-12-12 13:24:51,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 244 transitions, 1308 flow, removed 102 selfloop flow, removed 3 redundant places. [2022-12-12 13:24:51,068 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 244 transitions, 1308 flow [2022-12-12 13:24:51,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 97.33333333333333) internal successors, (876), 9 states have internal predecessors, (876), 0 states have call successors, (0), 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-12-12 13:24:51,068 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:24:51,069 INFO L214 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] [2022-12-12 13:24:51,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-12 13:24:51,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:24:51,276 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-12-12 13:24:51,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:24:51,277 INFO L85 PathProgramCache]: Analyzing trace with hash 437441523, now seen corresponding path program 2 times [2022-12-12 13:24:51,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:24:51,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2234872] [2022-12-12 13:24:51,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:24:51,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:24:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:24:51,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:24:51,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:24:51,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2234872] [2022-12-12 13:24:51,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2234872] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 13:24:51,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558979785] [2022-12-12 13:24:51,391 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 13:24:51,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:24:51,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:24:51,392 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-12-12 13:24:51,411 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-12-12 13:24:51,479 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-12 13:24:51,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 13:24:51,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-12 13:24:51,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 13:24:51,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 13:24:51,614 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-12 13:24:51,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558979785] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 13:24:51,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-12 13:24:51,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-12-12 13:24:51,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831237631] [2022-12-12 13:24:51,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 13:24:51,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 13:24:51,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:24:51,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 13:24:51,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-12-12 13:24:51,617 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 141 [2022-12-12 13:24:51,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 244 transitions, 1308 flow. Second operand has 6 states, 6 states have (on average 94.5) internal successors, (567), 6 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 13:24:51,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:24:51,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 141 [2022-12-12 13:24:51,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:24:52,211 INFO L130 PetriNetUnfolder]: 1888/3599 cut-off events. [2022-12-12 13:24:52,212 INFO L131 PetriNetUnfolder]: For 4758/6629 co-relation queries the response was YES. [2022-12-12 13:24:52,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12323 conditions, 3599 events. 1888/3599 cut-off events. For 4758/6629 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 24605 event pairs, 452 based on Foata normal form. 28/2988 useless extension candidates. Maximal degree in co-relation 2219. Up to 1810 conditions per place. [2022-12-12 13:24:52,249 INFO L137 encePairwiseOnDemand]: 132/141 looper letters, 162 selfloop transitions, 16 changer transitions 10/276 dead transitions. [2022-12-12 13:24:52,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 276 transitions, 1961 flow [2022-12-12 13:24:52,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 13:24:52,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 13:24:52,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 765 transitions. [2022-12-12 13:24:52,252 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6781914893617021 [2022-12-12 13:24:52,255 INFO L295 CegarLoopForPetriNet]: 126 programPoint places, 21 predicate places. [2022-12-12 13:24:52,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 276 transitions, 1961 flow [2022-12-12 13:24:52,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 276 transitions, 1714 flow, removed 116 selfloop flow, removed 5 redundant places. [2022-12-12 13:24:52,267 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 276 transitions, 1714 flow [2022-12-12 13:24:52,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.5) internal successors, (567), 6 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 13:24:52,268 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:24:52,268 INFO L214 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] [2022-12-12 13:24:52,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-12 13:24:52,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:24:52,475 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-12-12 13:24:52,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:24:52,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1963838563, now seen corresponding path program 1 times [2022-12-12 13:24:52,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:24:52,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577602855] [2022-12-12 13:24:52,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:24:52,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:24:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:24:52,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:24:52,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:24:52,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577602855] [2022-12-12 13:24:52,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577602855] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 13:24:52,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074583100] [2022-12-12 13:24:52,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:24:52,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:24:52,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:24:52,634 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-12-12 13:24:52,658 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-12-12 13:24:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:24:52,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-12 13:24:52,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 13:24:52,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:24:52,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 13:24:52,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:24:52,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074583100] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-12 13:24:52,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-12 13:24:52,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-12-12 13:24:52,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073419942] [2022-12-12 13:24:52,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 13:24:52,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 13:24:52,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:24:52,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 13:24:52,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-12-12 13:24:52,904 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 141 [2022-12-12 13:24:52,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 276 transitions, 1714 flow. Second operand has 7 states, 7 states have (on average 104.71428571428571) internal successors, (733), 7 states have internal predecessors, (733), 0 states have call successors, (0), 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-12-12 13:24:52,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:24:52,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 141 [2022-12-12 13:24:52,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:24:53,169 INFO L130 PetriNetUnfolder]: 1514/2776 cut-off events. [2022-12-12 13:24:53,170 INFO L131 PetriNetUnfolder]: For 4446/5673 co-relation queries the response was YES. [2022-12-12 13:24:53,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9881 conditions, 2776 events. 1514/2776 cut-off events. For 4446/5673 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 16888 event pairs, 194 based on Foata normal form. 48/2421 useless extension candidates. Maximal degree in co-relation 9738. Up to 1437 conditions per place. [2022-12-12 13:24:53,187 INFO L137 encePairwiseOnDemand]: 133/141 looper letters, 164 selfloop transitions, 15 changer transitions 9/296 dead transitions. [2022-12-12 13:24:53,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 296 transitions, 2232 flow [2022-12-12 13:24:53,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 13:24:53,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 13:24:53,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 749 transitions. [2022-12-12 13:24:53,189 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7588652482269503 [2022-12-12 13:24:53,190 INFO L295 CegarLoopForPetriNet]: 126 programPoint places, 21 predicate places. [2022-12-12 13:24:53,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 296 transitions, 2232 flow [2022-12-12 13:24:53,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 296 transitions, 2027 flow, removed 99 selfloop flow, removed 4 redundant places. [2022-12-12 13:24:53,196 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 296 transitions, 2027 flow [2022-12-12 13:24:53,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 104.71428571428571) internal successors, (733), 7 states have internal predecessors, (733), 0 states have call successors, (0), 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-12-12 13:24:53,196 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:24:53,196 INFO L214 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] [2022-12-12 13:24:53,205 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-12-12 13:24:53,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:24:53,404 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-12-12 13:24:53,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:24:53,404 INFO L85 PathProgramCache]: Analyzing trace with hash 2100372846, now seen corresponding path program 1 times [2022-12-12 13:24:53,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:24:53,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975714413] [2022-12-12 13:24:53,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:24:53,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:24:53,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:24:54,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:24:54,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:24:54,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975714413] [2022-12-12 13:24:54,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975714413] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 13:24:54,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927454392] [2022-12-12 13:24:54,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:24:54,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:24:54,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:24:54,793 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-12-12 13:24:54,804 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-12-12 13:24:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:24:54,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-12 13:24:54,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 13:24:55,405 INFO L350 Elim1Store]: Elim1 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-12-12 13:24:56,031 INFO L350 Elim1Store]: Elim1 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-12-12 13:24:56,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 13:24:56,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-12-12 13:24:56,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 13:24:56,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-12-12 13:24:56,596 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 13:24:56,599 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:24:56,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 36 [2022-12-12 13:24:56,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:24:56,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 13:24:56,928 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_175 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) c_~A~0.base) .cse0) c_~min2~0))) (forall ((v_ArrVal_175 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) c_~A~0.base) .cse0))) (or (= c_~min1~0 .cse1) (not (< .cse1 c_~min2~0))))))) is different from false [2022-12-12 13:24:59,193 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4)))) (.cse2 (+ c_~A~0.offset (* 4 c_~M~0)))) (let ((.cse0 (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (< (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_~A~0.base) .cse2) c_~min2~0))) (.cse3 (< .cse5 c_~min1~0))) (and (or (and (or (= c_~min2~0 c_~min1~0) .cse0) (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse1 (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_~A~0.base) .cse2))) (or (= c_~min1~0 .cse1) (not (< .cse1 c_~min2~0)))))) .cse3) (or (and (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse4 (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_~A~0.base) .cse2))) (or (= .cse4 .cse5) (not (< .cse4 c_~min2~0))))) (or .cse0 (= c_~min2~0 .cse5))) (not .cse3))))) is different from false [2022-12-12 13:24:59,438 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_173 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173))) (let ((.cse0 (select (select .cse1 c_~A~0.base) c_~A~0.offset))) (or (= c_~min2~0 .cse0) (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) c_~A~0.base) .cse2) c_~min2~0)) (not (< .cse0 c_~min1~0)))))) (forall ((v_ArrVal_173 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173))) (or (< (select (select .cse3 c_~A~0.base) c_~A~0.offset) c_~min1~0) (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse4 (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) c_~A~0.base) .cse2))) (or (= c_~min1~0 .cse4) (not (< .cse4 c_~min2~0)))))))) (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173))) (or (< (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) c_~A~0.base) .cse2) c_~min2~0) (< (select (select .cse5 c_~A~0.base) c_~A~0.offset) c_~min1~0))))) (forall ((v_ArrVal_173 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173))) (let ((.cse7 (select (select .cse8 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse6 (select (select (store (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) c_~A~0.base) .cse2))) (or (not (< .cse6 c_~min2~0)) (= .cse7 .cse6)))) (not (< .cse7 c_~min1~0)))))))) is different from false [2022-12-12 13:24:59,554 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse2 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_173 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173))) (let ((.cse0 (select (select .cse1 c_~A~0.base) c_~A~0.offset))) (or (= c_~min2~0 .cse0) (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) c_~A~0.base) .cse2) c_~min2~0)) (not (< .cse0 c_~min1~0)))))) (forall ((v_ArrVal_173 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173))) (or (< (select (select .cse3 c_~A~0.base) c_~A~0.offset) c_~min1~0) (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse4 (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) c_~A~0.base) .cse2))) (or (= c_~min1~0 .cse4) (not (< .cse4 c_~min2~0)))))))) (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173))) (or (< (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) c_~A~0.base) .cse2) c_~min2~0) (< (select (select .cse5 c_~A~0.base) c_~A~0.offset) c_~min1~0))))) (forall ((v_ArrVal_173 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173))) (let ((.cse7 (select (select .cse8 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse6 (select (select (store (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) c_~A~0.base) .cse2))) (or (not (< .cse6 c_~min2~0)) (= .cse7 .cse6)))) (not (< .cse7 c_~min1~0)))))))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) is different from false [2022-12-12 13:24:59,610 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse2 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_173 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173))) (let ((.cse0 (select (select .cse1 c_~A~0.base) c_~A~0.offset))) (or (= c_~min2~0 .cse0) (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) c_~A~0.base) .cse2) c_~min2~0)) (not (< .cse0 c_~min1~0)))))) (forall ((v_ArrVal_173 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173))) (or (< (select (select .cse3 c_~A~0.base) c_~A~0.offset) c_~min1~0) (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse4 (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) c_~A~0.base) .cse2))) (or (= c_~min1~0 .cse4) (not (< .cse4 c_~min2~0)))))))) (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173))) (or (< (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) c_~A~0.base) .cse2) c_~min2~0) (< (select (select .cse5 c_~A~0.base) c_~A~0.offset) c_~min1~0))))) (forall ((v_ArrVal_173 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173))) (let ((.cse7 (select (select .cse8 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse6 (select (select (store (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) c_~A~0.base) .cse2))) (or (not (< .cse6 c_~min2~0)) (= .cse7 .cse6)))) (not (< .cse7 c_~min1~0)))))))) (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) is different from false [2022-12-12 13:25:08,769 WARN L233 SmtUtils]: Spent 8.91s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 13:25:17,140 WARN L233 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 13:25:25,441 WARN L233 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 13:25:33,774 WARN L233 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 13:25:40,073 WARN L233 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 13:25:51,408 WARN L233 SmtUtils]: Spent 11.08s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 13:26:02,664 WARN L233 SmtUtils]: Spent 11.04s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 13:26:02,787 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:26:02,789 INFO L350 Elim1Store]: Elim1 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 78 treesize of output 54 [2022-12-12 13:26:02,800 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:26:02,801 INFO L350 Elim1Store]: Elim1 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 189 treesize of output 183 [2022-12-12 13:26:02,809 INFO L350 Elim1Store]: Elim1 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 136 treesize of output 112 [2022-12-12 13:26:02,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 100 [2022-12-12 13:26:02,823 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:26:02,824 INFO L350 Elim1Store]: Elim1 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 82 treesize of output 82 [2022-12-12 13:26:03,192 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:26:03,193 INFO L350 Elim1Store]: Elim1 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 55 treesize of output 43 [2022-12-12 13:26:03,197 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 13:26:03,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 13:26:03,207 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 13:26:03,207 INFO L350 Elim1Store]: Elim1 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 51 treesize of output 43 [2022-12-12 13:26:03,218 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 13:26:03,218 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 19 [2022-12-12 13:26:03,233 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 13:26:03,233 INFO L350 Elim1Store]: Elim1 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 108 treesize of output 1 [2022-12-12 13:26:03,241 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 13:26:03,241 INFO L350 Elim1Store]: Elim1 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 88 treesize of output 1 [2022-12-12 13:26:04,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-12 13:26:04,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927454392] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 13:26:04,265 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 13:26:04,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 29] total 77 [2022-12-12 13:26:04,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419353198] [2022-12-12 13:26:04,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 13:26:04,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-12-12 13:26:04,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:26:04,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-12-12 13:26:04,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=517, Invalid=4590, Unknown=25, NotChecked=720, Total=5852 [2022-12-12 13:26:04,269 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 141 [2022-12-12 13:26:04,272 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 296 transitions, 2027 flow. Second operand has 77 states, 77 states have (on average 45.55844155844156) internal successors, (3508), 77 states have internal predecessors, (3508), 0 states have call successors, (0), 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-12-12 13:26:04,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:26:04,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 141 [2022-12-12 13:26:04,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:26:33,641 WARN L233 SmtUtils]: Spent 28.84s on a formula simplification. DAG size of input: 198 DAG size of output: 185 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 13:26:46,283 WARN L233 SmtUtils]: Spent 6.51s on a formula simplification. DAG size of input: 141 DAG size of output: 126 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 13:26:58,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-12 13:27:09,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-12 13:27:19,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-12 13:27:21,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-12 13:27:23,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-12 13:27:40,717 WARN L233 SmtUtils]: Spent 12.49s on a formula simplification. DAG size of input: 111 DAG size of output: 64 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 13:27:49,171 WARN L233 SmtUtils]: Spent 8.33s on a formula simplification. DAG size of input: 56 DAG size of output: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 13:27:55,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-12 13:28:00,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-12 13:28:12,099 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse9 (select |c_#memory_int| c_~A~0.base))) (let ((.cse2 (select .cse9 c_~A~0.offset)) (.cse1 (select .cse9 .cse4))) (let ((.cse0 (< .cse1 c_~min2~0)) (.cse5 (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (< (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_~A~0.base) .cse4) c_~min2~0))) (.cse6 (< .cse2 c_~min1~0)) (.cse7 (= c_~min2~0 c_~min1~0))) (and (or (not .cse0) (= c_~min1~0 .cse1)) (or (and (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse3 (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_~A~0.base) .cse4))) (or (= .cse2 .cse3) (not (< .cse3 c_~min2~0))))) (or .cse5 (= c_~min2~0 .cse2))) (not .cse6)) (or .cse7 .cse0) (or (and (or .cse7 .cse5) (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse8 (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_~A~0.base) .cse4))) (or (= c_~min1~0 .cse8) (not (< .cse8 c_~min2~0)))))) .cse6) (or (and .cse7 (< c_~min2~0 0)) (and (= c_~min1~0 0) (= c_~min2~0 0))))))) is different from false [2022-12-12 13:28:22,198 INFO L130 PetriNetUnfolder]: 9759/16012 cut-off events. [2022-12-12 13:28:22,198 INFO L131 PetriNetUnfolder]: For 23212/23581 co-relation queries the response was YES. [2022-12-12 13:28:22,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60286 conditions, 16012 events. 9759/16012 cut-off events. For 23212/23581 co-relation queries the response was YES. Maximal size of possible extension queue 910. Compared 120350 event pairs, 1019 based on Foata normal form. 127/13933 useless extension candidates. Maximal degree in co-relation 58530. Up to 4760 conditions per place. [2022-12-12 13:28:22,342 INFO L137 encePairwiseOnDemand]: 85/141 looper letters, 1001 selfloop transitions, 517 changer transitions 38/1600 dead transitions. [2022-12-12 13:28:22,343 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 1600 transitions, 15596 flow [2022-12-12 13:28:22,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-12-12 13:28:22,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2022-12-12 13:28:22,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 4196 transitions. [2022-12-12 13:28:22,356 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35854054515936085 [2022-12-12 13:28:22,357 INFO L295 CegarLoopForPetriNet]: 126 programPoint places, 99 predicate places. [2022-12-12 13:28:22,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 1600 transitions, 15596 flow [2022-12-12 13:28:22,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 1600 transitions, 12182 flow, removed 1628 selfloop flow, removed 19 redundant places. [2022-12-12 13:28:22,434 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 1600 transitions, 12182 flow [2022-12-12 13:28:22,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 45.55844155844156) internal successors, (3508), 77 states have internal predecessors, (3508), 0 states have call successors, (0), 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-12-12 13:28:22,436 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:28:22,437 INFO L214 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] [2022-12-12 13:28:22,444 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-12-12 13:28:22,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:28:22,642 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-12-12 13:28:22,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:28:22,643 INFO L85 PathProgramCache]: Analyzing trace with hash -893243336, now seen corresponding path program 2 times [2022-12-12 13:28:22,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:28:22,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681558908] [2022-12-12 13:28:22,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:28:22,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:28:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:28:23,602 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:28:23,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:28:23,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681558908] [2022-12-12 13:28:23,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681558908] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 13:28:23,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806428060] [2022-12-12 13:28:23,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 13:28:23,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:28:23,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:28:23,604 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-12-12 13:28:23,607 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-12-12 13:28:23,688 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 13:28:23,689 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 13:28:23,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-12 13:28:23,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 13:28:24,285 INFO L350 Elim1Store]: Elim1 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-12-12 13:28:24,794 INFO L350 Elim1Store]: Elim1 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-12-12 13:28:24,900 INFO L350 Elim1Store]: Elim1 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-12-12 13:28:24,992 INFO L350 Elim1Store]: Elim1 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-12-12 13:28:25,406 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:28:25,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 43 [2022-12-12 13:28:25,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:28:25,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 13:28:31,372 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:28:31,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 70 [2022-12-12 13:28:31,391 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:28:31,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3473 treesize of output 3323 [2022-12-12 13:28:31,420 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:28:31,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3313 treesize of output 2875 [2022-12-12 13:28:31,455 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:28:31,455 INFO L350 Elim1Store]: Elim1 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 1949 treesize of output 1847 [2022-12-12 13:28:31,516 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:28:31,517 INFO L350 Elim1Store]: Elim1 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 2753 treesize of output 2539 [2022-12-12 13:28:41,497 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 13:28:41,497 INFO L350 Elim1Store]: Elim1 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 120 treesize of output 1 [2022-12-12 13:28:41,503 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:28:41,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 66 [2022-12-12 13:28:41,516 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 13:28:41,517 INFO L350 Elim1Store]: Elim1 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 781 treesize of output 753 [2022-12-12 13:28:41,539 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 13:28:41,539 INFO L350 Elim1Store]: Elim1 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 749 treesize of output 713 [2022-12-12 13:28:41,559 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 13:28:41,559 INFO L350 Elim1Store]: Elim1 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 709 treesize of output 633 [2022-12-12 13:28:41,580 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 13:28:41,581 INFO L350 Elim1Store]: Elim1 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 431 treesize of output 415 [2022-12-12 13:28:41,585 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-12 13:28:42,279 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:28:42,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 49 [2022-12-12 13:28:42,294 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 13:28:42,295 INFO L350 Elim1Store]: Elim1 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 1083 treesize of output 1039 [2022-12-12 13:28:42,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 13:28:42,318 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 519 treesize of output 487 [2022-12-12 13:28:42,334 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 13:28:42,334 INFO L350 Elim1Store]: Elim1 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 1003 treesize of output 943 [2022-12-12 13:28:42,355 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 13:28:42,356 INFO L350 Elim1Store]: Elim1 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 939 treesize of output 815 [2022-12-12 13:28:44,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:28:44,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806428060] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 13:28:44,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 13:28:44,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 33, 28] total 72 [2022-12-12 13:28:44,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391877231] [2022-12-12 13:28:44,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 13:28:44,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-12-12 13:28:44,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:28:44,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-12-12 13:28:44,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=811, Invalid=4203, Unknown=98, NotChecked=0, Total=5112 [2022-12-12 13:28:44,866 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 141 [2022-12-12 13:28:44,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 1600 transitions, 12182 flow. Second operand has 72 states, 72 states have (on average 45.69444444444444) internal successors, (3290), 72 states have internal predecessors, (3290), 0 states have call successors, (0), 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-12-12 13:28:44,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:28:44,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 141 [2022-12-12 13:28:44,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:29:19,380 WARN L233 SmtUtils]: Spent 6.37s on a formula simplification. DAG size of input: 161 DAG size of output: 64 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 13:29:20,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-12 13:29:35,404 WARN L233 SmtUtils]: Spent 6.83s on a formula simplification. DAG size of input: 185 DAG size of output: 101 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 13:29:42,394 WARN L233 SmtUtils]: Spent 6.73s on a formula simplification. DAG size of input: 175 DAG size of output: 72 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 13:30:14,019 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| c_~A~0.base))) (let ((.cse3 (select .cse4 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))))) (let ((.cse25 (select .cse4 c_~A~0.offset)) (.cse10 (= c_~min2~0 c_~min1~0)) (.cse0 (forall ((~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (< (select .cse4 (+ c_~A~0.offset (* ~M~0 4))) c_~min2~0)))) (.cse8 (< .cse3 c_~min1~0))) (let ((.cse11 (forall ((~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (< c_thread2Thread1of1ForFork1_~i~1 ~M~0) (< (select .cse4 (+ c_~A~0.offset (* ~M~0 4))) c_~min2~0)))) (.cse1 (= c_~min2~0 .cse3)) (.cse5 (not .cse8)) (.cse9 (and (forall ((~M~0 Int)) (let ((.cse26 (select .cse4 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= (+ 2 ~M~0) c_~N~0) (= c_~min1~0 .cse26) (not (< .cse26 c_~min2~0)) (< 0 ~M~0)))) (or .cse10 .cse0))) (.cse21 (< .cse25 c_~min1~0))) (and (or (and (or .cse0 .cse1) (forall ((~M~0 Int)) (let ((.cse2 (select .cse4 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< .cse2 c_~min2~0)) (< 0 ~M~0) (= .cse2 .cse3))))) .cse5) (forall ((v_ArrVal_212 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_212) c_~A~0.base))) (let ((.cse7 (select .cse6 c_~A~0.offset))) (or (forall ((~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (< (select .cse6 (+ c_~A~0.offset (* ~M~0 4))) c_~min2~0) (< 0 ~M~0))) (= c_~min2~0 .cse7) (not (< .cse7 c_~min1~0)))))) (or .cse8 .cse9) (or .cse8 (and (or .cse10 .cse11) (forall ((~M~0 Int)) (let ((.cse12 (select .cse4 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= (+ 2 ~M~0) c_~N~0) (= c_~min1~0 .cse12) (not (< .cse12 c_~min2~0)) (< c_thread2Thread1of1ForFork1_~i~1 ~M~0)))))) (or .cse10 (forall ((~M~0 Int) (v_ArrVal_212 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_212) c_~A~0.base))) (or (<= (+ 2 ~M~0) c_~N~0) (< (select .cse13 (+ c_~A~0.offset (* ~M~0 4))) c_~min2~0) (< (select .cse13 c_~A~0.offset) c_~min1~0) (< 0 ~M~0))))) (or (and (forall ((~M~0 Int)) (let ((.cse14 (select .cse4 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< .cse14 c_~min2~0)) (< c_thread2Thread1of1ForFork1_~i~1 ~M~0) (= .cse14 .cse3)))) (or .cse11 .cse1)) .cse5) (or (<= (+ 2 c_~M~0) c_~N~0) (let ((.cse16 (select .cse4 (+ c_~A~0.offset (* 4 c_~M~0))))) (let ((.cse17 (< .cse16 c_~min2~0))) (let ((.cse15 (not .cse17))) (and (or (and (or .cse15 (= .cse16 .cse3)) (or .cse17 .cse1)) .cse5) (or .cse8 (and (or .cse15 (= c_~min1~0 .cse16)) (or .cse10 .cse17)))))))) (forall ((v_ArrVal_212 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_212) c_~A~0.base))) (let ((.cse19 (select .cse20 c_~A~0.offset))) (or (forall ((~M~0 Int)) (let ((.cse18 (select .cse20 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (not (< .cse18 c_~min2~0)) (= .cse19 .cse18)))) (not (< .cse19 c_~min1~0)))))) (or .cse21 .cse9) (or .cse10 (<= (+ c_thread3Thread1of1ForFork2_~i~2 1) c_~N~0)) (forall ((v_ArrVal_212 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_212) c_~A~0.base))) (or (< (select .cse22 c_~A~0.offset) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse23 (select .cse22 (+ c_~A~0.offset (* ~M~0 4))))) (or (= c_~min1~0 .cse23) (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (not (< .cse23 c_~min2~0)))))))) (or (and (forall ((~M~0 Int)) (let ((.cse24 (select .cse4 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< .cse24 c_~min2~0)) (< 0 ~M~0) (= .cse25 .cse24)))) (or .cse0 (= c_~min2~0 .cse25))) (not .cse21))))))) is different from false [2022-12-12 13:30:39,800 INFO L130 PetriNetUnfolder]: 18062/30151 cut-off events. [2022-12-12 13:30:39,800 INFO L131 PetriNetUnfolder]: For 29090/31103 co-relation queries the response was YES. [2022-12-12 13:30:39,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122563 conditions, 30151 events. 18062/30151 cut-off events. For 29090/31103 co-relation queries the response was YES. Maximal size of possible extension queue 1646. Compared 254562 event pairs, 1190 based on Foata normal form. 189/26952 useless extension candidates. Maximal degree in co-relation 85695. Up to 10895 conditions per place. [2022-12-12 13:30:40,068 INFO L137 encePairwiseOnDemand]: 95/141 looper letters, 2329 selfloop transitions, 1218 changer transitions 68/3652 dead transitions. [2022-12-12 13:30:40,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 3652 transitions, 34646 flow [2022-12-12 13:30:40,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2022-12-12 13:30:40,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2022-12-12 13:30:40,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 6632 transitions. [2022-12-12 13:30:40,096 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3618112384069831 [2022-12-12 13:30:40,096 INFO L295 CegarLoopForPetriNet]: 126 programPoint places, 209 predicate places. [2022-12-12 13:30:40,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 3652 transitions, 34646 flow [2022-12-12 13:30:40,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 3652 transitions, 31465 flow, removed 1468 selfloop flow, removed 24 redundant places. [2022-12-12 13:30:40,581 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 3652 transitions, 31465 flow [2022-12-12 13:30:40,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 45.69444444444444) internal successors, (3290), 72 states have internal predecessors, (3290), 0 states have call successors, (0), 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-12-12 13:30:40,582 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:30:40,583 INFO L214 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] [2022-12-12 13:30:40,588 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-12-12 13:30:40,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:30:40,783 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-12-12 13:30:40,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:30:40,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1683632266, now seen corresponding path program 3 times [2022-12-12 13:30:40,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:30:40,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641657366] [2022-12-12 13:30:40,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:30:40,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:30:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:30:41,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:30:41,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:30:41,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641657366] [2022-12-12 13:30:41,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641657366] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 13:30:41,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920243473] [2022-12-12 13:30:41,902 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-12 13:30:41,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:30:41,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:30:41,903 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-12-12 13:30:41,904 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-12-12 13:30:41,987 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-12 13:30:41,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 13:30:41,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-12 13:30:41,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 13:30:42,621 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:30:42,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 43 [2022-12-12 13:30:43,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:30:43,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 13:30:43,574 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:30:43,574 INFO L350 Elim1Store]: Elim1 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 87 treesize of output 51 [2022-12-12 13:30:44,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:30:44,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920243473] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 13:30:44,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 13:30:44,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 19, 18] total 52 [2022-12-12 13:30:44,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876127150] [2022-12-12 13:30:44,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 13:30:44,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-12-12 13:30:44,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:30:44,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-12-12 13:30:44,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=2199, Unknown=0, NotChecked=0, Total=2652 [2022-12-12 13:30:44,157 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 141 [2022-12-12 13:30:44,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 3652 transitions, 31465 flow. Second operand has 52 states, 52 states have (on average 56.63461538461539) internal successors, (2945), 52 states have internal predecessors, (2945), 0 states have call successors, (0), 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-12-12 13:30:44,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:30:44,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 141 [2022-12-12 13:30:44,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:31:11,509 INFO L130 PetriNetUnfolder]: 35449/58270 cut-off events. [2022-12-12 13:31:11,509 INFO L131 PetriNetUnfolder]: For 61247/66280 co-relation queries the response was YES. [2022-12-12 13:31:11,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276773 conditions, 58270 events. 35449/58270 cut-off events. For 61247/66280 co-relation queries the response was YES. Maximal size of possible extension queue 3193. Compared 527727 event pairs, 657 based on Foata normal form. 616/52948 useless extension candidates. Maximal degree in co-relation 235116. Up to 23499 conditions per place. [2022-12-12 13:31:12,028 INFO L137 encePairwiseOnDemand]: 99/141 looper letters, 5797 selfloop transitions, 3836 changer transitions 134/9808 dead transitions. [2022-12-12 13:31:12,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 475 places, 9808 transitions, 106359 flow [2022-12-12 13:31:12,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2022-12-12 13:31:12,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2022-12-12 13:31:12,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 10292 transitions. [2022-12-12 13:31:12,038 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.442381259402536 [2022-12-12 13:31:12,039 INFO L295 CegarLoopForPetriNet]: 126 programPoint places, 349 predicate places. [2022-12-12 13:31:12,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 475 places, 9808 transitions, 106359 flow [2022-12-12 13:31:14,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 460 places, 9808 transitions, 99859 flow, removed 3233 selfloop flow, removed 15 redundant places. [2022-12-12 13:31:14,024 INFO L495 AbstractCegarLoop]: Abstraction has has 460 places, 9808 transitions, 99859 flow [2022-12-12 13:31:14,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 56.63461538461539) internal successors, (2945), 52 states have internal predecessors, (2945), 0 states have call successors, (0), 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-12-12 13:31:14,025 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:31:14,025 INFO L214 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] [2022-12-12 13:31:14,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-12 13:31:14,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:31:14,227 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-12-12 13:31:14,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:31:14,228 INFO L85 PathProgramCache]: Analyzing trace with hash -84068842, now seen corresponding path program 4 times [2022-12-12 13:31:14,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:31:14,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056278678] [2022-12-12 13:31:14,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:31:14,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:31:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:31:15,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:31:15,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:31:15,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056278678] [2022-12-12 13:31:15,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056278678] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 13:31:15,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533891549] [2022-12-12 13:31:15,271 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-12 13:31:15,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:31:15,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:31:15,272 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 13:31:15,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-12 13:31:15,350 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-12 13:31:15,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 13:31:15,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-12 13:31:15,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 13:31:16,176 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-12-12 13:31:16,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 65 [2022-12-12 13:31:16,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:31:16,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 13:31:16,445 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:31:16,445 INFO L350 Elim1Store]: Elim1 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 87 treesize of output 51 [2022-12-12 13:31:17,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:31:17,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533891549] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 13:31:17,055 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 13:31:17,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 18] total 47 [2022-12-12 13:31:17,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884598893] [2022-12-12 13:31:17,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 13:31:17,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-12-12 13:31:17,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:31:17,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-12-12 13:31:17,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1920, Unknown=0, NotChecked=0, Total=2162 [2022-12-12 13:31:17,058 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 141 [2022-12-12 13:31:17,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 460 places, 9808 transitions, 99859 flow. Second operand has 47 states, 47 states have (on average 56.93617021276596) internal successors, (2676), 47 states have internal predecessors, (2676), 0 states have call successors, (0), 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-12-12 13:31:17,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:31:17,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 141 [2022-12-12 13:31:17,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:31:54,130 INFO L130 PetriNetUnfolder]: 36289/59552 cut-off events. [2022-12-12 13:31:54,131 INFO L131 PetriNetUnfolder]: For 73616/82044 co-relation queries the response was YES. [2022-12-12 13:31:54,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326339 conditions, 59552 events. 36289/59552 cut-off events. For 73616/82044 co-relation queries the response was YES. Maximal size of possible extension queue 3232. Compared 539076 event pairs, 1184 based on Foata normal form. 371/53936 useless extension candidates. Maximal degree in co-relation 293768. Up to 42536 conditions per place. [2022-12-12 13:31:54,558 INFO L137 encePairwiseOnDemand]: 94/141 looper letters, 9228 selfloop transitions, 1022 changer transitions 138/10429 dead transitions. [2022-12-12 13:31:54,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 511 places, 10429 transitions, 127357 flow [2022-12-12 13:31:54,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-12-12 13:31:54,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2022-12-12 13:31:54,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 4163 transitions. [2022-12-12 13:31:54,562 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4158425731695135 [2022-12-12 13:31:54,563 INFO L295 CegarLoopForPetriNet]: 126 programPoint places, 385 predicate places. [2022-12-12 13:31:54,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 511 places, 10429 transitions, 127357 flow [2022-12-12 13:31:55,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 480 places, 10429 transitions, 116799 flow, removed 5232 selfloop flow, removed 31 redundant places. [2022-12-12 13:31:55,320 INFO L495 AbstractCegarLoop]: Abstraction has has 480 places, 10429 transitions, 116799 flow [2022-12-12 13:31:55,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 56.93617021276596) internal successors, (2676), 47 states have internal predecessors, (2676), 0 states have call successors, (0), 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-12-12 13:31:55,321 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:31:55,321 INFO L214 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] [2022-12-12 13:31:55,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-12 13:31:55,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:31:55,522 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-12-12 13:31:55,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:31:55,523 INFO L85 PathProgramCache]: Analyzing trace with hash -823349804, now seen corresponding path program 5 times [2022-12-12 13:31:55,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:31:55,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838985158] [2022-12-12 13:31:55,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:31:55,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:31:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:31:56,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:31:56,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:31:56,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838985158] [2022-12-12 13:31:56,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838985158] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 13:31:56,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604720402] [2022-12-12 13:31:56,519 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-12 13:31:56,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:31:56,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:31:56,520 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 13:31:56,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-12 13:31:56,597 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-12 13:31:56,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 13:31:56,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-12 13:31:56,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 13:31:57,963 INFO L350 Elim1Store]: Elim1 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 58 treesize of output 34 [2022-12-12 13:31:58,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:31:58,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 13:31:58,398 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:31:58,399 INFO L350 Elim1Store]: Elim1 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 87 treesize of output 51 [2022-12-12 13:31:59,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:31:59,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604720402] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 13:31:59,112 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 13:31:59,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 19] total 57 [2022-12-12 13:31:59,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678405250] [2022-12-12 13:31:59,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 13:31:59,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-12-12 13:31:59,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:31:59,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-12-12 13:31:59,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=2817, Unknown=0, NotChecked=0, Total=3192 [2022-12-12 13:31:59,116 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 141 [2022-12-12 13:31:59,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 10429 transitions, 116799 flow. Second operand has 57 states, 57 states have (on average 56.24561403508772) internal successors, (3206), 57 states have internal predecessors, (3206), 0 states have call successors, (0), 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-12-12 13:31:59,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:31:59,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 141 [2022-12-12 13:31:59,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:32:58,327 INFO L130 PetriNetUnfolder]: 42368/70009 cut-off events. [2022-12-12 13:32:58,327 INFO L131 PetriNetUnfolder]: For 103783/114632 co-relation queries the response was YES. [2022-12-12 13:32:58,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 421341 conditions, 70009 events. 42368/70009 cut-off events. For 103783/114632 co-relation queries the response was YES. Maximal size of possible extension queue 3831. Compared 652185 event pairs, 719 based on Foata normal form. 707/63919 useless extension candidates. Maximal degree in co-relation 380788. Up to 40360 conditions per place. [2022-12-12 13:32:58,855 INFO L137 encePairwiseOnDemand]: 103/141 looper letters, 9540 selfloop transitions, 2926 changer transitions 172/12679 dead transitions. [2022-12-12 13:32:58,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 12679 transitions, 169592 flow [2022-12-12 13:32:58,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-12-12 13:32:58,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2022-12-12 13:32:58,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 5274 transitions. [2022-12-12 13:32:58,868 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42504835589941975 [2022-12-12 13:32:58,869 INFO L295 CegarLoopForPetriNet]: 126 programPoint places, 441 predicate places. [2022-12-12 13:32:58,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 12679 transitions, 169592 flow [2022-12-12 13:33:00,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 12679 transitions, 158049 flow, removed 5697 selfloop flow, removed 24 redundant places. [2022-12-12 13:33:00,111 INFO L495 AbstractCegarLoop]: Abstraction has has 543 places, 12679 transitions, 158049 flow [2022-12-12 13:33:00,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 56.24561403508772) internal successors, (3206), 57 states have internal predecessors, (3206), 0 states have call successors, (0), 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-12-12 13:33:00,113 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:33:00,113 INFO L214 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] [2022-12-12 13:33:00,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-12 13:33:00,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-12 13:33:00,313 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-12-12 13:33:00,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:33:00,314 INFO L85 PathProgramCache]: Analyzing trace with hash 575599724, now seen corresponding path program 6 times [2022-12-12 13:33:00,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:33:00,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646048305] [2022-12-12 13:33:00,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:33:00,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:33:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:33:01,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:33:01,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:33:01,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646048305] [2022-12-12 13:33:01,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646048305] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 13:33:01,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683985652] [2022-12-12 13:33:01,375 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-12 13:33:01,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:33:01,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:33:01,376 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 13:33:01,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-12 13:33:01,456 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-12 13:33:01,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 13:33:01,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-12 13:33:01,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 13:33:02,266 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:33:02,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 43 [2022-12-12 13:33:02,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:33:02,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 13:33:03,224 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:33:03,225 INFO L350 Elim1Store]: Elim1 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 87 treesize of output 51 [2022-12-12 13:33:03,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:33:03,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683985652] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 13:33:03,805 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 13:33:03,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24, 18] total 57 [2022-12-12 13:33:03,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158112526] [2022-12-12 13:33:03,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 13:33:03,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-12-12 13:33:03,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:33:03,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-12-12 13:33:03,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=2755, Unknown=0, NotChecked=0, Total=3192 [2022-12-12 13:33:03,808 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 141 [2022-12-12 13:33:03,810 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 12679 transitions, 158049 flow. Second operand has 57 states, 57 states have (on average 56.31578947368421) internal successors, (3210), 57 states have internal predecessors, (3210), 0 states have call successors, (0), 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-12-12 13:33:03,810 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:33:03,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 141 [2022-12-12 13:33:03,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:35:37,332 INFO L130 PetriNetUnfolder]: 66547/110299 cut-off events. [2022-12-12 13:35:37,332 INFO L131 PetriNetUnfolder]: For 212969/231250 co-relation queries the response was YES. [2022-12-12 13:35:37,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 727617 conditions, 110299 events. 66547/110299 cut-off events. For 212969/231250 co-relation queries the response was YES. Maximal size of possible extension queue 6233. Compared 1090495 event pairs, 1325 based on Foata normal form. 1809/101796 useless extension candidates. Maximal degree in co-relation 643886. Up to 48169 conditions per place. [2022-12-12 13:35:38,227 INFO L137 encePairwiseOnDemand]: 99/141 looper letters, 12297 selfloop transitions, 9530 changer transitions 219/22087 dead transitions. [2022-12-12 13:35:38,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 830 places, 22087 transitions, 323951 flow [2022-12-12 13:35:38,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 288 states. [2022-12-12 13:35:38,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2022-12-12 13:35:38,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 17395 transitions. [2022-12-12 13:35:38,240 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4283638691883373 [2022-12-12 13:35:38,240 INFO L295 CegarLoopForPetriNet]: 126 programPoint places, 704 predicate places. [2022-12-12 13:35:38,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 830 places, 22087 transitions, 323951 flow [2022-12-12 13:35:40,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 812 places, 22087 transitions, 307867 flow, removed 8022 selfloop flow, removed 18 redundant places. [2022-12-12 13:35:40,895 INFO L495 AbstractCegarLoop]: Abstraction has has 812 places, 22087 transitions, 307867 flow [2022-12-12 13:35:40,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 56.31578947368421) internal successors, (3210), 57 states have internal predecessors, (3210), 0 states have call successors, (0), 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-12-12 13:35:40,896 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:35:40,896 INFO L214 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] [2022-12-12 13:35:40,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-12 13:35:41,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:35:41,097 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-12-12 13:35:41,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:35:41,097 INFO L85 PathProgramCache]: Analyzing trace with hash -759249200, now seen corresponding path program 7 times [2022-12-12 13:35:41,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:35:41,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802774385] [2022-12-12 13:35:41,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:35:41,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:35:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:35:42,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:35:42,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:35:42,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802774385] [2022-12-12 13:35:42,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802774385] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 13:35:42,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295761494] [2022-12-12 13:35:42,181 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-12 13:35:42,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:35:42,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:35:42,182 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 13:35:42,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-12 13:35:42,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:35:42,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-12 13:35:42,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 13:35:43,251 INFO L350 Elim1Store]: Elim1 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 58 treesize of output 34 [2022-12-12 13:35:43,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:35:43,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 13:35:43,544 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:35:43,544 INFO L350 Elim1Store]: Elim1 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 75 treesize of output 49 [2022-12-12 13:35:44,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:35:44,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295761494] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 13:35:44,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 13:35:44,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24, 18] total 55 [2022-12-12 13:35:44,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711314352] [2022-12-12 13:35:44,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 13:35:44,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-12-12 13:35:44,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:35:44,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-12-12 13:35:44,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=2669, Unknown=0, NotChecked=0, Total=2970 [2022-12-12 13:35:44,162 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 141 [2022-12-12 13:35:44,164 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 812 places, 22087 transitions, 307867 flow. Second operand has 55 states, 55 states have (on average 59.27272727272727) internal successors, (3260), 55 states have internal predecessors, (3260), 0 states have call successors, (0), 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-12-12 13:35:44,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:35:44,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 141 [2022-12-12 13:35:44,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-12 13:38:37,364 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-12 13:38:37,365 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-12 13:38:37,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-12-12 13:38:37,512 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-12 13:38:37,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-12 13:38:37,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-12 13:38:37,714 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (55states, 56/141 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 603682 conditions, 83545 events (52130/83544 cut-off events. For 166862/182993 co-relation queries the response was YES. Maximal size of possible extension queue 6585. Compared 832051 event pairs, 1077 based on Foata normal form. 458/80927 useless extension candidates. Maximal degree in co-relation 571194. Up to 47990 conditions per place.). [2022-12-12 13:38:37,715 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-12 13:38:37,715 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-12 13:38:37,715 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-12 13:38:37,715 INFO L445 BasicCegarLoop]: Path program histogram: [7, 2, 1, 1, 1, 1] [2022-12-12 13:38:37,718 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 13:38:37,718 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 13:38:37,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 01:38:37 BasicIcfg [2022-12-12 13:38:37,720 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 13:38:37,720 INFO L158 Benchmark]: Toolchain (without parser) took 830699.38ms. Allocated memory was 225.4MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 201.9MB in the beginning and 459.1MB in the end (delta: -257.2MB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. [2022-12-12 13:38:37,720 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 225.4MB. Free memory is still 202.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 13:38:37,721 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.36ms. Allocated memory is still 225.4MB. Free memory was 201.9MB in the beginning and 189.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-12 13:38:37,721 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.83ms. Allocated memory is still 225.4MB. Free memory was 189.3MB in the beginning and 187.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 13:38:37,721 INFO L158 Benchmark]: Boogie Preprocessor took 30.69ms. Allocated memory is still 225.4MB. Free memory was 187.2MB in the beginning and 185.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-12 13:38:37,721 INFO L158 Benchmark]: RCFGBuilder took 484.74ms. Allocated memory is still 225.4MB. Free memory was 185.6MB in the beginning and 165.2MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-12 13:38:37,721 INFO L158 Benchmark]: TraceAbstraction took 829883.51ms. Allocated memory was 225.4MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 164.1MB in the beginning and 459.1MB in the end (delta: -294.9MB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. [2022-12-12 13:38:37,722 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 225.4MB. Free memory is still 202.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 253.36ms. Allocated memory is still 225.4MB. Free memory was 201.9MB in the beginning and 189.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.83ms. Allocated memory is still 225.4MB. Free memory was 189.3MB in the beginning and 187.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.69ms. Allocated memory is still 225.4MB. Free memory was 187.2MB in the beginning and 185.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 484.74ms. Allocated memory is still 225.4MB. Free memory was 185.6MB in the beginning and 165.2MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 829883.51ms. Allocated memory was 225.4MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 164.1MB in the beginning and 459.1MB in the end (delta: -294.9MB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (55states, 56/141 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 603682 conditions, 83545 events (52130/83544 cut-off events. For 166862/182993 co-relation queries the response was YES. Maximal size of possible extension queue 6585. Compared 832051 event pairs, 1077 based on Foata normal form. 458/80927 useless extension candidates. Maximal degree in co-relation 571194. Up to 47990 conditions per place.). - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (55states, 56/141 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 603682 conditions, 83545 events (52130/83544 cut-off events. For 166862/182993 co-relation queries the response was YES. Maximal size of possible extension queue 6585. Compared 832051 event pairs, 1077 based on Foata normal form. 458/80927 useless extension candidates. Maximal degree in co-relation 571194. Up to 47990 conditions per place.). - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (55states, 56/141 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 603682 conditions, 83545 events (52130/83544 cut-off events. For 166862/182993 co-relation queries the response was YES. Maximal size of possible extension queue 6585. Compared 832051 event pairs, 1077 based on Foata normal form. 458/80927 useless extension candidates. Maximal degree in co-relation 571194. Up to 47990 conditions per place.). - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (55states, 56/141 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 603682 conditions, 83545 events (52130/83544 cut-off events. For 166862/182993 co-relation queries the response was YES. Maximal size of possible extension queue 6585. Compared 832051 event pairs, 1077 based on Foata normal form. 458/80927 useless extension candidates. Maximal degree in co-relation 571194. Up to 47990 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 160 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 7.2s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 829.8s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 708.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 1212 mSolverCounterUnknown, 10518 SdHoareTripleChecker+Valid, 78.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10518 mSDsluCounter, 17228 SdHoareTripleChecker+Invalid, 74.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1615 IncrementalHoareTripleChecker+Unchecked, 16339 mSDsCounter, 820 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42511 IncrementalHoareTripleChecker+Invalid, 46158 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 820 mSolverCounterUnsat, 889 mSDtfsCounter, 42511 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 1212 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3120 GetRequests, 1822 SyntacticMatches, 33 SemanticMatches, 1265 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 88911 ImplicationChecksByTransitivity, 308.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=307867occurred in iteration=12, InterpolantAutomatonStates: 876, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 52086 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 110.4s InterpolantComputationTime, 2482 NumberOfCodeBlocks, 2445 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 3439 ConstructedInterpolants, 77 QuantifiedInterpolants, 48704 SizeOfPredicates, 215 NumberOfNonLiveVariables, 2607 ConjunctsInSsa, 300 ConjunctsInUnsatCore, 32 InterpolantComputations, 6 PerfectInterpolantSequences, 16/81 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown