/usr/bin/java -Xmx16000000000 -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-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 05:34:41,417 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 05:34:41,419 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 05:34:41,454 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 05:34:41,454 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 05:34:41,456 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 05:34:41,459 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 05:34:41,461 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 05:34:41,462 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 05:34:41,463 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 05:34:41,463 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 05:34:41,464 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 05:34:41,464 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 05:34:41,465 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 05:34:41,466 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 05:34:41,467 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 05:34:41,467 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 05:34:41,468 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 05:34:41,469 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 05:34:41,471 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 05:34:41,472 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 05:34:41,474 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 05:34:41,474 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 05:34:41,475 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 05:34:41,477 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 05:34:41,478 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 05:34:41,478 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 05:34:41,479 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 05:34:41,479 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 05:34:41,480 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 05:34:41,480 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 05:34:41,480 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 05:34:41,481 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 05:34:41,481 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 05:34:41,482 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 05:34:41,482 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 05:34:41,483 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 05:34:41,483 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 05:34:41,483 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 05:34:41,484 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 05:34:41,485 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 05:34:41,489 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-VariableLbe.epf [2023-01-28 05:34:41,507 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 05:34:41,507 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 05:34:41,508 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 05:34:41,508 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 05:34:41,508 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 05:34:41,508 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 05:34:41,509 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 05:34:41,509 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 05:34:41,509 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 05:34:41,509 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 05:34:41,509 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 05:34:41,509 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 05:34:41,509 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 05:34:41,509 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 05:34:41,509 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 05:34:41,510 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 05:34:41,510 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 05:34:41,510 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 05:34:41,510 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 05:34:41,510 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 05:34:41,510 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 05:34:41,510 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 05:34:41,511 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 05:34:41,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 05:34:41,511 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 05:34:41,511 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 05:34:41,511 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 05:34:41,511 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 05:34:41,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 05:34:41,511 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 05:34:41,512 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 05:34:41,512 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-01-28 05:34:41,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 05:34:41,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 05:34:41,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 05:34:41,754 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 05:34:41,755 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 05:34:41,756 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2023-01-28 05:34:42,914 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 05:34:43,110 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 05:34:43,110 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2023-01-28 05:34:43,116 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12172ef1c/4a005d15a75b44b5bb7b3e55c4dcb028/FLAG7ba820cb2 [2023-01-28 05:34:43,126 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12172ef1c/4a005d15a75b44b5bb7b3e55c4dcb028 [2023-01-28 05:34:43,128 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 05:34:43,129 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 05:34:43,130 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 05:34:43,130 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 05:34:43,133 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 05:34:43,133 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 05:34:43" (1/1) ... [2023-01-28 05:34:43,134 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@728cff09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:34:43, skipping insertion in model container [2023-01-28 05:34:43,134 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 05:34:43" (1/1) ... [2023-01-28 05:34:43,140 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 05:34:43,153 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 05:34:43,294 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c[2987,3000] [2023-01-28 05:34:43,301 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 05:34:43,309 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 05:34:43,327 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c[2987,3000] [2023-01-28 05:34:43,329 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 05:34:43,336 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 05:34:43,336 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 05:34:43,342 INFO L208 MainTranslator]: Completed translation [2023-01-28 05:34:43,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:34:43 WrapperNode [2023-01-28 05:34:43,342 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 05:34:43,343 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 05:34:43,343 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 05:34:43,343 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 05:34:43,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:34:43" (1/1) ... [2023-01-28 05:34:43,356 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:34:43" (1/1) ... [2023-01-28 05:34:43,378 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 207 [2023-01-28 05:34:43,378 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 05:34:43,379 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 05:34:43,379 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 05:34:43,379 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 05:34:43,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:34:43" (1/1) ... [2023-01-28 05:34:43,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:34:43" (1/1) ... [2023-01-28 05:34:43,390 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:34:43" (1/1) ... [2023-01-28 05:34:43,390 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:34:43" (1/1) ... [2023-01-28 05:34:43,397 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:34:43" (1/1) ... [2023-01-28 05:34:43,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:34:43" (1/1) ... [2023-01-28 05:34:43,403 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:34:43" (1/1) ... [2023-01-28 05:34:43,404 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:34:43" (1/1) ... [2023-01-28 05:34:43,406 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 05:34:43,407 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 05:34:43,407 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 05:34:43,407 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 05:34:43,408 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:34:43" (1/1) ... [2023-01-28 05:34:43,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 05:34:43,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:34:43,454 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) [2023-01-28 05:34:43,463 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 [2023-01-28 05:34:43,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 05:34:43,503 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-28 05:34:43,503 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-28 05:34:43,503 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-28 05:34:43,503 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-28 05:34:43,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 05:34:43,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 05:34:43,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 05:34:43,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 05:34:43,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 05:34:43,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-01-28 05:34:43,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 05:34:43,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 05:34:43,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 05:34:43,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 05:34:43,506 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 05:34:43,635 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 05:34:43,637 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 05:34:43,985 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 05:34:44,139 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 05:34:44,139 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-01-28 05:34:44,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 05:34:44 BoogieIcfgContainer [2023-01-28 05:34:44,142 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 05:34:44,146 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 05:34:44,146 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 05:34:44,148 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 05:34:44,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 05:34:43" (1/3) ... [2023-01-28 05:34:44,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d03f8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 05:34:44, skipping insertion in model container [2023-01-28 05:34:44,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:34:43" (2/3) ... [2023-01-28 05:34:44,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d03f8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 05:34:44, skipping insertion in model container [2023-01-28 05:34:44,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 05:34:44" (3/3) ... [2023-01-28 05:34:44,152 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2023-01-28 05:34:44,168 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 05:34:44,168 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-28 05:34:44,169 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 05:34:44,253 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-01-28 05:34:44,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 170 transitions, 356 flow [2023-01-28 05:34:44,365 INFO L130 PetriNetUnfolder]: 13/168 cut-off events. [2023-01-28 05:34:44,365 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-28 05:34:44,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 168 events. 13/168 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 85 event pairs, 0 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 135. Up to 2 conditions per place. [2023-01-28 05:34:44,370 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 170 transitions, 356 flow [2023-01-28 05:34:44,374 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 160 transitions, 332 flow [2023-01-28 05:34:44,377 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 05:34:44,385 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 160 transitions, 332 flow [2023-01-28 05:34:44,387 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 160 transitions, 332 flow [2023-01-28 05:34:44,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 160 transitions, 332 flow [2023-01-28 05:34:44,415 INFO L130 PetriNetUnfolder]: 13/160 cut-off events. [2023-01-28 05:34:44,415 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-28 05:34:44,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 160 events. 13/160 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 85 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 135. Up to 2 conditions per place. [2023-01-28 05:34:44,417 INFO L119 LiptonReduction]: Number of co-enabled transitions 500 [2023-01-28 05:34:49,476 INFO L134 LiptonReduction]: Checked pairs total: 763 [2023-01-28 05:34:49,477 INFO L136 LiptonReduction]: Total number of compositions: 164 [2023-01-28 05:34:49,489 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 05:34:49,494 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;@2ba1a276, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 05:34:49,495 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-01-28 05:34:49,500 INFO L130 PetriNetUnfolder]: 4/18 cut-off events. [2023-01-28 05:34:49,501 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-28 05:34:49,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:34:49,501 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 05:34:49,502 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 05:34:49,506 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:34:49,506 INFO L85 PathProgramCache]: Analyzing trace with hash 219698779, now seen corresponding path program 1 times [2023-01-28 05:34:49,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:34:49,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645725560] [2023-01-28 05:34:49,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:34:49,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:34:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:34:49,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:34:49,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:34:49,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645725560] [2023-01-28 05:34:49,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645725560] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 05:34:49,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 05:34:49,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 05:34:49,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151412612] [2023-01-28 05:34:49,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 05:34:49,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 05:34:49,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:34:49,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 05:34:49,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 05:34:49,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 334 [2023-01-28 05:34:49,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 19 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 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) [2023-01-28 05:34:49,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:34:49,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 334 [2023-01-28 05:34:49,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:34:50,037 INFO L130 PetriNetUnfolder]: 81/147 cut-off events. [2023-01-28 05:34:50,037 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2023-01-28 05:34:50,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 147 events. 81/147 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 410 event pairs, 24 based on Foata normal form. 1/114 useless extension candidates. Maximal degree in co-relation 240. Up to 88 conditions per place. [2023-01-28 05:34:50,049 INFO L137 encePairwiseOnDemand]: 330/334 looper letters, 27 selfloop transitions, 3 changer transitions 1/31 dead transitions. [2023-01-28 05:34:50,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 31 transitions, 145 flow [2023-01-28 05:34:50,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 05:34:50,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 05:34:50,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 455 transitions. [2023-01-28 05:34:50,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4540918163672655 [2023-01-28 05:34:50,063 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 455 transitions. [2023-01-28 05:34:50,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 455 transitions. [2023-01-28 05:34:50,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:34:50,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 455 transitions. [2023-01-28 05:34:50,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 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) [2023-01-28 05:34:50,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 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) [2023-01-28 05:34:50,092 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 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) [2023-01-28 05:34:50,094 INFO L175 Difference]: Start difference. First operand has 22 places, 19 transitions, 50 flow. Second operand 3 states and 455 transitions. [2023-01-28 05:34:50,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 31 transitions, 145 flow [2023-01-28 05:34:50,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 31 transitions, 131 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-28 05:34:50,098 INFO L231 Difference]: Finished difference. Result has 21 places, 21 transitions, 61 flow [2023-01-28 05:34:50,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=61, PETRI_PLACES=21, PETRI_TRANSITIONS=21} [2023-01-28 05:34:50,104 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, -1 predicate places. [2023-01-28 05:34:50,105 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 21 transitions, 61 flow [2023-01-28 05:34:50,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 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) [2023-01-28 05:34:50,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:34:50,105 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 05:34:50,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 05:34:50,106 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 05:34:50,107 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:34:50,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1594831125, now seen corresponding path program 1 times [2023-01-28 05:34:50,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:34:50,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961612746] [2023-01-28 05:34:50,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:34:50,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:34:50,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:34:50,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:34:50,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:34:50,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961612746] [2023-01-28 05:34:50,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961612746] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 05:34:50,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 05:34:50,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 05:34:50,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212329927] [2023-01-28 05:34:50,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 05:34:50,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 05:34:50,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:34:50,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 05:34:50,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 05:34:50,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 334 [2023-01-28 05:34:50,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 21 transitions, 61 flow. Second operand has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 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) [2023-01-28 05:34:50,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:34:50,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 334 [2023-01-28 05:34:50,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:34:50,393 INFO L130 PetriNetUnfolder]: 102/194 cut-off events. [2023-01-28 05:34:50,394 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2023-01-28 05:34:50,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464 conditions, 194 events. 102/194 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 653 event pairs, 9 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 114. Up to 76 conditions per place. [2023-01-28 05:34:50,396 INFO L137 encePairwiseOnDemand]: 327/334 looper letters, 41 selfloop transitions, 6 changer transitions 1/48 dead transitions. [2023-01-28 05:34:50,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 48 transitions, 224 flow [2023-01-28 05:34:50,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 05:34:50,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 05:34:50,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 746 transitions. [2023-01-28 05:34:50,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4467065868263473 [2023-01-28 05:34:50,401 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 746 transitions. [2023-01-28 05:34:50,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 746 transitions. [2023-01-28 05:34:50,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:34:50,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 746 transitions. [2023-01-28 05:34:50,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 149.2) internal successors, (746), 5 states have internal predecessors, (746), 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) [2023-01-28 05:34:50,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 334.0) internal successors, (2004), 6 states have internal predecessors, (2004), 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) [2023-01-28 05:34:50,406 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 334.0) internal successors, (2004), 6 states have internal predecessors, (2004), 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) [2023-01-28 05:34:50,406 INFO L175 Difference]: Start difference. First operand has 21 places, 21 transitions, 61 flow. Second operand 5 states and 746 transitions. [2023-01-28 05:34:50,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 48 transitions, 224 flow [2023-01-28 05:34:50,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 48 transitions, 221 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 05:34:50,408 INFO L231 Difference]: Finished difference. Result has 27 places, 24 transitions, 99 flow [2023-01-28 05:34:50,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=99, PETRI_PLACES=27, PETRI_TRANSITIONS=24} [2023-01-28 05:34:50,409 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 5 predicate places. [2023-01-28 05:34:50,409 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 24 transitions, 99 flow [2023-01-28 05:34:50,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 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) [2023-01-28 05:34:50,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:34:50,410 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 05:34:50,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 05:34:50,410 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 05:34:50,411 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:34:50,411 INFO L85 PathProgramCache]: Analyzing trace with hash -723769805, now seen corresponding path program 2 times [2023-01-28 05:34:50,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:34:50,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694867696] [2023-01-28 05:34:50,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:34:50,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:34:50,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:34:50,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:34:50,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:34:50,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694867696] [2023-01-28 05:34:50,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694867696] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 05:34:50,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 05:34:50,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 05:34:50,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126328669] [2023-01-28 05:34:50,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 05:34:50,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 05:34:50,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:34:50,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 05:34:50,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 05:34:50,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 334 [2023-01-28 05:34:50,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 24 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 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) [2023-01-28 05:34:50,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:34:50,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 334 [2023-01-28 05:34:50,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:34:50,560 INFO L130 PetriNetUnfolder]: 89/165 cut-off events. [2023-01-28 05:34:50,560 INFO L131 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2023-01-28 05:34:50,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 165 events. 89/165 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 498 event pairs, 15 based on Foata normal form. 6/169 useless extension candidates. Maximal degree in co-relation 192. Up to 120 conditions per place. [2023-01-28 05:34:50,562 INFO L137 encePairwiseOnDemand]: 327/334 looper letters, 26 selfloop transitions, 3 changer transitions 10/39 dead transitions. [2023-01-28 05:34:50,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 39 transitions, 227 flow [2023-01-28 05:34:50,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 05:34:50,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 05:34:50,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 594 transitions. [2023-01-28 05:34:50,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44461077844311375 [2023-01-28 05:34:50,564 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 594 transitions. [2023-01-28 05:34:50,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 594 transitions. [2023-01-28 05:34:50,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:34:50,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 594 transitions. [2023-01-28 05:34:50,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 148.5) internal successors, (594), 4 states have internal predecessors, (594), 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) [2023-01-28 05:34:50,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 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) [2023-01-28 05:34:50,569 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 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) [2023-01-28 05:34:50,569 INFO L175 Difference]: Start difference. First operand has 27 places, 24 transitions, 99 flow. Second operand 4 states and 594 transitions. [2023-01-28 05:34:50,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 39 transitions, 227 flow [2023-01-28 05:34:50,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 39 transitions, 221 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 05:34:50,571 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 110 flow [2023-01-28 05:34:50,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2023-01-28 05:34:50,572 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 8 predicate places. [2023-01-28 05:34:50,572 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 110 flow [2023-01-28 05:34:50,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 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) [2023-01-28 05:34:50,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:34:50,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 05:34:50,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 05:34:50,573 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 05:34:50,574 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:34:50,574 INFO L85 PathProgramCache]: Analyzing trace with hash 521491958, now seen corresponding path program 1 times [2023-01-28 05:34:50,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:34:50,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626164489] [2023-01-28 05:34:50,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:34:50,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:34:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:34:50,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:34:50,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:34:50,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626164489] [2023-01-28 05:34:50,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626164489] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 05:34:50,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 05:34:50,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 05:34:50,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972493175] [2023-01-28 05:34:50,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 05:34:50,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 05:34:50,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:34:50,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 05:34:50,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 05:34:50,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 334 [2023-01-28 05:34:50,674 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 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) [2023-01-28 05:34:50,674 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:34:50,674 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 334 [2023-01-28 05:34:50,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:34:50,751 INFO L130 PetriNetUnfolder]: 98/173 cut-off events. [2023-01-28 05:34:50,751 INFO L131 PetriNetUnfolder]: For 145/145 co-relation queries the response was YES. [2023-01-28 05:34:50,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 173 events. 98/173 cut-off events. For 145/145 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 474 event pairs, 18 based on Foata normal form. 6/177 useless extension candidates. Maximal degree in co-relation 214. Up to 122 conditions per place. [2023-01-28 05:34:50,753 INFO L137 encePairwiseOnDemand]: 328/334 looper letters, 32 selfloop transitions, 6 changer transitions 0/38 dead transitions. [2023-01-28 05:34:50,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 38 transitions, 236 flow [2023-01-28 05:34:50,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 05:34:50,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 05:34:50,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 733 transitions. [2023-01-28 05:34:50,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43892215568862275 [2023-01-28 05:34:50,755 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 733 transitions. [2023-01-28 05:34:50,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 733 transitions. [2023-01-28 05:34:50,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:34:50,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 733 transitions. [2023-01-28 05:34:50,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 146.6) internal successors, (733), 5 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) [2023-01-28 05:34:50,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 334.0) internal successors, (2004), 6 states have internal predecessors, (2004), 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) [2023-01-28 05:34:50,761 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 334.0) internal successors, (2004), 6 states have internal predecessors, (2004), 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) [2023-01-28 05:34:50,761 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 110 flow. Second operand 5 states and 733 transitions. [2023-01-28 05:34:50,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 38 transitions, 236 flow [2023-01-28 05:34:50,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 38 transitions, 214 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-01-28 05:34:50,763 INFO L231 Difference]: Finished difference. Result has 30 places, 25 transitions, 112 flow [2023-01-28 05:34:50,764 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=112, PETRI_PLACES=30, PETRI_TRANSITIONS=25} [2023-01-28 05:34:50,764 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 8 predicate places. [2023-01-28 05:34:50,764 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 25 transitions, 112 flow [2023-01-28 05:34:50,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 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) [2023-01-28 05:34:50,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:34:50,765 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 05:34:50,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 05:34:50,765 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 05:34:50,766 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:34:50,766 INFO L85 PathProgramCache]: Analyzing trace with hash -44837542, now seen corresponding path program 1 times [2023-01-28 05:34:50,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:34:50,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025651783] [2023-01-28 05:34:50,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:34:50,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:34:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:34:50,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:34:50,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:34:50,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025651783] [2023-01-28 05:34:50,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025651783] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 05:34:50,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 05:34:50,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 05:34:50,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858019782] [2023-01-28 05:34:50,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 05:34:50,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 05:34:50,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:34:50,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 05:34:50,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 05:34:50,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 334 [2023-01-28 05:34:50,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 25 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 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) [2023-01-28 05:34:50,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:34:50,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 334 [2023-01-28 05:34:50,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:34:50,976 INFO L130 PetriNetUnfolder]: 102/188 cut-off events. [2023-01-28 05:34:50,976 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2023-01-28 05:34:50,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 188 events. 102/188 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 492 event pairs, 61 based on Foata normal form. 8/192 useless extension candidates. Maximal degree in co-relation 308. Up to 174 conditions per place. [2023-01-28 05:34:50,978 INFO L137 encePairwiseOnDemand]: 329/334 looper letters, 24 selfloop transitions, 2 changer transitions 8/34 dead transitions. [2023-01-28 05:34:50,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 205 flow [2023-01-28 05:34:50,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 05:34:50,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 05:34:50,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 538 transitions. [2023-01-28 05:34:50,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4026946107784431 [2023-01-28 05:34:50,980 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 538 transitions. [2023-01-28 05:34:50,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 538 transitions. [2023-01-28 05:34:50,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:34:50,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 538 transitions. [2023-01-28 05:34:50,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.5) internal successors, (538), 4 states have internal predecessors, (538), 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) [2023-01-28 05:34:50,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 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) [2023-01-28 05:34:50,984 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 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) [2023-01-28 05:34:50,984 INFO L175 Difference]: Start difference. First operand has 30 places, 25 transitions, 112 flow. Second operand 4 states and 538 transitions. [2023-01-28 05:34:50,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 205 flow [2023-01-28 05:34:50,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 34 transitions, 193 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 05:34:50,986 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 120 flow [2023-01-28 05:34:50,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2023-01-28 05:34:50,987 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 10 predicate places. [2023-01-28 05:34:50,987 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 120 flow [2023-01-28 05:34:50,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 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) [2023-01-28 05:34:50,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:34:50,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 05:34:50,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 05:34:50,988 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 05:34:50,988 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:34:50,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1961656, now seen corresponding path program 1 times [2023-01-28 05:34:50,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:34:50,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403518814] [2023-01-28 05:34:50,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:34:50,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:34:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:34:51,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 05:34:51,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:34:51,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403518814] [2023-01-28 05:34:51,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403518814] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 05:34:51,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 05:34:51,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 05:34:51,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762270688] [2023-01-28 05:34:51,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 05:34:51,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 05:34:51,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:34:51,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 05:34:51,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 05:34:51,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 334 [2023-01-28 05:34:51,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 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) [2023-01-28 05:34:51,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:34:51,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 334 [2023-01-28 05:34:51,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:34:51,133 INFO L130 PetriNetUnfolder]: 99/183 cut-off events. [2023-01-28 05:34:51,133 INFO L131 PetriNetUnfolder]: For 180/180 co-relation queries the response was YES. [2023-01-28 05:34:51,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 183 events. 99/183 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 479 event pairs, 59 based on Foata normal form. 8/188 useless extension candidates. Maximal degree in co-relation 616. Up to 175 conditions per place. [2023-01-28 05:34:51,135 INFO L137 encePairwiseOnDemand]: 329/334 looper letters, 25 selfloop transitions, 2 changer transitions 6/33 dead transitions. [2023-01-28 05:34:51,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 33 transitions, 207 flow [2023-01-28 05:34:51,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 05:34:51,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 05:34:51,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 536 transitions. [2023-01-28 05:34:51,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40119760479041916 [2023-01-28 05:34:51,137 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 536 transitions. [2023-01-28 05:34:51,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 536 transitions. [2023-01-28 05:34:51,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:34:51,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 536 transitions. [2023-01-28 05:34:51,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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) [2023-01-28 05:34:51,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 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) [2023-01-28 05:34:51,140 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 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) [2023-01-28 05:34:51,141 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 120 flow. Second operand 4 states and 536 transitions. [2023-01-28 05:34:51,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 33 transitions, 207 flow [2023-01-28 05:34:51,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 199 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-01-28 05:34:51,143 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 132 flow [2023-01-28 05:34:51,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2023-01-28 05:34:51,143 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 13 predicate places. [2023-01-28 05:34:51,144 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 132 flow [2023-01-28 05:34:51,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 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) [2023-01-28 05:34:51,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:34:51,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 05:34:51,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 05:34:51,145 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 05:34:51,145 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:34:51,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1784763123, now seen corresponding path program 1 times [2023-01-28 05:34:51,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:34:51,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453481358] [2023-01-28 05:34:51,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:34:51,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:34:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:34:51,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-28 05:34:51,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:34:51,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453481358] [2023-01-28 05:34:51,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453481358] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 05:34:51,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 05:34:51,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 05:34:51,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114462919] [2023-01-28 05:34:51,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 05:34:51,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 05:34:51,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:34:51,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 05:34:51,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 05:34:51,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 334 [2023-01-28 05:34:51,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 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) [2023-01-28 05:34:51,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:34:51,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 334 [2023-01-28 05:34:51,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:34:51,279 INFO L130 PetriNetUnfolder]: 77/140 cut-off events. [2023-01-28 05:34:51,280 INFO L131 PetriNetUnfolder]: For 172/172 co-relation queries the response was YES. [2023-01-28 05:34:51,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 140 events. 77/140 cut-off events. For 172/172 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 327 event pairs, 19 based on Foata normal form. 4/143 useless extension candidates. Maximal degree in co-relation 487. Up to 123 conditions per place. [2023-01-28 05:34:51,281 INFO L137 encePairwiseOnDemand]: 331/334 looper letters, 26 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2023-01-28 05:34:51,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 29 transitions, 198 flow [2023-01-28 05:34:51,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 05:34:51,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 05:34:51,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2023-01-28 05:34:51,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4660678642714571 [2023-01-28 05:34:51,283 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 467 transitions. [2023-01-28 05:34:51,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 467 transitions. [2023-01-28 05:34:51,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:34:51,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 467 transitions. [2023-01-28 05:34:51,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 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) [2023-01-28 05:34:51,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 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) [2023-01-28 05:34:51,286 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 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) [2023-01-28 05:34:51,286 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 132 flow. Second operand 3 states and 467 transitions. [2023-01-28 05:34:51,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 29 transitions, 198 flow [2023-01-28 05:34:51,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 29 transitions, 186 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-01-28 05:34:51,288 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 139 flow [2023-01-28 05:34:51,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2023-01-28 05:34:51,288 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 14 predicate places. [2023-01-28 05:34:51,289 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 139 flow [2023-01-28 05:34:51,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 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) [2023-01-28 05:34:51,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:34:51,289 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 05:34:51,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 05:34:51,289 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 05:34:51,290 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:34:51,290 INFO L85 PathProgramCache]: Analyzing trace with hash 761354163, now seen corresponding path program 2 times [2023-01-28 05:34:51,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:34:51,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759306777] [2023-01-28 05:34:51,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:34:51,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:34:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:34:52,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:34:52,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:34:52,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759306777] [2023-01-28 05:34:52,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759306777] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 05:34:52,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083229126] [2023-01-28 05:34:52,537 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 05:34:52,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:34:52,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:34:52,540 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) [2023-01-28 05:34:52,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-01-28 05:34:52,651 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 05:34:52,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 05:34:52,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 52 conjunts are in the unsatisfiable core [2023-01-28 05:34:52,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 05:34:52,915 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 [2023-01-28 05:34:52,990 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 [2023-01-28 05:34:53,048 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 [2023-01-28 05:34:53,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 05:34:53,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 05:34:54,030 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:34:54,030 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 118 treesize of output 82 [2023-01-28 05:34:54,105 INFO L321 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2023-01-28 05:34:54,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1112 treesize of output 1048 [2023-01-28 05:34:54,195 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:34:54,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 502 treesize of output 462 [2023-01-28 05:34:54,254 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:34:54,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 382 treesize of output 402 [2023-01-28 05:35:28,507 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:35:28,508 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 116 treesize of output 80 [2023-01-28 05:35:28,541 INFO L321 Elim1Store]: treesize reduction 69, result has 25.8 percent of original size [2023-01-28 05:35:28,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 550 treesize of output 493 [2023-01-28 05:35:28,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:35:28,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:35:28,572 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:35:28,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 470 treesize of output 366 [2023-01-28 05:35:28,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:35:28,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:35:28,592 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:35:28,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 350 treesize of output 306 [2023-01-28 05:35:28,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 05:35:28,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083229126] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 05:35:28,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 05:35:28,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 28 [2023-01-28 05:35:28,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57475193] [2023-01-28 05:35:28,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 05:35:28,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-01-28 05:35:28,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:35:28,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-01-28 05:35:28,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=758, Unknown=3, NotChecked=0, Total=870 [2023-01-28 05:35:28,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 334 [2023-01-28 05:35:28,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 139 flow. Second operand has 30 states, 30 states have (on average 82.76666666666667) internal successors, (2483), 30 states have internal predecessors, (2483), 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) [2023-01-28 05:35:28,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:35:28,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 334 [2023-01-28 05:35:28,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:35:35,958 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] [2023-01-28 05:35:38,932 INFO L130 PetriNetUnfolder]: 244/446 cut-off events. [2023-01-28 05:35:38,932 INFO L131 PetriNetUnfolder]: For 530/530 co-relation queries the response was YES. [2023-01-28 05:35:38,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1596 conditions, 446 events. 244/446 cut-off events. For 530/530 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1739 event pairs, 6 based on Foata normal form. 2/445 useless extension candidates. Maximal degree in co-relation 1404. Up to 173 conditions per place. [2023-01-28 05:35:38,935 INFO L137 encePairwiseOnDemand]: 323/334 looper letters, 76 selfloop transitions, 58 changer transitions 2/136 dead transitions. [2023-01-28 05:35:38,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 136 transitions, 907 flow [2023-01-28 05:35:38,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-01-28 05:35:38,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-01-28 05:35:38,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 2316 transitions. [2023-01-28 05:35:38,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25681969394544246 [2023-01-28 05:35:38,943 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 2316 transitions. [2023-01-28 05:35:38,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 2316 transitions. [2023-01-28 05:35:38,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:35:38,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 2316 transitions. [2023-01-28 05:35:38,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 85.77777777777777) internal successors, (2316), 27 states have internal predecessors, (2316), 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) [2023-01-28 05:35:38,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 334.0) internal successors, (9352), 28 states have internal predecessors, (9352), 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) [2023-01-28 05:35:38,961 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 334.0) internal successors, (9352), 28 states have internal predecessors, (9352), 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) [2023-01-28 05:35:38,962 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 139 flow. Second operand 27 states and 2316 transitions. [2023-01-28 05:35:38,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 136 transitions, 907 flow [2023-01-28 05:35:38,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 136 transitions, 887 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-01-28 05:35:38,966 INFO L231 Difference]: Finished difference. Result has 70 places, 79 transitions, 664 flow [2023-01-28 05:35:38,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=664, PETRI_PLACES=70, PETRI_TRANSITIONS=79} [2023-01-28 05:35:38,967 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 48 predicate places. [2023-01-28 05:35:38,967 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 79 transitions, 664 flow [2023-01-28 05:35:38,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 82.76666666666667) internal successors, (2483), 30 states have internal predecessors, (2483), 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) [2023-01-28 05:35:38,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:35:38,968 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 05:35:38,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-01-28 05:35:39,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:35:39,178 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 05:35:39,179 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:35:39,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1927973413, now seen corresponding path program 3 times [2023-01-28 05:35:39,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:35:39,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689782337] [2023-01-28 05:35:39,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:35:39,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:35:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:35:40,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:35:40,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:35:40,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689782337] [2023-01-28 05:35:40,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689782337] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 05:35:40,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538961892] [2023-01-28 05:35:40,378 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 05:35:40,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:35:40,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:35:40,379 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) [2023-01-28 05:35:40,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-01-28 05:35:40,476 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-28 05:35:40,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 05:35:40,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 73 conjunts are in the unsatisfiable core [2023-01-28 05:35:40,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 05:35:40,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:35:40,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:35:40,520 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-01-28 05:35:40,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2023-01-28 05:35:40,589 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 [2023-01-28 05:35:40,648 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 05:35:40,649 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 11 treesize of output 11 [2023-01-28 05:35:40,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-28 05:35:40,818 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 [2023-01-28 05:35:40,897 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 [2023-01-28 05:35:41,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 20 [2023-01-28 05:35:41,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:35:41,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 05:35:42,912 INFO L321 Elim1Store]: treesize reduction 23, result has 60.3 percent of original size [2023-01-28 05:35:42,913 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 2 case distinctions, treesize of input 150 treesize of output 88 [2023-01-28 05:35:42,986 INFO L321 Elim1Store]: treesize reduction 4, result has 94.7 percent of original size [2023-01-28 05:35:42,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 480 treesize of output 499 [2023-01-28 05:35:43,026 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:35:43,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 154 treesize of output 174 [2023-01-28 05:35:43,061 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:35:43,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 149 treesize of output 153 [2023-01-28 05:35:46,236 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:35:46,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538961892] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 05:35:46,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 05:35:46,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2023-01-28 05:35:46,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795029709] [2023-01-28 05:35:46,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 05:35:46,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-01-28 05:35:46,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:35:46,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-01-28 05:35:46,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1165, Unknown=4, NotChecked=0, Total=1332 [2023-01-28 05:35:46,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 334 [2023-01-28 05:35:46,243 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 79 transitions, 664 flow. Second operand has 37 states, 37 states have (on average 79.48648648648648) internal successors, (2941), 37 states have internal predecessors, (2941), 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) [2023-01-28 05:35:46,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:35:46,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 334 [2023-01-28 05:35:46,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:35:47,261 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse12 (+ c_~i~0 1))) (let ((.cse3 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse2 (< c_~j~0 .cse12)) (.cse0 (<= c_~n1~0 c_~q1_back~0)) (.cse1 (< c_~q2_back~0 0)) (.cse14 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse13 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse9 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse11 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (<= c_~n2~0 c_~q2_back~0)) (.cse4 (< c_~q1_back~0 0)) (.cse7 (<= c_~n2~0 c_~q2_front~0)) (.cse5 (< c_~q2_front~0 0))) (and (<= c_~i~0 c_~j~0) (or (< 0 c_~q2_front~0) .cse0 .cse1 (and .cse2 (= c_~q1_back~0 c_~q1_front~0)) (< 0 c_~q2_back~0) .cse3 .cse4 .cse5 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) 0))))) (or .cse0 .cse1 .cse6 .cse3 .cse4 .cse7 .cse5 (let ((.cse16 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse17 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_197 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse15 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse16 .cse17 v_ArrVal_197)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse10 (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse8 (select .cse15 c_~q1~0.base))) (or (not (= (select .cse8 .cse9) c_~j~0)) (< (select .cse10 .cse11) .cse12) (not (= (select .cse10 .cse13) c_~i~0)) (< (select .cse8 .cse14) c_~i~0))))) (forall ((v_ArrVal_197 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse20 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse16 .cse17 v_ArrVal_197)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse18 (select .cse20 c_~q1~0.base)) (.cse19 (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse18 .cse9) c_~j~0)) (< (select .cse18 .cse14) .cse12) (not (= (select .cse19 .cse13) c_~i~0)) (< (select .cse19 .cse11) c_~i~0)))))))) .cse2 (or .cse0 .cse1 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (and (forall ((v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse23 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse22 (select .cse23 c_~q1~0.base)) (.cse21 (select .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse21 .cse13) c_~i~0)) (not (= (select .cse22 .cse9) c_~j~0)) (< (select .cse22 .cse14) c_~i~0) (< (select .cse21 .cse11) .cse12))))) (forall ((v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse26 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse24 (select .cse26 c_~q1~0.base)) (.cse25 (select .cse26 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse24 .cse14) .cse12) (not (= (select .cse25 .cse13) c_~i~0)) (not (= (select .cse24 .cse9) c_~j~0)) (< (select .cse25 .cse11) c_~i~0)))))) .cse6 .cse4 .cse7 .cse5)))) is different from false [2023-01-28 05:35:48,516 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_~i~0 1))) (let ((.cse0 (<= c_~n1~0 c_~q1_back~0)) (.cse1 (< c_~q2_back~0 0)) (.cse3 (< c_~q1_back~0 0)) (.cse4 (< c_~q2_front~0 0)) (.cse2 (< c_~j~0 .cse9))) (and (<= c_~i~0 c_~j~0) (or (< 0 c_~q2_front~0) .cse0 .cse1 (and .cse2 (= c_~q1_back~0 c_~q1_front~0)) (< 0 c_~q2_back~0) (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse3 .cse4 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) 0))))) (or .cse0 .cse1 (<= c_~n2~0 c_~q2_back~0) .cse3 (<= c_~n2~0 c_~q2_front~0) .cse4 (let ((.cse8 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse10 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse6 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse11 (+ (* c_~q2_back~0 4) c_~q2~0.offset))) (and (forall ((v_ArrVal_200 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse5 (select .cse12 c_~q1~0.base)) (.cse7 (select .cse12 c_~q2~0.base))) (or (not (= c_~j~0 (select .cse5 .cse6))) (< (select .cse7 .cse8) .cse9) (< (select .cse5 .cse10) c_~i~0) (not (= c_~i~0 (select .cse7 .cse11))))))) (forall ((v_ArrVal_200 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse14 (select .cse15 c_~q1~0.base)) (.cse13 (select .cse15 c_~q2~0.base))) (or (< (select .cse13 .cse8) c_~i~0) (< (select .cse14 .cse10) .cse9) (not (= c_~j~0 (select .cse14 .cse6))) (not (= c_~i~0 (select .cse13 .cse11)))))))))) .cse2))) is different from false [2023-01-28 05:36:02,815 WARN L222 SmtUtils]: Spent 8.54s on a formula simplification. DAG size of input: 172 DAG size of output: 146 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:36:04,555 INFO L130 PetriNetUnfolder]: 519/962 cut-off events. [2023-01-28 05:36:04,555 INFO L131 PetriNetUnfolder]: For 2930/2930 co-relation queries the response was YES. [2023-01-28 05:36:04,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4384 conditions, 962 events. 519/962 cut-off events. For 2930/2930 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4782 event pairs, 24 based on Foata normal form. 9/963 useless extension candidates. Maximal degree in co-relation 3492. Up to 305 conditions per place. [2023-01-28 05:36:04,563 INFO L137 encePairwiseOnDemand]: 320/334 looper letters, 105 selfloop transitions, 191 changer transitions 15/311 dead transitions. [2023-01-28 05:36:04,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 311 transitions, 2825 flow [2023-01-28 05:36:04,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-01-28 05:36:04,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2023-01-28 05:36:04,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 4288 transitions. [2023-01-28 05:36:04,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.246890833717181 [2023-01-28 05:36:04,579 INFO L72 ComplementDD]: Start complementDD. Operand 52 states and 4288 transitions. [2023-01-28 05:36:04,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 4288 transitions. [2023-01-28 05:36:04,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:36:04,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 52 states and 4288 transitions. [2023-01-28 05:36:04,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 53 states, 52 states have (on average 82.46153846153847) internal successors, (4288), 52 states have internal predecessors, (4288), 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) [2023-01-28 05:36:04,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 53 states, 53 states have (on average 334.0) internal successors, (17702), 53 states have internal predecessors, (17702), 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) [2023-01-28 05:36:04,617 INFO L81 ComplementDD]: Finished complementDD. Result has 53 states, 53 states have (on average 334.0) internal successors, (17702), 53 states have internal predecessors, (17702), 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) [2023-01-28 05:36:04,617 INFO L175 Difference]: Start difference. First operand has 70 places, 79 transitions, 664 flow. Second operand 52 states and 4288 transitions. [2023-01-28 05:36:04,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 311 transitions, 2825 flow [2023-01-28 05:36:04,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 311 transitions, 2496 flow, removed 145 selfloop flow, removed 4 redundant places. [2023-01-28 05:36:04,642 INFO L231 Difference]: Finished difference. Result has 132 places, 213 transitions, 2159 flow [2023-01-28 05:36:04,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=6, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=2159, PETRI_PLACES=132, PETRI_TRANSITIONS=213} [2023-01-28 05:36:04,643 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 110 predicate places. [2023-01-28 05:36:04,643 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 213 transitions, 2159 flow [2023-01-28 05:36:04,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 79.48648648648648) internal successors, (2941), 37 states have internal predecessors, (2941), 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) [2023-01-28 05:36:04,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:36:04,644 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 05:36:04,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-01-28 05:36:04,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-01-28 05:36:04,851 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 05:36:04,851 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:36:04,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1006915981, now seen corresponding path program 4 times [2023-01-28 05:36:04,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:36:04,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247982246] [2023-01-28 05:36:04,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:36:04,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:36:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:36:05,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:36:05,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:36:05,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247982246] [2023-01-28 05:36:05,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247982246] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 05:36:05,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099929237] [2023-01-28 05:36:05,950 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 05:36:05,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:36:05,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:36:05,952 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) [2023-01-28 05:36:05,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-01-28 05:36:06,046 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 05:36:06,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 05:36:06,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 75 conjunts are in the unsatisfiable core [2023-01-28 05:36:06,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 05:36:06,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:36:06,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:36:06,079 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-01-28 05:36:06,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 16 [2023-01-28 05:36:06,156 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 [2023-01-28 05:36:06,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:36:06,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:36:06,280 INFO L321 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2023-01-28 05:36:06,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 25 [2023-01-28 05:36:06,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-01-28 05:36:06,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-28 05:36:06,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-28 05:36:06,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 20 [2023-01-28 05:36:06,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:36:06,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 05:36:12,304 INFO L321 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2023-01-28 05:36:12,305 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 2 case distinctions, treesize of input 267 treesize of output 129 [2023-01-28 05:36:12,397 INFO L321 Elim1Store]: treesize reduction 65, result has 55.8 percent of original size [2023-01-28 05:36:12,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 2265 treesize of output 2034 [2023-01-28 05:36:12,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:36:12,491 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:36:12,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 529 treesize of output 503 [2023-01-28 05:36:12,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:36:12,545 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:36:12,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 474 treesize of output 382 [2023-01-28 05:36:18,073 INFO L321 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2023-01-28 05:36:18,074 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 2 case distinctions, treesize of input 217 treesize of output 115 [2023-01-28 05:36:18,148 INFO L321 Elim1Store]: treesize reduction 66, result has 55.1 percent of original size [2023-01-28 05:36:18,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 485 treesize of output 509 [2023-01-28 05:36:18,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:36:18,193 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 05:36:18,205 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:36:18,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 192 treesize of output 200 [2023-01-28 05:36:18,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:36:18,222 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 05:36:18,234 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:36:18,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 206 treesize of output 190 [2023-01-28 05:36:19,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:36:19,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099929237] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 05:36:19,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 05:36:19,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2023-01-28 05:36:19,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257802058] [2023-01-28 05:36:19,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 05:36:19,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-01-28 05:36:19,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:36:19,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-01-28 05:36:19,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=953, Unknown=5, NotChecked=0, Total=1122 [2023-01-28 05:36:19,496 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 334 [2023-01-28 05:36:19,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 213 transitions, 2159 flow. Second operand has 34 states, 34 states have (on average 80.55882352941177) internal successors, (2739), 34 states have internal predecessors, (2739), 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) [2023-01-28 05:36:19,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:36:19,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 334 [2023-01-28 05:36:19,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:36:27,484 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] [2023-01-28 05:36:37,589 WARN L222 SmtUtils]: Spent 5.95s on a formula simplification. DAG size of input: 172 DAG size of output: 143 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:36:43,422 INFO L130 PetriNetUnfolder]: 725/1335 cut-off events. [2023-01-28 05:36:43,422 INFO L131 PetriNetUnfolder]: For 6083/6083 co-relation queries the response was YES. [2023-01-28 05:36:43,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7153 conditions, 1335 events. 725/1335 cut-off events. For 6083/6083 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 7147 event pairs, 21 based on Foata normal form. 6/1339 useless extension candidates. Maximal degree in co-relation 7068. Up to 375 conditions per place. [2023-01-28 05:36:43,433 INFO L137 encePairwiseOnDemand]: 322/334 looper letters, 123 selfloop transitions, 240 changer transitions 8/371 dead transitions. [2023-01-28 05:36:43,433 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 371 transitions, 4085 flow [2023-01-28 05:36:43,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-01-28 05:36:43,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2023-01-28 05:36:43,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 3608 transitions. [2023-01-28 05:36:43,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.251218493246066 [2023-01-28 05:36:43,448 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 3608 transitions. [2023-01-28 05:36:43,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 3608 transitions. [2023-01-28 05:36:43,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:36:43,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 3608 transitions. [2023-01-28 05:36:43,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 83.90697674418605) internal successors, (3608), 43 states have internal predecessors, (3608), 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) [2023-01-28 05:36:43,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 334.0) internal successors, (14696), 44 states have internal predecessors, (14696), 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) [2023-01-28 05:36:43,480 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 334.0) internal successors, (14696), 44 states have internal predecessors, (14696), 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) [2023-01-28 05:36:43,480 INFO L175 Difference]: Start difference. First operand has 132 places, 213 transitions, 2159 flow. Second operand 43 states and 3608 transitions. [2023-01-28 05:36:43,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 371 transitions, 4085 flow [2023-01-28 05:36:43,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 371 transitions, 3676 flow, removed 169 selfloop flow, removed 15 redundant places. [2023-01-28 05:36:43,538 INFO L231 Difference]: Finished difference. Result has 160 places, 282 transitions, 3055 flow [2023-01-28 05:36:43,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=1873, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=178, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=3055, PETRI_PLACES=160, PETRI_TRANSITIONS=282} [2023-01-28 05:36:43,540 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 138 predicate places. [2023-01-28 05:36:43,540 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 282 transitions, 3055 flow [2023-01-28 05:36:43,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 80.55882352941177) internal successors, (2739), 34 states have internal predecessors, (2739), 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) [2023-01-28 05:36:43,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:36:43,542 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 05:36:43,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-01-28 05:36:43,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:36:43,748 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 05:36:43,748 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:36:43,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1834517005, now seen corresponding path program 5 times [2023-01-28 05:36:43,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:36:43,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070378972] [2023-01-28 05:36:43,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:36:43,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:36:43,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:36:44,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:36:44,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:36:44,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070378972] [2023-01-28 05:36:44,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070378972] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 05:36:44,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45394169] [2023-01-28 05:36:44,742 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-28 05:36:44,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:36:44,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:36:44,743 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) [2023-01-28 05:36:44,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-01-28 05:36:44,827 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 05:36:44,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 05:36:44,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 68 conjunts are in the unsatisfiable core [2023-01-28 05:36:44,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 05:36:44,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:36:44,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:36:44,865 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-01-28 05:36:44,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2023-01-28 05:36:44,932 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 [2023-01-28 05:36:45,004 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 05:36:45,004 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 11 treesize of output 11 [2023-01-28 05:36:45,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-28 05:36:45,116 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 [2023-01-28 05:36:45,171 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 [2023-01-28 05:36:45,443 INFO L321 Elim1Store]: treesize reduction 42, result has 6.7 percent of original size [2023-01-28 05:36:45,443 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 34 treesize of output 15 [2023-01-28 05:36:45,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:36:45,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 05:36:46,808 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:36:46,809 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 158 treesize of output 110 [2023-01-28 05:36:46,926 INFO L321 Elim1Store]: treesize reduction 4, result has 95.3 percent of original size [2023-01-28 05:36:46,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54615 treesize of output 50999 [2023-01-28 05:36:47,443 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:36:47,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1849 treesize of output 1729 [2023-01-28 05:36:47,537 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:36:47,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1657 treesize of output 1633 [2023-01-28 05:36:47,637 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:36:47,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1584 treesize of output 1272 [2023-01-28 05:40:47,803 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:40:47,804 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 129 treesize of output 93 [2023-01-28 05:40:47,878 INFO L321 Elim1Store]: treesize reduction 4, result has 95.3 percent of original size [2023-01-28 05:40:47,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2787 treesize of output 2727 [2023-01-28 05:40:47,960 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:40:47,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 410 treesize of output 462 [2023-01-28 05:40:48,013 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:40:48,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 457 treesize of output 489 [2023-01-28 05:40:48,072 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:40:48,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 440 treesize of output 432 [2023-01-28 05:42:33,265 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:42:33,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45394169] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 05:42:33,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 05:42:33,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2023-01-28 05:42:33,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781378479] [2023-01-28 05:42:33,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 05:42:33,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-01-28 05:42:33,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:42:33,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-01-28 05:42:33,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=955, Unknown=7, NotChecked=0, Total=1122 [2023-01-28 05:42:33,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 334 [2023-01-28 05:42:33,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 282 transitions, 3055 flow. Second operand has 34 states, 34 states have (on average 80.55882352941177) internal successors, (2739), 34 states have internal predecessors, (2739), 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) [2023-01-28 05:42:33,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:42:33,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 334 [2023-01-28 05:42:33,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:42:39,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:43:12,626 WARN L222 SmtUtils]: Spent 27.27s on a formula simplification. DAG size of input: 201 DAG size of output: 174 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:43:18,738 INFO L130 PetriNetUnfolder]: 923/1706 cut-off events. [2023-01-28 05:43:18,738 INFO L131 PetriNetUnfolder]: For 7332/7332 co-relation queries the response was YES. [2023-01-28 05:43:18,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9313 conditions, 1706 events. 923/1706 cut-off events. For 7332/7332 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 9631 event pairs, 22 based on Foata normal form. 10/1714 useless extension candidates. Maximal degree in co-relation 9139. Up to 638 conditions per place. [2023-01-28 05:43:18,749 INFO L137 encePairwiseOnDemand]: 321/334 looper letters, 131 selfloop transitions, 291 changer transitions 5/427 dead transitions. [2023-01-28 05:43:18,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 427 transitions, 5081 flow [2023-01-28 05:43:18,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-01-28 05:43:18,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2023-01-28 05:43:18,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 3418 transitions. [2023-01-28 05:43:18,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2495983642471155 [2023-01-28 05:43:18,755 INFO L72 ComplementDD]: Start complementDD. Operand 41 states and 3418 transitions. [2023-01-28 05:43:18,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 3418 transitions. [2023-01-28 05:43:18,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:43:18,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 41 states and 3418 transitions. [2023-01-28 05:43:18,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 42 states, 41 states have (on average 83.36585365853658) internal successors, (3418), 41 states have internal predecessors, (3418), 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) [2023-01-28 05:43:18,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 42 states, 42 states have (on average 334.0) internal successors, (14028), 42 states have internal predecessors, (14028), 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) [2023-01-28 05:43:18,775 INFO L81 ComplementDD]: Finished complementDD. Result has 42 states, 42 states have (on average 334.0) internal successors, (14028), 42 states have internal predecessors, (14028), 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) [2023-01-28 05:43:18,775 INFO L175 Difference]: Start difference. First operand has 160 places, 282 transitions, 3055 flow. Second operand 41 states and 3418 transitions. [2023-01-28 05:43:18,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 427 transitions, 5081 flow [2023-01-28 05:43:18,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 427 transitions, 4653 flow, removed 144 selfloop flow, removed 15 redundant places. [2023-01-28 05:43:18,842 INFO L231 Difference]: Finished difference. Result has 194 places, 355 transitions, 4460 flow [2023-01-28 05:43:18,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=2701, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=220, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=4460, PETRI_PLACES=194, PETRI_TRANSITIONS=355} [2023-01-28 05:43:18,842 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 172 predicate places. [2023-01-28 05:43:18,842 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 355 transitions, 4460 flow [2023-01-28 05:43:18,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 80.55882352941177) internal successors, (2739), 34 states have internal predecessors, (2739), 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) [2023-01-28 05:43:18,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:43:18,843 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 05:43:18,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-01-28 05:43:19,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:43:19,044 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 05:43:19,044 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:43:19,044 INFO L85 PathProgramCache]: Analyzing trace with hash 130363839, now seen corresponding path program 6 times [2023-01-28 05:43:19,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:43:19,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528486407] [2023-01-28 05:43:19,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:43:19,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:43:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:43:19,973 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:43:19,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:43:19,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528486407] [2023-01-28 05:43:19,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528486407] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 05:43:19,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071672505] [2023-01-28 05:43:19,973 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-28 05:43:19,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:43:19,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:43:19,974 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) [2023-01-28 05:43:19,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-01-28 05:43:20,060 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-01-28 05:43:20,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 05:43:20,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 64 conjunts are in the unsatisfiable core [2023-01-28 05:43:20,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 05:43:20,214 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 11 treesize of output 7 [2023-01-28 05:43:20,271 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 [2023-01-28 05:43:20,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:43:20,391 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 16 treesize of output 18 [2023-01-28 05:43:20,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:43:20,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 05:43:20,842 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~n1~0 c_~q1_back~0) (let ((.cse4 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse2 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse5 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (and (forall ((v_ArrVal_336 (Array Int Int)) (~q1~0.base Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_336))) (let ((.cse3 (select .cse1 ~q1~0.base))) (let ((.cse0 (select .cse3 .cse5))) (or (< .cse0 (+ (select (select .cse1 c_~q2~0.base) .cse2) 1)) (not (= (select .cse3 .cse4) c_~j~0)) (< .cse0 c_~j~0)))))) (forall ((v_ArrVal_336 (Array Int Int)) (~q1~0.base Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_336))) (let ((.cse6 (select .cse8 ~q1~0.base))) (let ((.cse7 (select .cse6 .cse5))) (or (not (= (select .cse6 .cse4) c_~j~0)) (< .cse7 c_~j~0) (<= (select (select .cse8 c_~q2~0.base) .cse2) .cse7)))))))) (< c_~q1_back~0 0)) is different from false [2023-01-28 05:43:21,153 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:43:21,153 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 144 treesize of output 96 [2023-01-28 05:43:21,216 INFO L321 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2023-01-28 05:43:21,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2113 treesize of output 1905 [2023-01-28 05:43:21,285 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:43:21,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 489 treesize of output 503 [2023-01-28 05:43:21,321 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:43:21,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 416 treesize of output 336 [2023-01-28 05:43:38,471 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:43:38,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 94 [2023-01-28 05:43:38,475 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 05:43:38,502 INFO L321 Elim1Store]: treesize reduction 69, result has 25.8 percent of original size [2023-01-28 05:43:38,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 745 treesize of output 632 [2023-01-28 05:43:38,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:43:38,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:43:38,544 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:43:38,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 269 treesize of output 231 [2023-01-28 05:43:38,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:43:38,555 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 161 treesize of output 113 [2023-01-28 05:43:38,987 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:43:38,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071672505] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 05:43:38,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 05:43:38,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 33 [2023-01-28 05:43:38,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629948831] [2023-01-28 05:43:38,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 05:43:38,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-01-28 05:43:38,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:43:38,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-01-28 05:43:38,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=981, Unknown=1, NotChecked=64, Total=1190 [2023-01-28 05:43:38,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 334 [2023-01-28 05:43:38,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 355 transitions, 4460 flow. Second operand has 35 states, 35 states have (on average 82.51428571428572) internal successors, (2888), 35 states have internal predecessors, (2888), 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) [2023-01-28 05:43:38,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:43:38,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 334 [2023-01-28 05:43:38,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:43:45,230 WARN L222 SmtUtils]: Spent 6.17s on a formula simplification. DAG size of input: 85 DAG size of output: 74 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:43:46,080 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~j~0 c_~i~0) (or (<= c_~n1~0 c_~q1_back~0) (< c_~q2_back~0 0) (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse4 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse1 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse7 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_335 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_335))) (or (forall ((v_ArrVal_336 (Array Int Int)) (~q1~0.base Int)) (let ((.cse0 (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_336))) (let ((.cse3 (select .cse0 ~q1~0.base))) (let ((.cse2 (select .cse3 .cse5))) (or (<= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) .cse2) (not (= (select .cse3 .cse4) c_~j~0)) (< .cse2 c_~j~0)))))) (not (= (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse7) c_~i~0))))) (forall ((v_ArrVal_335 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_335))) (or (forall ((v_ArrVal_336 (Array Int Int)) (~q1~0.base Int)) (let ((.cse10 (store .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_336))) (let ((.cse8 (select .cse10 ~q1~0.base))) (let ((.cse9 (select .cse8 .cse5))) (or (not (= (select .cse8 .cse4) c_~j~0)) (< .cse9 (+ (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) 1)) (< .cse9 c_~j~0)))))) (not (= (select (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse7) c_~i~0))))))) (<= c_~n2~0 c_~q2_back~0) (< c_~q1_back~0 0)) (< c_~i~0 (+ c_~j~0 1))) is different from false [2023-01-28 05:43:46,634 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (< c_~q2_back~0 0)) (.cse0 (<= c_~n1~0 c_~q1_back~0)) (.cse2 (let ((.cse8 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse6 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse9 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (and (forall ((v_ArrVal_336 (Array Int Int)) (~q1~0.base Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_336))) (let ((.cse7 (select .cse5 ~q1~0.base))) (let ((.cse4 (select .cse7 .cse9))) (or (< .cse4 (+ (select (select .cse5 c_~q2~0.base) .cse6) 1)) (not (= (select .cse7 .cse8) c_~j~0)) (< .cse4 c_~j~0)))))) (forall ((v_ArrVal_336 (Array Int Int)) (~q1~0.base Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_336))) (let ((.cse10 (select .cse12 ~q1~0.base))) (let ((.cse11 (select .cse10 .cse9))) (or (not (= (select .cse10 .cse8) c_~j~0)) (< .cse11 c_~j~0) (<= (select (select .cse12 c_~q2~0.base) .cse6) .cse11))))))))) (.cse3 (< c_~q1_back~0 0))) (and (or .cse0 .cse1 .cse2 (<= c_~n2~0 c_~q2_back~0) .cse3 (not (= c_~i~0 (select (select |c_#memory_int| c_~q2~0.base) (+ (* c_~q2_back~0 4) c_~q2~0.offset))))) (or .cse0 .cse1 (and (<= c_~i~0 c_~j~0) (= c_~q2_front~0 c_~q2_back~0) (< c_~j~0 (+ c_~i~0 1)) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~q1_back~0 c_~q1_front~0)) (< 0 c_~q2_back~0) (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse3) (or .cse0 .cse2 .cse3) (<= c_~j~0 c_~i~0) (< c_~i~0 (+ c_~j~0 1)))) is different from false [2023-01-28 05:43:47,034 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (< c_~q2_back~0 0)) (.cse0 (<= c_~n1~0 c_~q1_back~0)) (.cse2 (let ((.cse8 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse6 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse9 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (and (forall ((v_ArrVal_336 (Array Int Int)) (~q1~0.base Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_336))) (let ((.cse7 (select .cse5 ~q1~0.base))) (let ((.cse4 (select .cse7 .cse9))) (or (< .cse4 (+ (select (select .cse5 c_~q2~0.base) .cse6) 1)) (not (= (select .cse7 .cse8) c_~j~0)) (< .cse4 c_~j~0)))))) (forall ((v_ArrVal_336 (Array Int Int)) (~q1~0.base Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_336))) (let ((.cse10 (select .cse12 ~q1~0.base))) (let ((.cse11 (select .cse10 .cse9))) (or (not (= (select .cse10 .cse8) c_~j~0)) (< .cse11 c_~j~0) (<= (select (select .cse12 c_~q2~0.base) .cse6) .cse11))))))))) (.cse3 (< c_~q1_back~0 0))) (and (or .cse0 .cse1 .cse2 (<= c_~n2~0 c_~q2_back~0) .cse3 (not (= c_~i~0 (select (select |c_#memory_int| c_~q2~0.base) (+ (* c_~q2_back~0 4) c_~q2~0.offset))))) (or .cse0 .cse1 (and (<= c_~i~0 c_~j~0) (= c_~q2_front~0 c_~q2_back~0) (< c_~j~0 (+ c_~i~0 1)) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~q1_back~0 c_~q1_front~0)) (< 0 c_~q2_back~0) (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse3) (or .cse0 .cse2 .cse3) (or (and (<= c_~j~0 c_~i~0) (< c_~i~0 (+ c_~j~0 1))) (< c_~i~0 c_~N~0)))) is different from false [2023-01-28 05:43:49,967 INFO L130 PetriNetUnfolder]: 1136/2098 cut-off events. [2023-01-28 05:43:49,967 INFO L131 PetriNetUnfolder]: For 13178/13178 co-relation queries the response was YES. [2023-01-28 05:43:49,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12844 conditions, 2098 events. 1136/2098 cut-off events. For 13178/13178 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 12386 event pairs, 42 based on Foata normal form. 3/2098 useless extension candidates. Maximal degree in co-relation 12635. Up to 863 conditions per place. [2023-01-28 05:43:49,992 INFO L137 encePairwiseOnDemand]: 322/334 looper letters, 168 selfloop transitions, 361 changer transitions 7/536 dead transitions. [2023-01-28 05:43:49,992 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 536 transitions, 7311 flow [2023-01-28 05:43:49,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-01-28 05:43:49,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2023-01-28 05:43:49,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 3773 transitions. [2023-01-28 05:43:49,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25673652694610777 [2023-01-28 05:43:49,998 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 3773 transitions. [2023-01-28 05:43:49,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 3773 transitions. [2023-01-28 05:43:49,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:43:49,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 3773 transitions. [2023-01-28 05:43:50,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 45 states, 44 states have (on average 85.75) internal successors, (3773), 44 states have internal predecessors, (3773), 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) [2023-01-28 05:43:50,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 45 states, 45 states have (on average 334.0) internal successors, (15030), 45 states have internal predecessors, (15030), 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) [2023-01-28 05:43:50,014 INFO L81 ComplementDD]: Finished complementDD. Result has 45 states, 45 states have (on average 334.0) internal successors, (15030), 45 states have internal predecessors, (15030), 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) [2023-01-28 05:43:50,014 INFO L175 Difference]: Start difference. First operand has 194 places, 355 transitions, 4460 flow. Second operand 44 states and 3773 transitions. [2023-01-28 05:43:50,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 536 transitions, 7311 flow [2023-01-28 05:43:50,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 536 transitions, 7059 flow, removed 83 selfloop flow, removed 19 redundant places. [2023-01-28 05:43:50,148 INFO L231 Difference]: Finished difference. Result has 229 places, 444 transitions, 6494 flow [2023-01-28 05:43:50,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=4230, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=275, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=6494, PETRI_PLACES=229, PETRI_TRANSITIONS=444} [2023-01-28 05:43:50,150 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 207 predicate places. [2023-01-28 05:43:50,150 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 444 transitions, 6494 flow [2023-01-28 05:43:50,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 82.51428571428572) internal successors, (2888), 35 states have internal predecessors, (2888), 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) [2023-01-28 05:43:50,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:43:50,151 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 05:43:50,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-01-28 05:43:50,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-01-28 05:43:50,357 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 05:43:50,357 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:43:50,357 INFO L85 PathProgramCache]: Analyzing trace with hash -2104011777, now seen corresponding path program 7 times [2023-01-28 05:43:50,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:43:50,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729380973] [2023-01-28 05:43:50,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:43:50,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:43:50,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:43:51,420 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:43:51,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:43:51,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729380973] [2023-01-28 05:43:51,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729380973] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 05:43:51,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142773633] [2023-01-28 05:43:51,421 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-28 05:43:51,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:43:51,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:43:51,422 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) [2023-01-28 05:43:51,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-01-28 05:43:51,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:43:51,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 67 conjunts are in the unsatisfiable core [2023-01-28 05:43:51,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 05:43:51,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:43:51,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:43:51,546 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-01-28 05:43:51,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2023-01-28 05:43:51,628 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 [2023-01-28 05:43:51,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:43:51,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:43:51,702 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 05:43:51,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2023-01-28 05:43:51,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-01-28 05:43:51,835 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 [2023-01-28 05:43:51,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:43:51,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2023-01-28 05:43:52,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 20 [2023-01-28 05:43:52,332 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:43:52,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 05:43:52,633 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~n1~0 c_~q1_back~0) (let ((.cse1 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse2 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse4 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (and (forall ((v_ArrVal_383 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_383))) (let ((.cse0 (select .cse3 c_~q1~0.base))) (or (not (= (select .cse0 .cse1) c_~j~0)) (< (select .cse0 .cse2) c_~N~0) (< (+ (select (select .cse3 c_~q2~0.base) .cse4) 1) c_~N~0))))) (forall ((v_ArrVal_383 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_383))) (let ((.cse5 (select .cse6 c_~q1~0.base))) (or (not (= (select .cse5 .cse1) c_~j~0)) (< (+ (select .cse5 .cse2) 1) c_~N~0) (< (select (select .cse6 c_~q2~0.base) .cse4) c_~N~0))))))) (< c_~q1_back~0 0)) is different from false [2023-01-28 05:43:55,580 INFO L321 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2023-01-28 05:43:55,581 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 2 case distinctions, treesize of input 214 treesize of output 112 [2023-01-28 05:43:55,640 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:43:55,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 363 treesize of output 461 [2023-01-28 05:43:55,695 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:43:55,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 152 treesize of output 208 [2023-01-28 05:43:55,730 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:43:55,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 152 [2023-01-28 05:44:09,012 INFO L321 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2023-01-28 05:44:09,012 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 2 case distinctions, treesize of input 214 treesize of output 112 [2023-01-28 05:44:09,174 INFO L321 Elim1Store]: treesize reduction 4, result has 97.3 percent of original size [2023-01-28 05:44:09,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 445 treesize of output 531 [2023-01-28 05:44:09,262 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:44:09,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 152 treesize of output 208 [2023-01-28 05:44:09,323 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:44:09,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 152 [2023-01-28 05:44:19,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:44:19,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142773633] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 05:44:19,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 05:44:19,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2023-01-28 05:44:19,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56215843] [2023-01-28 05:44:19,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 05:44:19,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-01-28 05:44:19,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:44:19,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-01-28 05:44:19,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1135, Unknown=2, NotChecked=68, Total=1332 [2023-01-28 05:44:19,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 334 [2023-01-28 05:44:19,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 444 transitions, 6494 flow. Second operand has 37 states, 37 states have (on average 79.48648648648648) internal successors, (2941), 37 states have internal predecessors, (2941), 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) [2023-01-28 05:44:19,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:44:19,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 334 [2023-01-28 05:44:19,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:44:31,133 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse13 (<= c_~n1~0 c_~q1_back~0)) (.cse14 (< c_~q2_back~0 0)) (.cse12 (* c_~q2_front~0 4)) (.cse2 (+ c_~i~0 1)) (.cse3 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse1 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse11 (* c_~q2_back~0 4)) (.cse15 (<= c_~n2~0 c_~q2_back~0)) (.cse16 (< c_~q1_back~0 0))) (and (= c_~j~0 c_~i~0) (or (let ((.cse5 (+ .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse7 (+ .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_382 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_382))) (or (forall ((v_ArrVal_383 (Array Int Int))) (let ((.cse4 (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_383))) (let ((.cse0 (select .cse4 c_~q1~0.base))) (or (< (select .cse0 .cse1) .cse2) (not (= c_~j~0 (select .cse0 .cse3))) (< (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse5) c_~i~0))))) (not (= c_~i~0 (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse7)))))) (forall ((v_ArrVal_382 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_382))) (or (forall ((v_ArrVal_383 (Array Int Int))) (let ((.cse9 (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_383))) (let ((.cse8 (select .cse9 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse8 .cse3))) (< (select .cse8 .cse1) c_~i~0) (< (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse5) .cse2))))) (not (= c_~i~0 (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse7)))))))) .cse13 .cse14 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse15 .cse16) (or .cse13 .cse14 (let ((.cse20 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse21 (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|))) (and (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_382 (Array Int Int)) (v_ArrVal_381 Int)) (let ((.cse19 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse20 (+ .cse21 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_381)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_382))) (or (forall ((v_ArrVal_383 (Array Int Int))) (let ((.cse17 (store .cse19 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_383))) (let ((.cse18 (select .cse17 c_~q1~0.base))) (or (< (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0) (not (= (select .cse18 .cse3) c_~j~0)) (< (select .cse18 .cse1) .cse2))))) (not (= (select (select .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse11 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_382 (Array Int Int)) (v_ArrVal_381 Int)) (let ((.cse24 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse20 (+ .cse21 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_381)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_382))) (or (forall ((v_ArrVal_383 (Array Int Int))) (let ((.cse22 (store .cse24 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_383))) (let ((.cse23 (select .cse22 c_~q1~0.base))) (or (< (select (select .cse22 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse2) (not (= (select .cse23 .cse3) c_~j~0)) (< (select .cse23 .cse1) c_~i~0))))) (not (= (select (select .cse24 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse11 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0))))))) .cse15 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse16))) is different from false [2023-01-28 05:44:33,157 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] [2023-01-28 05:44:35,291 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] [2023-01-28 05:44:42,431 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse28 (* c_~q2_front~0 4))) (let ((.cse29 (* c_~q1_front~0 4)) (.cse13 (select |c_#memory_int| c_~q2~0.base)) (.cse8 (+ c_~q2~0.offset .cse28))) (let ((.cse0 (select .cse13 .cse8)) (.cse16 (<= 1 c_~N~0)) (.cse15 (select |c_#memory_int| c_~q1~0.base)) (.cse1 (<= c_~n1~0 c_~q1_back~0)) (.cse2 (< c_~q2_back~0 0)) (.cse10 (+ c_~i~0 1)) (.cse6 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse9 (+ .cse29 c_~q1~0.offset)) (.cse14 (* c_~q2_back~0 4)) (.cse3 (<= c_~n2~0 c_~q2_back~0)) (.cse17 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse4 (< c_~q1_back~0 0))) (and (< .cse0 c_~N~0) (= c_~q2~0.offset 0) (or .cse1 .cse2 .cse3 .cse4 (and (forall ((v_ArrVal_383 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_383))) (let ((.cse5 (select .cse7 c_~q1~0.base))) (or (not (= (select .cse5 .cse6) c_~j~0)) (< (select (select .cse7 c_~q2~0.base) .cse8) c_~i~0) (< (select .cse5 .cse9) .cse10))))) (forall ((v_ArrVal_383 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_383))) (let ((.cse11 (select .cse12 c_~q1~0.base))) (or (not (= (select .cse11 .cse6) c_~j~0)) (< (select (select .cse12 c_~q2~0.base) .cse8) .cse10) (< (select .cse11 .cse9) c_~i~0)))))) (not (= c_~i~0 (select .cse13 (+ .cse14 c_~q2~0.offset))))) (= c_~q1~0.offset 0) (<= (select .cse15 .cse9) 0) (<= 0 c_~q1_front~0) (= c_~j~0 c_~i~0) (or (and (= c_~q1_front~0 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~q2~0.base)) (= 0 (select .cse13 0)) .cse16 (= c_~q2_front~0 0) (= c_~j~0 0)) (not (= c_~q1_back~0 0))) (<= c_~q2_front~0 0) (<= 0 .cse0) .cse16 (or .cse1 .cse2 .cse17 .cse4 (let ((.cse19 (< 0 c_~q2_back~0)) (.cse18 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_100| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_100|) 0)) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_100|))))) (and (or (and (or .cse18 (= c_~q2_front~0 c_~q2_back~0)) (or (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|))) .cse19 (< c_~j~0 c_~i~0)) (or (and (< c_~j~0 .cse10) (= c_~q1_back~0 c_~q1_front~0)) .cse19 .cse18)))) (not (= c_~q1~0.base c_~q2~0.base)) (<= c_~i~0 c_~N~0) (or (let ((.cse22 (+ .cse28 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse24 (+ .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_382 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_382))) (or (forall ((v_ArrVal_383 (Array Int Int))) (let ((.cse21 (store .cse23 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_383))) (let ((.cse20 (select .cse21 c_~q1~0.base))) (or (< (select .cse20 .cse9) .cse10) (not (= c_~j~0 (select .cse20 .cse6))) (< (select (select .cse21 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse22) c_~i~0))))) (not (= c_~i~0 (select (select .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse24)))))) (forall ((v_ArrVal_382 (Array Int Int))) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_382))) (or (forall ((v_ArrVal_383 (Array Int Int))) (let ((.cse26 (store .cse27 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_383))) (let ((.cse25 (select .cse26 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse25 .cse6))) (< (select .cse25 .cse9) c_~i~0) (< (select (select .cse26 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse22) .cse10))))) (not (= c_~i~0 (select (select .cse27 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse24)))))))) .cse1 .cse2 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse3 .cse4) (or (<= c_~n1~0 1) (<= c_~q1_back~0 0)) (<= 0 c_~q2_front~0) (= (select .cse15 .cse29) 0) (= (select .cse13 .cse28) 0) (or .cse1 .cse2 (let ((.cse33 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse34 (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|))) (and (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_382 (Array Int Int)) (v_ArrVal_381 Int)) (let ((.cse32 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse33 (+ .cse34 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_381)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_382))) (or (forall ((v_ArrVal_383 (Array Int Int))) (let ((.cse30 (store .cse32 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_383))) (let ((.cse31 (select .cse30 c_~q1~0.base))) (or (< (select (select .cse30 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse28 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0) (not (= (select .cse31 .cse6) c_~j~0)) (< (select .cse31 .cse9) .cse10))))) (not (= (select (select .cse32 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_382 (Array Int Int)) (v_ArrVal_381 Int)) (let ((.cse37 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse33 (+ .cse34 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_381)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_382))) (or (forall ((v_ArrVal_383 (Array Int Int))) (let ((.cse35 (store .cse37 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_383))) (let ((.cse36 (select .cse35 c_~q1~0.base))) (or (< (select (select .cse35 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse28 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse10) (not (= (select .cse36 .cse6) c_~j~0)) (< (select .cse36 .cse9) c_~i~0))))) (not (= (select (select .cse37 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0))))))) .cse3 .cse17 .cse4) (exists ((~q1~0.offset Int) (v_~q1_front~0_79 Int) (~q1~0.base Int)) (let ((.cse38 (select (select |c_#memory_int| ~q1~0.base) (+ ~q1~0.offset (* 4 v_~q1_front~0_79))))) (and (<= 0 v_~q1_front~0_79) (<= c_~i~0 (+ .cse38 1)) (<= v_~q1_front~0_79 0) (<= .cse38 0) (not (= ~q1~0.base c_~q2~0.base))))) (<= c_~q1_front~0 0))))) is different from false [2023-01-28 05:44:51,655 INFO L130 PetriNetUnfolder]: 1216/2267 cut-off events. [2023-01-28 05:44:51,655 INFO L131 PetriNetUnfolder]: For 20787/20787 co-relation queries the response was YES. [2023-01-28 05:44:51,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15628 conditions, 2267 events. 1216/2267 cut-off events. For 20787/20787 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 13811 event pairs, 54 based on Foata normal form. 6/2269 useless extension candidates. Maximal degree in co-relation 15370. Up to 1148 conditions per place. [2023-01-28 05:44:51,683 INFO L137 encePairwiseOnDemand]: 319/334 looper letters, 141 selfloop transitions, 414 changer transitions 15/570 dead transitions. [2023-01-28 05:44:51,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 570 transitions, 8864 flow [2023-01-28 05:44:51,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-01-28 05:44:51,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2023-01-28 05:44:51,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 3765 transitions. [2023-01-28 05:44:51,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2450533715178339 [2023-01-28 05:44:51,689 INFO L72 ComplementDD]: Start complementDD. Operand 46 states and 3765 transitions. [2023-01-28 05:44:51,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 3765 transitions. [2023-01-28 05:44:51,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:44:51,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 3765 transitions. [2023-01-28 05:44:51,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 47 states, 46 states have (on average 81.84782608695652) internal successors, (3765), 46 states have internal predecessors, (3765), 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) [2023-01-28 05:44:51,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 47 states, 47 states have (on average 334.0) internal successors, (15698), 47 states have internal predecessors, (15698), 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) [2023-01-28 05:44:51,707 INFO L81 ComplementDD]: Finished complementDD. Result has 47 states, 47 states have (on average 334.0) internal successors, (15698), 47 states have internal predecessors, (15698), 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) [2023-01-28 05:44:51,707 INFO L175 Difference]: Start difference. First operand has 229 places, 444 transitions, 6494 flow. Second operand 46 states and 3765 transitions. [2023-01-28 05:44:51,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 570 transitions, 8864 flow [2023-01-28 05:44:51,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 570 transitions, 8691 flow, removed 67 selfloop flow, removed 12 redundant places. [2023-01-28 05:44:51,893 INFO L231 Difference]: Finished difference. Result has 270 places, 492 transitions, 7988 flow [2023-01-28 05:44:51,894 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=6344, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=366, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=7988, PETRI_PLACES=270, PETRI_TRANSITIONS=492} [2023-01-28 05:44:51,894 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 248 predicate places. [2023-01-28 05:44:51,895 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 492 transitions, 7988 flow [2023-01-28 05:44:51,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 79.48648648648648) internal successors, (2941), 37 states have internal predecessors, (2941), 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) [2023-01-28 05:44:51,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:44:51,895 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 05:44:51,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-01-28 05:44:52,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:44:52,101 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 05:44:52,101 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:44:52,101 INFO L85 PathProgramCache]: Analyzing trace with hash 986859785, now seen corresponding path program 8 times [2023-01-28 05:44:52,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:44:52,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986838407] [2023-01-28 05:44:52,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:44:52,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:44:52,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:44:53,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:44:53,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:44:53,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986838407] [2023-01-28 05:44:53,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986838407] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 05:44:53,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376212363] [2023-01-28 05:44:53,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 05:44:53,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:44:53,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:44:53,965 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) [2023-01-28 05:44:53,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-01-28 05:44:54,064 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 05:44:54,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 05:44:54,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 84 conjunts are in the unsatisfiable core [2023-01-28 05:44:54,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 05:44:54,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:44:54,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:44:54,133 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-01-28 05:44:54,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-01-28 05:44:54,235 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 11 treesize of output 7 [2023-01-28 05:44:54,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:44:54,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:44:54,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:44:54,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:44:54,354 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 05:44:54,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2023-01-28 05:44:54,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-28 05:44:54,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-28 05:44:54,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:44:54,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 05:44:54,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:44:54,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 05:44:55,938 INFO L321 Elim1Store]: treesize reduction 23, result has 60.3 percent of original size [2023-01-28 05:44:55,938 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 2 case distinctions, treesize of input 189 treesize of output 95 [2023-01-28 05:44:56,089 INFO L321 Elim1Store]: treesize reduction 4, result has 97.0 percent of original size [2023-01-28 05:44:56,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 966 treesize of output 954 [2023-01-28 05:44:56,197 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:44:56,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 404 treesize of output 426 [2023-01-28 05:44:56,253 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:44:56,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 336 treesize of output 280 [2023-01-28 05:45:13,096 INFO L321 Elim1Store]: treesize reduction 23, result has 60.3 percent of original size [2023-01-28 05:45:13,096 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 2 case distinctions, treesize of input 191 treesize of output 97 [2023-01-28 05:45:13,230 INFO L321 Elim1Store]: treesize reduction 4, result has 97.0 percent of original size [2023-01-28 05:45:13,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 532 treesize of output 584 [2023-01-28 05:45:13,271 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:45:13,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 414 treesize of output 358 [2023-01-28 05:45:13,328 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:45:13,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 344 treesize of output 366 [2023-01-28 05:45:34,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:45:34,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376212363] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 05:45:34,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 05:45:34,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 31 [2023-01-28 05:45:34,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660461829] [2023-01-28 05:45:34,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 05:45:34,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-01-28 05:45:34,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:45:34,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-01-28 05:45:34,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=929, Unknown=6, NotChecked=0, Total=1056 [2023-01-28 05:45:34,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 334 [2023-01-28 05:45:34,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 492 transitions, 7988 flow. Second operand has 33 states, 33 states have (on average 79.60606060606061) internal successors, (2627), 33 states have internal predecessors, (2627), 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) [2023-01-28 05:45:34,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:45:34,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 334 [2023-01-28 05:45:34,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:45:42,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:45:47,909 INFO L130 PetriNetUnfolder]: 1302/2412 cut-off events. [2023-01-28 05:45:47,909 INFO L131 PetriNetUnfolder]: For 30060/30060 co-relation queries the response was YES. [2023-01-28 05:45:47,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18889 conditions, 2412 events. 1302/2412 cut-off events. For 30060/30060 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 14806 event pairs, 120 based on Foata normal form. 2/2410 useless extension candidates. Maximal degree in co-relation 18705. Up to 1039 conditions per place. [2023-01-28 05:45:47,934 INFO L137 encePairwiseOnDemand]: 322/334 looper letters, 183 selfloop transitions, 392 changer transitions 2/577 dead transitions. [2023-01-28 05:45:47,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 577 transitions, 10168 flow [2023-01-28 05:45:47,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-01-28 05:45:47,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2023-01-28 05:45:47,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 2637 transitions. [2023-01-28 05:45:47,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2467252994011976 [2023-01-28 05:45:47,938 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 2637 transitions. [2023-01-28 05:45:47,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 2637 transitions. [2023-01-28 05:45:47,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:45:47,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 2637 transitions. [2023-01-28 05:45:47,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 82.40625) internal successors, (2637), 32 states have internal predecessors, (2637), 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) [2023-01-28 05:45:47,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 334.0) internal successors, (11022), 33 states have internal predecessors, (11022), 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) [2023-01-28 05:45:47,949 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 334.0) internal successors, (11022), 33 states have internal predecessors, (11022), 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) [2023-01-28 05:45:47,949 INFO L175 Difference]: Start difference. First operand has 270 places, 492 transitions, 7988 flow. Second operand 32 states and 2637 transitions. [2023-01-28 05:45:47,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 577 transitions, 10168 flow [2023-01-28 05:45:48,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 577 transitions, 9965 flow, removed 25 selfloop flow, removed 21 redundant places. [2023-01-28 05:45:48,153 INFO L231 Difference]: Finished difference. Result has 284 places, 523 transitions, 9466 flow [2023-01-28 05:45:48,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=7789, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=364, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=9466, PETRI_PLACES=284, PETRI_TRANSITIONS=523} [2023-01-28 05:45:48,154 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 262 predicate places. [2023-01-28 05:45:48,154 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 523 transitions, 9466 flow [2023-01-28 05:45:48,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 79.60606060606061) internal successors, (2627), 33 states have internal predecessors, (2627), 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) [2023-01-28 05:45:48,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:45:48,155 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 05:45:48,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-01-28 05:45:48,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:45:48,360 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 05:45:48,360 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:45:48,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1392456859, now seen corresponding path program 9 times [2023-01-28 05:45:48,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:45:48,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256660303] [2023-01-28 05:45:48,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:45:48,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:45:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:45:49,645 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:45:49,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:45:49,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256660303] [2023-01-28 05:45:49,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256660303] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 05:45:49,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543680002] [2023-01-28 05:45:49,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 05:45:49,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:45:49,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:45:49,647 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) [2023-01-28 05:45:49,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-01-28 05:45:49,791 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-01-28 05:45:49,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 05:45:49,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 51 conjunts are in the unsatisfiable core [2023-01-28 05:45:49,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 05:45:49,918 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 11 treesize of output 7 [2023-01-28 05:45:49,995 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 [2023-01-28 05:45:50,066 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 [2023-01-28 05:45:50,347 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-28 05:45:50,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 05:45:50,896 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:45:50,897 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 118 treesize of output 82 [2023-01-28 05:45:50,970 INFO L321 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2023-01-28 05:45:50,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1112 treesize of output 1048 [2023-01-28 05:45:51,047 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:45:51,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 502 treesize of output 462 [2023-01-28 05:45:51,095 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:45:51,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 382 treesize of output 402 [2023-01-28 05:46:25,706 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:46:25,706 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 116 treesize of output 80 [2023-01-28 05:46:25,739 INFO L321 Elim1Store]: treesize reduction 69, result has 25.8 percent of original size [2023-01-28 05:46:25,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1048 treesize of output 919 [2023-01-28 05:46:25,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:46:25,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:46:25,777 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:46:25,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 470 treesize of output 426 [2023-01-28 05:46:25,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:46:25,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:46:25,797 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:46:25,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 410 treesize of output 306 [2023-01-28 05:46:26,204 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-28 05:46:26,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543680002] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 05:46:26,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 05:46:26,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 29 [2023-01-28 05:46:26,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303241332] [2023-01-28 05:46:26,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 05:46:26,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-01-28 05:46:26,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:46:26,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-01-28 05:46:26,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=815, Unknown=2, NotChecked=0, Total=930 [2023-01-28 05:46:26,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 334 [2023-01-28 05:46:26,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 523 transitions, 9466 flow. Second operand has 31 states, 31 states have (on average 82.74193548387096) internal successors, (2565), 31 states have internal predecessors, (2565), 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) [2023-01-28 05:46:26,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:46:26,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 334 [2023-01-28 05:46:26,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:46:33,598 WARN L222 SmtUtils]: Spent 6.28s on a formula simplification. DAG size of input: 98 DAG size of output: 81 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:46:37,344 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] [2023-01-28 05:46:39,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:46:41,353 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] [2023-01-28 05:46:43,356 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] [2023-01-28 05:46:45,360 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] [2023-01-28 05:46:47,410 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] [2023-01-28 05:46:49,440 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] [2023-01-28 05:46:50,032 INFO L130 PetriNetUnfolder]: 1484/2745 cut-off events. [2023-01-28 05:46:50,032 INFO L131 PetriNetUnfolder]: For 40579/40579 co-relation queries the response was YES. [2023-01-28 05:46:50,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23373 conditions, 2745 events. 1484/2745 cut-off events. For 40579/40579 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 17458 event pairs, 113 based on Foata normal form. 14/2755 useless extension candidates. Maximal degree in co-relation 23060. Up to 1563 conditions per place. [2023-01-28 05:46:50,060 INFO L137 encePairwiseOnDemand]: 322/334 looper letters, 289 selfloop transitions, 364 changer transitions 9/662 dead transitions. [2023-01-28 05:46:50,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 662 transitions, 12668 flow [2023-01-28 05:46:50,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-01-28 05:46:50,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2023-01-28 05:46:50,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 3166 transitions. [2023-01-28 05:46:50,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25619032205858555 [2023-01-28 05:46:50,064 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 3166 transitions. [2023-01-28 05:46:50,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 3166 transitions. [2023-01-28 05:46:50,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:46:50,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 3166 transitions. [2023-01-28 05:46:50,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 85.56756756756756) internal successors, (3166), 37 states have internal predecessors, (3166), 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) [2023-01-28 05:46:50,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 334.0) internal successors, (12692), 38 states have internal predecessors, (12692), 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) [2023-01-28 05:46:50,076 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 334.0) internal successors, (12692), 38 states have internal predecessors, (12692), 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) [2023-01-28 05:46:50,076 INFO L175 Difference]: Start difference. First operand has 284 places, 523 transitions, 9466 flow. Second operand 37 states and 3166 transitions. [2023-01-28 05:46:50,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 662 transitions, 12668 flow [2023-01-28 05:46:50,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 662 transitions, 12487 flow, removed 27 selfloop flow, removed 22 redundant places. [2023-01-28 05:46:50,419 INFO L231 Difference]: Finished difference. Result has 304 places, 577 transitions, 11290 flow [2023-01-28 05:46:50,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=9299, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=523, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=316, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=11290, PETRI_PLACES=304, PETRI_TRANSITIONS=577} [2023-01-28 05:46:50,419 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 282 predicate places. [2023-01-28 05:46:50,420 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 577 transitions, 11290 flow [2023-01-28 05:46:50,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 82.74193548387096) internal successors, (2565), 31 states have internal predecessors, (2565), 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) [2023-01-28 05:46:50,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:46:50,420 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 05:46:50,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-01-28 05:46:50,624 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,SelfDestructingSolverStorable14 [2023-01-28 05:46:50,624 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 05:46:50,625 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:46:50,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1442641314, now seen corresponding path program 10 times [2023-01-28 05:46:50,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:46:50,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662291193] [2023-01-28 05:46:50,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:46:50,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:46:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:46:50,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-01-28 05:46:50,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:46:50,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662291193] [2023-01-28 05:46:50,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662291193] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 05:46:50,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 05:46:50,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 05:46:50,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640000649] [2023-01-28 05:46:50,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 05:46:50,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 05:46:50,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:46:50,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 05:46:50,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 05:46:50,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 334 [2023-01-28 05:46:50,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 577 transitions, 11290 flow. Second operand has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 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) [2023-01-28 05:46:50,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:46:50,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 334 [2023-01-28 05:46:50,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:46:51,207 INFO L130 PetriNetUnfolder]: 1444/2691 cut-off events. [2023-01-28 05:46:51,207 INFO L131 PetriNetUnfolder]: For 43324/43324 co-relation queries the response was YES. [2023-01-28 05:46:51,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23960 conditions, 2691 events. 1444/2691 cut-off events. For 43324/43324 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 17121 event pairs, 280 based on Foata normal form. 16/2703 useless extension candidates. Maximal degree in co-relation 23665. Up to 2589 conditions per place. [2023-01-28 05:46:51,234 INFO L137 encePairwiseOnDemand]: 331/334 looper letters, 546 selfloop transitions, 24 changer transitions 0/570 dead transitions. [2023-01-28 05:46:51,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 570 transitions, 12240 flow [2023-01-28 05:46:51,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 05:46:51,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 05:46:51,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2023-01-28 05:46:51,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4590818363273453 [2023-01-28 05:46:51,236 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2023-01-28 05:46:51,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2023-01-28 05:46:51,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:46:51,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2023-01-28 05:46:51,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 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) [2023-01-28 05:46:51,237 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 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) [2023-01-28 05:46:51,237 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 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) [2023-01-28 05:46:51,237 INFO L175 Difference]: Start difference. First operand has 304 places, 577 transitions, 11290 flow. Second operand 3 states and 460 transitions. [2023-01-28 05:46:51,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 570 transitions, 12240 flow [2023-01-28 05:46:51,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 570 transitions, 12048 flow, removed 66 selfloop flow, removed 10 redundant places. [2023-01-28 05:46:51,618 INFO L231 Difference]: Finished difference. Result has 297 places, 568 transitions, 10973 flow [2023-01-28 05:46:51,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=10897, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=10973, PETRI_PLACES=297, PETRI_TRANSITIONS=568} [2023-01-28 05:46:51,619 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 275 predicate places. [2023-01-28 05:46:51,619 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 568 transitions, 10973 flow [2023-01-28 05:46:51,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 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) [2023-01-28 05:46:51,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:46:51,619 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 05:46:51,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-01-28 05:46:51,619 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 05:46:51,620 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:46:51,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1741896033, now seen corresponding path program 11 times [2023-01-28 05:46:51,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:46:51,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253409060] [2023-01-28 05:46:51,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:46:51,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:46:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:46:51,715 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 05:46:51,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:46:51,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253409060] [2023-01-28 05:46:51,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253409060] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 05:46:51,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482781645] [2023-01-28 05:46:51,716 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-28 05:46:51,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:46:51,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:46:51,721 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) [2023-01-28 05:46:51,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-01-28 05:46:51,822 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-01-28 05:46:51,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 05:46:51,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 11 conjunts are in the unsatisfiable core [2023-01-28 05:46:51,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 05:46:51,883 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 05:46:51,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 05:46:51,942 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 05:46:51,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482781645] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 05:46:51,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 05:46:51,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-01-28 05:46:51,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495668093] [2023-01-28 05:46:51,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 05:46:51,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-01-28 05:46:51,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:46:51,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-01-28 05:46:51,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-01-28 05:46:51,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 334 [2023-01-28 05:46:51,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 568 transitions, 10973 flow. Second operand has 12 states, 12 states have (on average 128.0) internal successors, (1536), 12 states have internal predecessors, (1536), 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) [2023-01-28 05:46:51,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:46:51,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 334 [2023-01-28 05:46:51,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:46:52,533 INFO L130 PetriNetUnfolder]: 1134/2232 cut-off events. [2023-01-28 05:46:52,533 INFO L131 PetriNetUnfolder]: For 43368/43368 co-relation queries the response was YES. [2023-01-28 05:46:52,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19414 conditions, 2232 events. 1134/2232 cut-off events. For 43368/43368 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 14551 event pairs, 396 based on Foata normal form. 141/2369 useless extension candidates. Maximal degree in co-relation 19341. Up to 1181 conditions per place. [2023-01-28 05:46:52,556 INFO L137 encePairwiseOnDemand]: 330/334 looper letters, 402 selfloop transitions, 26 changer transitions 11/439 dead transitions. [2023-01-28 05:46:52,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 439 transitions, 9154 flow [2023-01-28 05:46:52,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 05:46:52,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 05:46:52,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 791 transitions. [2023-01-28 05:46:52,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39471057884231536 [2023-01-28 05:46:52,557 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 791 transitions. [2023-01-28 05:46:52,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 791 transitions. [2023-01-28 05:46:52,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:46:52,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 791 transitions. [2023-01-28 05:46:52,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.83333333333334) internal successors, (791), 6 states have internal predecessors, (791), 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) [2023-01-28 05:46:52,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 334.0) internal successors, (2338), 7 states have internal predecessors, (2338), 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) [2023-01-28 05:46:52,560 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 334.0) internal successors, (2338), 7 states have internal predecessors, (2338), 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) [2023-01-28 05:46:52,560 INFO L175 Difference]: Start difference. First operand has 297 places, 568 transitions, 10973 flow. Second operand 6 states and 791 transitions. [2023-01-28 05:46:52,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 439 transitions, 9154 flow [2023-01-28 05:46:52,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 439 transitions, 8961 flow, removed 22 selfloop flow, removed 9 redundant places. [2023-01-28 05:46:52,867 INFO L231 Difference]: Finished difference. Result has 271 places, 367 transitions, 7049 flow [2023-01-28 05:46:52,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=6986, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7049, PETRI_PLACES=271, PETRI_TRANSITIONS=367} [2023-01-28 05:46:52,867 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 249 predicate places. [2023-01-28 05:46:52,867 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 367 transitions, 7049 flow [2023-01-28 05:46:52,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 128.0) internal successors, (1536), 12 states have internal predecessors, (1536), 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) [2023-01-28 05:46:52,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:46:52,868 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 05:46:52,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-01-28 05:46:53,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-01-28 05:46:53,075 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 05:46:53,075 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:46:53,075 INFO L85 PathProgramCache]: Analyzing trace with hash 819523034, now seen corresponding path program 12 times [2023-01-28 05:46:53,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:46:53,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488544369] [2023-01-28 05:46:53,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:46:53,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:46:53,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:46:53,192 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 05:46:53,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:46:53,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488544369] [2023-01-28 05:46:53,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488544369] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 05:46:53,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096602941] [2023-01-28 05:46:53,192 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-28 05:46:53,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:46:53,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:46:53,197 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) [2023-01-28 05:46:53,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-01-28 05:46:53,421 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-01-28 05:46:53,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 05:46:53,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 8 conjunts are in the unsatisfiable core [2023-01-28 05:46:53,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 05:46:53,494 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 05:46:53,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 05:46:53,561 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 05:46:53,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096602941] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 05:46:53,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 05:46:53,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-01-28 05:46:53,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662735111] [2023-01-28 05:46:53,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 05:46:53,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-01-28 05:46:53,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:46:53,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-01-28 05:46:53,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-01-28 05:46:53,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 334 [2023-01-28 05:46:53,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 367 transitions, 7049 flow. Second operand has 12 states, 12 states have (on average 127.91666666666667) internal successors, (1535), 12 states have internal predecessors, (1535), 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) [2023-01-28 05:46:53,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:46:53,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 334 [2023-01-28 05:46:53,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:46:54,054 INFO L130 PetriNetUnfolder]: 924/1909 cut-off events. [2023-01-28 05:46:54,055 INFO L131 PetriNetUnfolder]: For 37390/37390 co-relation queries the response was YES. [2023-01-28 05:46:54,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16187 conditions, 1909 events. 924/1909 cut-off events. For 37390/37390 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 12548 event pairs, 350 based on Foata normal form. 132/2037 useless extension candidates. Maximal degree in co-relation 16117. Up to 1158 conditions per place. [2023-01-28 05:46:54,075 INFO L137 encePairwiseOnDemand]: 330/334 looper letters, 305 selfloop transitions, 13 changer transitions 40/358 dead transitions. [2023-01-28 05:46:54,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 358 transitions, 7309 flow [2023-01-28 05:46:54,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 05:46:54,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 05:46:54,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 791 transitions. [2023-01-28 05:46:54,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39471057884231536 [2023-01-28 05:46:54,078 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 791 transitions. [2023-01-28 05:46:54,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 791 transitions. [2023-01-28 05:46:54,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:46:54,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 791 transitions. [2023-01-28 05:46:54,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.83333333333334) internal successors, (791), 6 states have internal predecessors, (791), 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) [2023-01-28 05:46:54,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 334.0) internal successors, (2338), 7 states have internal predecessors, (2338), 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) [2023-01-28 05:46:54,080 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 334.0) internal successors, (2338), 7 states have internal predecessors, (2338), 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) [2023-01-28 05:46:54,080 INFO L175 Difference]: Start difference. First operand has 271 places, 367 transitions, 7049 flow. Second operand 6 states and 791 transitions. [2023-01-28 05:46:54,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 358 transitions, 7309 flow [2023-01-28 05:46:54,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 358 transitions, 7153 flow, removed 28 selfloop flow, removed 14 redundant places. [2023-01-28 05:46:54,287 INFO L231 Difference]: Finished difference. Result has 249 places, 278 transitions, 5320 flow [2023-01-28 05:46:54,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=5722, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5320, PETRI_PLACES=249, PETRI_TRANSITIONS=278} [2023-01-28 05:46:54,287 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 227 predicate places. [2023-01-28 05:46:54,287 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 278 transitions, 5320 flow [2023-01-28 05:46:54,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 127.91666666666667) internal successors, (1535), 12 states have internal predecessors, (1535), 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) [2023-01-28 05:46:54,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:46:54,288 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 05:46:54,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-01-28 05:46:54,500 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,SelfDestructingSolverStorable17 [2023-01-28 05:46:54,500 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 05:46:54,501 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:46:54,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1313846714, now seen corresponding path program 13 times [2023-01-28 05:46:54,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:46:54,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944609963] [2023-01-28 05:46:54,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:46:54,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:46:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:46:56,167 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:46:56,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:46:56,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944609963] [2023-01-28 05:46:56,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944609963] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 05:46:56,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080323868] [2023-01-28 05:46:56,168 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-28 05:46:56,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:46:56,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:46:56,169 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 05:46:56,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-01-28 05:46:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:46:56,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 38 conjunts are in the unsatisfiable core [2023-01-28 05:46:56,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 05:46:56,567 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:46:56,568 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 60 treesize of output 40 [2023-01-28 05:46:56,655 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 05:46:56,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 05:46:57,073 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:46:57,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 88 treesize of output 268 [2023-01-28 05:47:15,156 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-28 05:47:15,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080323868] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 05:47:15,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 05:47:15,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 7] total 28 [2023-01-28 05:47:15,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637097662] [2023-01-28 05:47:15,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 05:47:15,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-01-28 05:47:15,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:47:15,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-01-28 05:47:15,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2023-01-28 05:47:15,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 334 [2023-01-28 05:47:15,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 278 transitions, 5320 flow. Second operand has 30 states, 30 states have (on average 90.9) internal successors, (2727), 30 states have internal predecessors, (2727), 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) [2023-01-28 05:47:15,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:47:15,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 334 [2023-01-28 05:47:15,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:47:17,709 INFO L130 PetriNetUnfolder]: 1113/2206 cut-off events. [2023-01-28 05:47:17,709 INFO L131 PetriNetUnfolder]: For 33200/33200 co-relation queries the response was YES. [2023-01-28 05:47:17,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18356 conditions, 2206 events. 1113/2206 cut-off events. For 33200/33200 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 14576 event pairs, 78 based on Foata normal form. 6/2207 useless extension candidates. Maximal degree in co-relation 18293. Up to 1134 conditions per place. [2023-01-28 05:47:17,726 INFO L137 encePairwiseOnDemand]: 321/334 looper letters, 134 selfloop transitions, 271 changer transitions 11/416 dead transitions. [2023-01-28 05:47:17,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 416 transitions, 8002 flow [2023-01-28 05:47:17,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-01-28 05:47:17,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2023-01-28 05:47:17,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 3174 transitions. [2023-01-28 05:47:17,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27949982388164846 [2023-01-28 05:47:17,729 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 3174 transitions. [2023-01-28 05:47:17,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 3174 transitions. [2023-01-28 05:47:17,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:47:17,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 3174 transitions. [2023-01-28 05:47:17,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 93.3529411764706) internal successors, (3174), 34 states have internal predecessors, (3174), 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) [2023-01-28 05:47:17,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 334.0) internal successors, (11690), 35 states have internal predecessors, (11690), 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) [2023-01-28 05:47:17,740 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 334.0) internal successors, (11690), 35 states have internal predecessors, (11690), 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) [2023-01-28 05:47:17,740 INFO L175 Difference]: Start difference. First operand has 249 places, 278 transitions, 5320 flow. Second operand 34 states and 3174 transitions. [2023-01-28 05:47:17,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 416 transitions, 8002 flow [2023-01-28 05:47:17,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 416 transitions, 7769 flow, removed 94 selfloop flow, removed 17 redundant places. [2023-01-28 05:47:17,887 INFO L231 Difference]: Finished difference. Result has 248 places, 353 transitions, 7390 flow [2023-01-28 05:47:17,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=5249, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=203, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=7390, PETRI_PLACES=248, PETRI_TRANSITIONS=353} [2023-01-28 05:47:17,888 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 226 predicate places. [2023-01-28 05:47:17,888 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 353 transitions, 7390 flow [2023-01-28 05:47:17,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 90.9) internal successors, (2727), 30 states have internal predecessors, (2727), 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) [2023-01-28 05:47:17,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:47:17,888 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 05:47:17,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-01-28 05:47:18,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:47:18,089 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 05:47:18,089 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:47:18,089 INFO L85 PathProgramCache]: Analyzing trace with hash 486245690, now seen corresponding path program 14 times [2023-01-28 05:47:18,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:47:18,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116390381] [2023-01-28 05:47:18,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:47:18,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:47:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:47:19,643 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:47:19,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:47:19,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116390381] [2023-01-28 05:47:19,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116390381] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 05:47:19,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813509087] [2023-01-28 05:47:19,644 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 05:47:19,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:47:19,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:47:19,649 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 05:47:19,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-01-28 05:47:19,750 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 05:47:19,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 05:47:19,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 36 conjunts are in the unsatisfiable core [2023-01-28 05:47:19,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 05:47:20,061 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2023-01-28 05:47:20,061 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 60 treesize of output 20 [2023-01-28 05:47:20,152 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-28 05:47:20,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 05:47:20,602 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:47:20,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 88 treesize of output 268 [2023-01-28 05:47:40,364 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-28 05:47:40,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813509087] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 05:47:40,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 05:47:40,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 7] total 28 [2023-01-28 05:47:40,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281649581] [2023-01-28 05:47:40,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 05:47:40,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-01-28 05:47:40,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:47:40,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-01-28 05:47:40,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2023-01-28 05:47:40,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 334 [2023-01-28 05:47:40,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 353 transitions, 7390 flow. Second operand has 30 states, 30 states have (on average 80.86666666666666) internal successors, (2426), 30 states have internal predecessors, (2426), 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) [2023-01-28 05:47:40,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:47:40,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 334 [2023-01-28 05:47:40,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:47:42,803 INFO L130 PetriNetUnfolder]: 1256/2515 cut-off events. [2023-01-28 05:47:42,803 INFO L131 PetriNetUnfolder]: For 39509/39509 co-relation queries the response was YES. [2023-01-28 05:47:42,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21206 conditions, 2515 events. 1256/2515 cut-off events. For 39509/39509 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 17256 event pairs, 112 based on Foata normal form. 12/2522 useless extension candidates. Maximal degree in co-relation 21146. Up to 1510 conditions per place. [2023-01-28 05:47:42,822 INFO L137 encePairwiseOnDemand]: 321/334 looper letters, 151 selfloop transitions, 290 changer transitions 26/467 dead transitions. [2023-01-28 05:47:42,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 467 transitions, 9814 flow [2023-01-28 05:47:42,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-01-28 05:47:42,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2023-01-28 05:47:42,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2585 transitions. [2023-01-28 05:47:42,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24966196638980104 [2023-01-28 05:47:42,825 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 2585 transitions. [2023-01-28 05:47:42,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 2585 transitions. [2023-01-28 05:47:42,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:47:42,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 2585 transitions. [2023-01-28 05:47:42,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 83.38709677419355) internal successors, (2585), 31 states have internal predecessors, (2585), 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) [2023-01-28 05:47:42,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 334.0) internal successors, (10688), 32 states have internal predecessors, (10688), 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) [2023-01-28 05:47:42,834 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 334.0) internal successors, (10688), 32 states have internal predecessors, (10688), 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) [2023-01-28 05:47:42,834 INFO L175 Difference]: Start difference. First operand has 248 places, 353 transitions, 7390 flow. Second operand 31 states and 2585 transitions. [2023-01-28 05:47:42,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 467 transitions, 9814 flow [2023-01-28 05:47:43,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 467 transitions, 9554 flow, removed 80 selfloop flow, removed 10 redundant places. [2023-01-28 05:47:43,037 INFO L231 Difference]: Finished difference. Result has 276 places, 398 transitions, 9162 flow [2023-01-28 05:47:43,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=7138, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=246, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=9162, PETRI_PLACES=276, PETRI_TRANSITIONS=398} [2023-01-28 05:47:43,037 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 254 predicate places. [2023-01-28 05:47:43,037 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 398 transitions, 9162 flow [2023-01-28 05:47:43,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 80.86666666666666) internal successors, (2426), 30 states have internal predecessors, (2426), 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) [2023-01-28 05:47:43,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:47:43,038 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 05:47:43,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-01-28 05:47:43,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:47:43,238 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 05:47:43,239 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:47:43,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1905393628, now seen corresponding path program 15 times [2023-01-28 05:47:43,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:47:43,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358301510] [2023-01-28 05:47:43,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:47:43,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:47:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:47:45,358 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:47:45,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:47:45,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358301510] [2023-01-28 05:47:45,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358301510] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 05:47:45,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940720640] [2023-01-28 05:47:45,359 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 05:47:45,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:47:45,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:47:45,360 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 05:47:45,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-01-28 05:47:45,540 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-01-28 05:47:45,540 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 05:47:45,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 37 conjunts are in the unsatisfiable core [2023-01-28 05:47:45,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 05:47:45,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:47:45,733 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 29 treesize of output 29 [2023-01-28 05:47:45,950 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:47:45,950 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 60 treesize of output 40 [2023-01-28 05:47:46,035 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-28 05:47:46,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 05:47:46,356 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~q1_front~0 4)) (.cse2 (* c_~q1_back~0 4)) (.cse4 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (and (forall ((v_ArrVal_715 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_715))) (or (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse0 (select .cse3 ~q1~0.base))) (or (< (+ (select .cse0 (+ .cse1 ~q1~0.offset)) 1) c_~N~0) (not (= c_~j~0 (select .cse0 (+ .cse2 ~q1~0.offset))))))) (< (select (select .cse3 c_~q2~0.base) .cse4) c_~N~0)))) (forall ((v_ArrVal_715 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_715))) (or (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse5 (select .cse6 ~q1~0.base))) (or (< (select .cse5 (+ .cse1 ~q1~0.offset)) c_~N~0) (not (= c_~j~0 (select .cse5 (+ .cse2 ~q1~0.offset))))))) (< (+ (select (select .cse6 c_~q2~0.base) .cse4) 1) c_~N~0)))))) is different from false [2023-01-28 05:47:46,502 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:47:46,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 204 treesize of output 384 [2023-01-28 05:47:46,547 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:47:46,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 166 [2023-01-28 05:47:46,581 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:47:46,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 148 Received shutdown request... [2023-01-28 05:47:59,276 WARN L238 SmtUtils]: Removed 1 from assertion stack [2023-01-28 05:47:59,280 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-01-28 05:47:59,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-01-28 05:47:59,299 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 [2023-01-28 05:47:59,300 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-28 05:47:59,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-01-28 05:47:59,490 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 22 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-22-3-5-5-3-4-3-6-3-6-3-6-2-5-2-1 context. [2023-01-28 05:47:59,491 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-01-28 05:47:59,492 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-01-28 05:47:59,492 INFO L445 BasicCegarLoop]: Path program histogram: [15, 2, 1, 1, 1, 1] [2023-01-28 05:47:59,494 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 05:47:59,494 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 05:47:59,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 05:47:59 BasicIcfg [2023-01-28 05:47:59,497 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 05:47:59,498 INFO L158 Benchmark]: Toolchain (without parser) took 796368.74ms. Allocated memory was 373.3MB in the beginning and 1.4GB in the end (delta: 977.3MB). Free memory was 332.3MB in the beginning and 498.4MB in the end (delta: -166.2MB). Peak memory consumption was 838.7MB. Max. memory is 16.0GB. [2023-01-28 05:47:59,498 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 255.9MB. Free memory is still 213.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 05:47:59,498 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.54ms. Allocated memory is still 373.3MB. Free memory was 331.9MB in the beginning and 320.4MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-01-28 05:47:59,498 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.07ms. Allocated memory is still 373.3MB. Free memory was 320.4MB in the beginning and 318.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 05:47:59,499 INFO L158 Benchmark]: Boogie Preprocessor took 27.61ms. Allocated memory is still 373.3MB. Free memory was 318.3MB in the beginning and 316.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 05:47:59,499 INFO L158 Benchmark]: RCFGBuilder took 734.72ms. Allocated memory is still 373.3MB. Free memory was 316.5MB in the beginning and 287.2MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-01-28 05:47:59,499 INFO L158 Benchmark]: TraceAbstraction took 795351.79ms. Allocated memory was 373.3MB in the beginning and 1.4GB in the end (delta: 977.3MB). Free memory was 286.6MB in the beginning and 498.4MB in the end (delta: -211.9MB). Peak memory consumption was 794.7MB. Max. memory is 16.0GB. [2023-01-28 05:47:59,500 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.12ms. Allocated memory is still 255.9MB. Free memory is still 213.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 212.54ms. Allocated memory is still 373.3MB. Free memory was 331.9MB in the beginning and 320.4MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 35.07ms. Allocated memory is still 373.3MB. Free memory was 320.4MB in the beginning and 318.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 27.61ms. Allocated memory is still 373.3MB. Free memory was 318.3MB in the beginning and 316.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 734.72ms. Allocated memory is still 373.3MB. Free memory was 316.5MB in the beginning and 287.2MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * TraceAbstraction took 795351.79ms. Allocated memory was 373.3MB in the beginning and 1.4GB in the end (delta: 977.3MB). Free memory was 286.6MB in the beginning and 498.4MB in the end (delta: -211.9MB). Peak memory consumption was 794.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 154 PlacesBefore, 22 PlacesAfterwards, 160 TransitionsBefore, 19 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 7 FixpointIterations, 115 TrivialSequentialCompositions, 17 ConcurrentSequentialCompositions, 19 TrivialYvCompositions, 4 ConcurrentYvCompositions, 9 ChoiceCompositions, 164 TotalNumberOfCompositions, 763 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 651, independent: 614, independent conditional: 0, independent unconditional: 614, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 269, independent: 260, independent conditional: 0, independent unconditional: 260, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 651, independent: 354, independent conditional: 0, independent unconditional: 354, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 269, unknown conditional: 0, unknown unconditional: 269] , Statistics on independence cache: Total cache size (in pairs): 25, Positive cache size: 22, Positive conditional cache size: 0, Positive unconditional cache size: 22, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 22 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-22-3-5-5-3-4-3-6-3-6-3-6-2-5-2-1 context. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 22 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-22-3-5-5-3-4-3-6-3-6-3-6-2-5-2-1 context. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 22 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-22-3-5-5-3-4-3-6-3-6-3-6-2-5-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 178 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 795.2s, OverallIterations: 21, TraceHistogramMax: 2, PathProgramHistogramMax: 15, EmptinessCheckTime: 0.0s, AutomataDifference: 188.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 284 mSolverCounterUnknown, 2245 SdHoareTripleChecker+Valid, 40.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2245 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 39.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 736 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 613 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12473 IncrementalHoareTripleChecker+Invalid, 14106 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 613 mSolverCounterUnsat, 0 mSDtfsCounter, 12473 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 919 GetRequests, 248 SyntacticMatches, 15 SemanticMatches, 656 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 8034 ImplicationChecksByTransitivity, 158.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11290occurred in iteration=15, InterpolantAutomatonStates: 430, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 580.4s InterpolantComputationTime, 606 NumberOfCodeBlocks, 606 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 799 ConstructedInterpolants, 77 QuantifiedInterpolants, 24602 SizeOfPredicates, 293 NumberOfNonLiveVariables, 2973 ConjunctsInSsa, 627 ConjunctsInUnsatCore, 44 InterpolantComputations, 8 PerfectInterpolantSequences, 75/210 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