/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 19:27:56,307 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 19:27:56,309 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 19:27:56,354 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 19:27:56,356 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 19:27:56,358 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 19:27:56,361 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 19:27:56,364 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 19:27:56,368 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 19:27:56,372 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 19:27:56,373 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 19:27:56,374 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 19:27:56,375 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 19:27:56,377 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 19:27:56,378 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 19:27:56,381 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 19:27:56,381 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 19:27:56,382 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 19:27:56,385 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 19:27:56,389 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 19:27:56,390 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 19:27:56,392 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 19:27:56,393 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 19:27:56,394 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 19:27:56,401 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 19:27:56,401 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 19:27:56,401 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 19:27:56,403 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 19:27:56,403 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 19:27:56,404 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 19:27:56,404 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 19:27:56,407 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 19:27:56,408 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 19:27:56,408 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 19:27:56,409 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 19:27:56,409 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 19:27:56,410 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 19:27:56,410 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 19:27:56,410 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 19:27:56,411 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 19:27:56,411 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 19:27:56,415 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-05 19:27:56,448 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 19:27:56,449 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 19:27:56,450 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 19:27:56,450 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 19:27:56,451 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 19:27:56,451 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 19:27:56,451 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 19:27:56,452 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 19:27:56,452 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 19:27:56,452 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 19:27:56,452 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 19:27:56,453 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 19:27:56,453 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 19:27:56,453 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 19:27:56,453 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 19:27:56,453 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 19:27:56,453 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 19:27:56,453 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 19:27:56,454 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 19:27:56,454 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 19:27:56,454 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 19:27:56,454 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 19:27:56,454 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 19:27:56,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 19:27:56,454 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 19:27:56,455 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 19:27:56,455 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 19:27:56,455 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 19:27:56,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 19:27:56,455 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-05 19:27:56,455 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 19:27:56,455 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 19:27:56,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 19:27:56,801 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 19:27:56,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 19:27:56,804 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 19:27:56,805 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 19:27:56,806 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c [2022-12-05 19:27:57,827 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 19:27:58,044 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 19:27:58,044 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c [2022-12-05 19:27:58,049 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1be6597c8/3fb4cfdc488c4b0dac5a3b2b19c8773c/FLAG2802f085a [2022-12-05 19:27:58,058 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1be6597c8/3fb4cfdc488c4b0dac5a3b2b19c8773c [2022-12-05 19:27:58,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 19:27:58,061 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 19:27:58,062 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 19:27:58,062 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 19:27:58,064 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 19:27:58,065 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 07:27:58" (1/1) ... [2022-12-05 19:27:58,066 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@670fac0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:27:58, skipping insertion in model container [2022-12-05 19:27:58,066 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 07:27:58" (1/1) ... [2022-12-05 19:27:58,071 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 19:27:58,087 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 19:27:58,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 19:27:58,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 19:27:58,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 19:27:58,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 19:27:58,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 19:27:58,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 19:27:58,214 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c[2553,2566] [2022-12-05 19:27:58,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 19:27:58,244 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 19:27:58,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 19:27:58,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 19:27:58,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 19:27:58,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 19:27:58,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 19:27:58,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 19:27:58,276 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c[2553,2566] [2022-12-05 19:27:58,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 19:27:58,292 INFO L208 MainTranslator]: Completed translation [2022-12-05 19:27:58,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:27:58 WrapperNode [2022-12-05 19:27:58,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 19:27:58,295 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 19:27:58,295 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 19:27:58,295 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 19:27:58,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:27:58" (1/1) ... [2022-12-05 19:27:58,318 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:27:58" (1/1) ... [2022-12-05 19:27:58,346 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 101 [2022-12-05 19:27:58,346 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 19:27:58,348 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 19:27:58,348 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 19:27:58,348 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 19:27:58,355 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:27:58" (1/1) ... [2022-12-05 19:27:58,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:27:58" (1/1) ... [2022-12-05 19:27:58,369 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:27:58" (1/1) ... [2022-12-05 19:27:58,370 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:27:58" (1/1) ... [2022-12-05 19:27:58,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:27:58" (1/1) ... [2022-12-05 19:27:58,377 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:27:58" (1/1) ... [2022-12-05 19:27:58,387 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:27:58" (1/1) ... [2022-12-05 19:27:58,388 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:27:58" (1/1) ... [2022-12-05 19:27:58,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 19:27:58,391 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 19:27:58,391 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 19:27:58,391 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 19:27:58,392 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:27:58" (1/1) ... [2022-12-05 19:27:58,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 19:27:58,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:27:58,423 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 19:27:58,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 19:27:58,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 19:27:58,459 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-05 19:27:58,459 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-05 19:27:58,460 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-05 19:27:58,460 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-05 19:27:58,460 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-05 19:27:58,460 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-05 19:27:58,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 19:27:58,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 19:27:58,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 19:27:58,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 19:27:58,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 19:27:58,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-05 19:27:58,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 19:27:58,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 19:27:58,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-05 19:27:58,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 19:27:58,462 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 19:27:58,542 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 19:27:58,544 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 19:27:58,785 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 19:27:58,850 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 19:27:58,851 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-05 19:27:58,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 07:27:58 BoogieIcfgContainer [2022-12-05 19:27:58,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 19:27:58,854 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 19:27:58,854 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 19:27:58,857 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 19:27:58,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 07:27:58" (1/3) ... [2022-12-05 19:27:58,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ae9b34c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 07:27:58, skipping insertion in model container [2022-12-05 19:27:58,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:27:58" (2/3) ... [2022-12-05 19:27:58,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ae9b34c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 07:27:58, skipping insertion in model container [2022-12-05 19:27:58,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 07:27:58" (3/3) ... [2022-12-05 19:27:58,859 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array.wvr.c [2022-12-05 19:27:58,876 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 19:27:58,876 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-05 19:27:58,876 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 19:27:58,973 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-05 19:27:59,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 141 transitions, 306 flow [2022-12-05 19:27:59,108 INFO L130 PetriNetUnfolder]: 12/138 cut-off events. [2022-12-05 19:27:59,108 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 19:27:59,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 12/138 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 92 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-12-05 19:27:59,114 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 141 transitions, 306 flow [2022-12-05 19:27:59,122 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 128 transitions, 274 flow [2022-12-05 19:27:59,139 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 19:27:59,146 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;@433aaa77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 19:27:59,147 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-05 19:27:59,196 INFO L130 PetriNetUnfolder]: 12/127 cut-off events. [2022-12-05 19:27:59,196 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 19:27:59,196 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:27:59,197 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:27:59,199 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:27:59,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:27:59,204 INFO L85 PathProgramCache]: Analyzing trace with hash 633810826, now seen corresponding path program 1 times [2022-12-05 19:27:59,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:27:59,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470794528] [2022-12-05 19:27:59,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:27:59,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:27:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:27:59,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:27:59,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:27:59,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470794528] [2022-12-05 19:27:59,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470794528] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:27:59,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:27:59,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 19:27:59,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421099184] [2022-12-05 19:27:59,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:27:59,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 19:27:59,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:27:59,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 19:27:59,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 19:27:59,920 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 141 [2022-12-05 19:27:59,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 128 transitions, 274 flow. Second operand has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:27:59,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:27:59,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 141 [2022-12-05 19:27:59,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:28:00,129 INFO L130 PetriNetUnfolder]: 54/337 cut-off events. [2022-12-05 19:28:00,129 INFO L131 PetriNetUnfolder]: For 71/72 co-relation queries the response was YES. [2022-12-05 19:28:00,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 337 events. 54/337 cut-off events. For 71/72 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1166 event pairs, 6 based on Foata normal form. 62/359 useless extension candidates. Maximal degree in co-relation 275. Up to 52 conditions per place. [2022-12-05 19:28:00,134 INFO L137 encePairwiseOnDemand]: 121/141 looper letters, 39 selfloop transitions, 6 changer transitions 10/144 dead transitions. [2022-12-05 19:28:00,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 144 transitions, 443 flow [2022-12-05 19:28:00,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 19:28:00,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 19:28:00,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 981 transitions. [2022-12-05 19:28:00,156 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7730496453900709 [2022-12-05 19:28:00,158 INFO L175 Difference]: Start difference. First operand has 126 places, 128 transitions, 274 flow. Second operand 9 states and 981 transitions. [2022-12-05 19:28:00,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 144 transitions, 443 flow [2022-12-05 19:28:00,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 144 transitions, 413 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-05 19:28:00,167 INFO L231 Difference]: Finished difference. Result has 131 places, 120 transitions, 274 flow [2022-12-05 19:28:00,169 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=274, PETRI_PLACES=131, PETRI_TRANSITIONS=120} [2022-12-05 19:28:00,174 INFO L294 CegarLoopForPetriNet]: 126 programPoint places, 5 predicate places. [2022-12-05 19:28:00,174 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 120 transitions, 274 flow [2022-12-05 19:28:00,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:28:00,175 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:28:00,175 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:28:00,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 19:28:00,176 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:28:00,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:28:00,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1466465809, now seen corresponding path program 1 times [2022-12-05 19:28:00,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:28:00,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228078775] [2022-12-05 19:28:00,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:28:00,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:28:00,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:28:00,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:28:00,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:28:00,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228078775] [2022-12-05 19:28:00,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228078775] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:28:00,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:28:00,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 19:28:00,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747907825] [2022-12-05 19:28:00,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:28:00,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 19:28:00,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:28:00,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 19:28:00,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-05 19:28:00,458 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 141 [2022-12-05 19:28:00,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 120 transitions, 274 flow. Second operand has 7 states, 7 states have (on average 104.42857142857143) internal successors, (731), 7 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:28:00,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:28:00,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 141 [2022-12-05 19:28:00,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:28:00,780 INFO L130 PetriNetUnfolder]: 378/1307 cut-off events. [2022-12-05 19:28:00,780 INFO L131 PetriNetUnfolder]: For 229/266 co-relation queries the response was YES. [2022-12-05 19:28:00,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2237 conditions, 1307 events. 378/1307 cut-off events. For 229/266 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 8744 event pairs, 178 based on Foata normal form. 0/1108 useless extension candidates. Maximal degree in co-relation 2219. Up to 429 conditions per place. [2022-12-05 19:28:00,793 INFO L137 encePairwiseOnDemand]: 132/141 looper letters, 55 selfloop transitions, 8 changer transitions 0/148 dead transitions. [2022-12-05 19:28:00,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 148 transitions, 484 flow [2022-12-05 19:28:00,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 19:28:00,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 19:28:00,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 864 transitions. [2022-12-05 19:28:00,796 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7659574468085106 [2022-12-05 19:28:00,796 INFO L175 Difference]: Start difference. First operand has 131 places, 120 transitions, 274 flow. Second operand 8 states and 864 transitions. [2022-12-05 19:28:00,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 148 transitions, 484 flow [2022-12-05 19:28:00,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 148 transitions, 480 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-05 19:28:00,802 INFO L231 Difference]: Finished difference. Result has 130 places, 123 transitions, 306 flow [2022-12-05 19:28:00,802 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=306, PETRI_PLACES=130, PETRI_TRANSITIONS=123} [2022-12-05 19:28:00,803 INFO L294 CegarLoopForPetriNet]: 126 programPoint places, 4 predicate places. [2022-12-05 19:28:00,803 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 123 transitions, 306 flow [2022-12-05 19:28:00,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 104.42857142857143) internal successors, (731), 7 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:28:00,803 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:28:00,804 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:28:00,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 19:28:00,804 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:28:00,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:28:00,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1645704129, now seen corresponding path program 1 times [2022-12-05 19:28:00,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:28:00,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708957242] [2022-12-05 19:28:00,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:28:00,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:28:00,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:28:01,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:28:01,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:28:01,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708957242] [2022-12-05 19:28:01,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708957242] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:28:01,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:28:01,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-05 19:28:01,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122987346] [2022-12-05 19:28:01,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:28:01,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-05 19:28:01,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:28:01,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-05 19:28:01,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-12-05 19:28:01,257 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 141 [2022-12-05 19:28:01,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 123 transitions, 306 flow. Second operand has 10 states, 10 states have (on average 83.1) internal successors, (831), 10 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:28:01,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:28:01,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 141 [2022-12-05 19:28:01,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:28:01,563 INFO L130 PetriNetUnfolder]: 770/1624 cut-off events. [2022-12-05 19:28:01,563 INFO L131 PetriNetUnfolder]: For 331/331 co-relation queries the response was YES. [2022-12-05 19:28:01,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3253 conditions, 1624 events. 770/1624 cut-off events. For 331/331 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 10613 event pairs, 569 based on Foata normal form. 1/1424 useless extension candidates. Maximal degree in co-relation 3155. Up to 1139 conditions per place. [2022-12-05 19:28:01,577 INFO L137 encePairwiseOnDemand]: 131/141 looper letters, 51 selfloop transitions, 6 changer transitions 4/128 dead transitions. [2022-12-05 19:28:01,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 128 transitions, 434 flow [2022-12-05 19:28:01,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 19:28:01,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 19:28:01,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 690 transitions. [2022-12-05 19:28:01,579 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6117021276595744 [2022-12-05 19:28:01,579 INFO L175 Difference]: Start difference. First operand has 130 places, 123 transitions, 306 flow. Second operand 8 states and 690 transitions. [2022-12-05 19:28:01,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 128 transitions, 434 flow [2022-12-05 19:28:01,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 128 transitions, 419 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-12-05 19:28:01,583 INFO L231 Difference]: Finished difference. Result has 133 places, 121 transitions, 300 flow [2022-12-05 19:28:01,583 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=300, PETRI_PLACES=133, PETRI_TRANSITIONS=121} [2022-12-05 19:28:01,584 INFO L294 CegarLoopForPetriNet]: 126 programPoint places, 7 predicate places. [2022-12-05 19:28:01,584 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 121 transitions, 300 flow [2022-12-05 19:28:01,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 83.1) internal successors, (831), 10 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:28:01,585 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:28:01,585 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:28:01,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 19:28:01,586 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:28:01,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:28:01,586 INFO L85 PathProgramCache]: Analyzing trace with hash -209199557, now seen corresponding path program 1 times [2022-12-05 19:28:01,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:28:01,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12751635] [2022-12-05 19:28:01,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:28:01,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:28:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:28:01,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:28:01,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:28:01,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12751635] [2022-12-05 19:28:01,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12751635] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:28:01,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122192909] [2022-12-05 19:28:01,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:28:01,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:28:01,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:28:01,787 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 19:28:01,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-05 19:28:01,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:28:01,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-05 19:28:01,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:28:02,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:28:02,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:28:02,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:28:02,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122192909] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-05 19:28:02,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-05 19:28:02,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-12-05 19:28:02,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471575952] [2022-12-05 19:28:02,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:28:02,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-05 19:28:02,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:28:02,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-05 19:28:02,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-12-05 19:28:02,383 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 141 [2022-12-05 19:28:02,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 121 transitions, 300 flow. Second operand has 9 states, 9 states have (on average 97.33333333333333) internal successors, (876), 9 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:28:02,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:28:02,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 141 [2022-12-05 19:28:02,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:28:02,902 INFO L130 PetriNetUnfolder]: 1451/2780 cut-off events. [2022-12-05 19:28:02,902 INFO L131 PetriNetUnfolder]: For 487/487 co-relation queries the response was YES. [2022-12-05 19:28:02,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5555 conditions, 2780 events. 1451/2780 cut-off events. For 487/487 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 19227 event pairs, 403 based on Foata normal form. 0/2297 useless extension candidates. Maximal degree in co-relation 5474. Up to 683 conditions per place. [2022-12-05 19:28:02,923 INFO L137 encePairwiseOnDemand]: 130/141 looper letters, 95 selfloop transitions, 17 changer transitions 0/190 dead transitions. [2022-12-05 19:28:02,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 190 transitions, 727 flow [2022-12-05 19:28:02,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-05 19:28:02,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-05 19:28:02,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1129 transitions. [2022-12-05 19:28:02,927 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7279174725983236 [2022-12-05 19:28:02,927 INFO L175 Difference]: Start difference. First operand has 133 places, 121 transitions, 300 flow. Second operand 11 states and 1129 transitions. [2022-12-05 19:28:02,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 190 transitions, 727 flow [2022-12-05 19:28:02,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 190 transitions, 707 flow, removed 3 selfloop flow, removed 8 redundant places. [2022-12-05 19:28:02,931 INFO L231 Difference]: Finished difference. Result has 137 places, 133 transitions, 374 flow [2022-12-05 19:28:02,931 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=374, PETRI_PLACES=137, PETRI_TRANSITIONS=133} [2022-12-05 19:28:02,932 INFO L294 CegarLoopForPetriNet]: 126 programPoint places, 11 predicate places. [2022-12-05 19:28:02,932 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 133 transitions, 374 flow [2022-12-05 19:28:02,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 97.33333333333333) internal successors, (876), 9 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:28:02,933 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:28:02,933 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:28:02,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-05 19:28:03,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:28:03,142 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:28:03,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:28:03,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1449173463, now seen corresponding path program 2 times [2022-12-05 19:28:03,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:28:03,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249500928] [2022-12-05 19:28:03,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:28:03,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:28:03,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:28:03,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:28:03,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:28:03,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249500928] [2022-12-05 19:28:03,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249500928] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:28:03,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242920637] [2022-12-05 19:28:03,352 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 19:28:03,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:28:03,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:28:03,354 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 19:28:03,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-05 19:28:03,442 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-05 19:28:03,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 19:28:03,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-05 19:28:03,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:28:03,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-05 19:28:03,665 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 19:28:03,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242920637] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:28:03,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 19:28:03,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-12-05 19:28:03,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027309107] [2022-12-05 19:28:03,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:28:03,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 19:28:03,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:28:03,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 19:28:03,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-12-05 19:28:03,668 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 141 [2022-12-05 19:28:03,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 133 transitions, 374 flow. Second operand has 6 states, 6 states have (on average 94.5) internal successors, (567), 6 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:28:03,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:28:03,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 141 [2022-12-05 19:28:03,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:28:04,037 INFO L130 PetriNetUnfolder]: 1015/2068 cut-off events. [2022-12-05 19:28:04,038 INFO L131 PetriNetUnfolder]: For 1107/1144 co-relation queries the response was YES. [2022-12-05 19:28:04,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4966 conditions, 2068 events. 1015/2068 cut-off events. For 1107/1144 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 13779 event pairs, 278 based on Foata normal form. 97/2001 useless extension candidates. Maximal degree in co-relation 4885. Up to 910 conditions per place. [2022-12-05 19:28:04,056 INFO L137 encePairwiseOnDemand]: 132/141 looper letters, 53 selfloop transitions, 13 changer transitions 0/148 dead transitions. [2022-12-05 19:28:04,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 148 transitions, 568 flow [2022-12-05 19:28:04,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 19:28:04,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 19:28:04,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 761 transitions. [2022-12-05 19:28:04,059 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.674645390070922 [2022-12-05 19:28:04,060 INFO L175 Difference]: Start difference. First operand has 137 places, 133 transitions, 374 flow. Second operand 8 states and 761 transitions. [2022-12-05 19:28:04,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 148 transitions, 568 flow [2022-12-05 19:28:04,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 148 transitions, 561 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-05 19:28:04,068 INFO L231 Difference]: Finished difference. Result has 143 places, 136 transitions, 435 flow [2022-12-05 19:28:04,068 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=435, PETRI_PLACES=143, PETRI_TRANSITIONS=136} [2022-12-05 19:28:04,069 INFO L294 CegarLoopForPetriNet]: 126 programPoint places, 17 predicate places. [2022-12-05 19:28:04,069 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 136 transitions, 435 flow [2022-12-05 19:28:04,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.5) internal successors, (567), 6 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:28:04,070 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:28:04,070 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:28:04,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-05 19:28:04,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:28:04,276 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:28:04,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:28:04,277 INFO L85 PathProgramCache]: Analyzing trace with hash 907575857, now seen corresponding path program 1 times [2022-12-05 19:28:04,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:28:04,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259427295] [2022-12-05 19:28:04,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:28:04,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:28:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:28:04,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:28:04,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:28:04,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259427295] [2022-12-05 19:28:04,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259427295] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:28:04,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138823136] [2022-12-05 19:28:04,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:28:04,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:28:04,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:28:04,409 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 19:28:04,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-05 19:28:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:28:04,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-05 19:28:04,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:28:04,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:28:04,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:28:04,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:28:04,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138823136] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-05 19:28:04,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-05 19:28:04,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-12-05 19:28:04,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006661889] [2022-12-05 19:28:04,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:28:04,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 19:28:04,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:28:04,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 19:28:04,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-12-05 19:28:04,728 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 141 [2022-12-05 19:28:04,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 136 transitions, 435 flow. Second operand has 7 states, 7 states have (on average 104.71428571428571) internal successors, (733), 7 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:28:04,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:28:04,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 141 [2022-12-05 19:28:04,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:28:04,916 INFO L130 PetriNetUnfolder]: 430/1130 cut-off events. [2022-12-05 19:28:04,916 INFO L131 PetriNetUnfolder]: For 1401/1560 co-relation queries the response was YES. [2022-12-05 19:28:04,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2791 conditions, 1130 events. 430/1130 cut-off events. For 1401/1560 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6843 event pairs, 109 based on Foata normal form. 85/1148 useless extension candidates. Maximal degree in co-relation 2709. Up to 369 conditions per place. [2022-12-05 19:28:04,927 INFO L137 encePairwiseOnDemand]: 133/141 looper letters, 51 selfloop transitions, 7 changer transitions 0/151 dead transitions. [2022-12-05 19:28:04,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 151 transitions, 637 flow [2022-12-05 19:28:04,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 19:28:04,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 19:28:04,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 747 transitions. [2022-12-05 19:28:04,929 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.756838905775076 [2022-12-05 19:28:04,929 INFO L175 Difference]: Start difference. First operand has 143 places, 136 transitions, 435 flow. Second operand 7 states and 747 transitions. [2022-12-05 19:28:04,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 151 transitions, 637 flow [2022-12-05 19:28:04,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 151 transitions, 615 flow, removed 2 selfloop flow, removed 5 redundant places. [2022-12-05 19:28:04,936 INFO L231 Difference]: Finished difference. Result has 146 places, 137 transitions, 445 flow [2022-12-05 19:28:04,936 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=445, PETRI_PLACES=146, PETRI_TRANSITIONS=137} [2022-12-05 19:28:04,939 INFO L294 CegarLoopForPetriNet]: 126 programPoint places, 20 predicate places. [2022-12-05 19:28:04,939 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 137 transitions, 445 flow [2022-12-05 19:28:04,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 104.71428571428571) internal successors, (733), 7 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:28:04,939 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:28:04,940 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:28:04,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-05 19:28:05,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:28:05,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 (and 1 more)] === [2022-12-05 19:28:05,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:28:05,146 INFO L85 PathProgramCache]: Analyzing trace with hash -760653164, now seen corresponding path program 1 times [2022-12-05 19:28:05,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:28:05,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918033907] [2022-12-05 19:28:05,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:28:05,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:28:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:28:06,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:28:06,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:28:06,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918033907] [2022-12-05 19:28:06,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918033907] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:28:06,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101903629] [2022-12-05 19:28:06,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:28:06,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:28:06,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:28:06,384 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 19:28:06,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-05 19:28:06,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:28:06,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-05 19:28:06,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:28:07,310 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-12-05 19:28:07,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2022-12-05 19:28:07,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:28:07,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:28:07,629 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:28:07,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 51 [2022-12-05 19:28:08,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:28:08,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101903629] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 19:28:08,305 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 19:28:08,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 19, 18] total 52 [2022-12-05 19:28:08,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481426393] [2022-12-05 19:28:08,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 19:28:08,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-12-05 19:28:08,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:28:08,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-12-05 19:28:08,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=2248, Unknown=0, NotChecked=0, Total=2652 [2022-12-05 19:28:08,310 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 141 [2022-12-05 19:28:08,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 137 transitions, 445 flow. Second operand has 52 states, 52 states have (on average 59.51923076923077) internal successors, (3095), 52 states have internal predecessors, (3095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:28:08,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:28:08,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 141 [2022-12-05 19:28:08,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:28:11,548 INFO L130 PetriNetUnfolder]: 4847/8252 cut-off events. [2022-12-05 19:28:11,548 INFO L131 PetriNetUnfolder]: For 9071/9391 co-relation queries the response was YES. [2022-12-05 19:28:11,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23038 conditions, 8252 events. 4847/8252 cut-off events. For 9071/9391 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 57731 event pairs, 1482 based on Foata normal form. 185/8271 useless extension candidates. Maximal degree in co-relation 21814. Up to 3184 conditions per place. [2022-12-05 19:28:11,634 INFO L137 encePairwiseOnDemand]: 106/141 looper letters, 210 selfloop transitions, 82 changer transitions 4/343 dead transitions. [2022-12-05 19:28:11,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 343 transitions, 1970 flow [2022-12-05 19:28:11,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-05 19:28:11,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-12-05 19:28:11,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 2312 transitions. [2022-12-05 19:28:11,644 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4431665708261453 [2022-12-05 19:28:11,644 INFO L175 Difference]: Start difference. First operand has 146 places, 137 transitions, 445 flow. Second operand 37 states and 2312 transitions. [2022-12-05 19:28:11,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 343 transitions, 1970 flow [2022-12-05 19:28:11,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 343 transitions, 1918 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-05 19:28:11,688 INFO L231 Difference]: Finished difference. Result has 196 places, 205 transitions, 1132 flow [2022-12-05 19:28:11,689 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=1132, PETRI_PLACES=196, PETRI_TRANSITIONS=205} [2022-12-05 19:28:11,689 INFO L294 CegarLoopForPetriNet]: 126 programPoint places, 70 predicate places. [2022-12-05 19:28:11,689 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 205 transitions, 1132 flow [2022-12-05 19:28:11,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 59.51923076923077) internal successors, (3095), 52 states have internal predecessors, (3095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:28:11,691 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:28:11,691 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:28:11,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-05 19:28:11,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:28:11,892 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:28:11,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:28:11,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1511877614, now seen corresponding path program 2 times [2022-12-05 19:28:11,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:28:11,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42035348] [2022-12-05 19:28:11,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:28:11,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:28:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:28:13,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:28:13,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:28:13,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42035348] [2022-12-05 19:28:13,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42035348] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:28:13,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171508205] [2022-12-05 19:28:13,319 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 19:28:13,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:28:13,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:28:13,321 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 19:28:13,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-05 19:28:13,415 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 19:28:13,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 19:28:13,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-05 19:28:13,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:28:14,034 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 [2022-12-05 19:28:14,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-05 19:28:14,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 19:28:14,658 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 47 treesize of output 45 [2022-12-05 19:28:15,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 19:28:15,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-12-05 19:28:15,274 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:28:15,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 43 [2022-12-05 19:28:15,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:28:15,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:28:27,452 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:28:27,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 72 [2022-12-05 19:28:27,471 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:28:27,472 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 1040 treesize of output 934 [2022-12-05 19:28:27,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 904 treesize of output 760 [2022-12-05 19:28:27,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 760 treesize of output 688 [2022-12-05 19:28:27,518 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:28:27,518 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 708 treesize of output 648 [2022-12-05 19:28:35,583 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:28:35,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 43 [2022-12-05 19:28:35,587 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-05 19:28:35,587 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-05 19:28:35,594 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-05 19:28:35,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 43 [2022-12-05 19:28:35,604 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-05 19:28:35,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2022-12-05 19:28:35,621 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-05 19:28:35,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 1 [2022-12-05 19:28:35,629 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-05 19:28:35,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 1 [2022-12-05 19:28:36,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:28:36,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171508205] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 19:28:36,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 19:28:36,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 32, 31] total 79 [2022-12-05 19:28:36,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770642724] [2022-12-05 19:28:36,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 19:28:36,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-12-05 19:28:36,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:28:36,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-12-05 19:28:36,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=662, Invalid=5469, Unknown=31, NotChecked=0, Total=6162 [2022-12-05 19:28:36,378 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 141 [2022-12-05 19:28:36,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 205 transitions, 1132 flow. Second operand has 79 states, 79 states have (on average 45.49367088607595) internal successors, (3594), 79 states have internal predecessors, (3594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:28:36,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:28:36,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 141 [2022-12-05 19:28:36,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:28:53,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 19:28:58,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 19:29:00,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 19:29:02,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 19:29:04,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 19:29:06,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 19:29:12,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 19:29:14,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 19:29:16,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 19:29:18,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 19:29:28,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 19:29:32,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 19:29:47,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 19:29:49,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 19:29:54,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 19:30:07,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 19:30:16,199 WARN L233 SmtUtils]: Spent 8.26s on a formula simplification. DAG size of input: 65 DAG size of output: 64 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 19:30:24,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 19:30:26,684 INFO L130 PetriNetUnfolder]: 14653/23930 cut-off events. [2022-12-05 19:30:26,684 INFO L131 PetriNetUnfolder]: For 41859/41859 co-relation queries the response was YES. [2022-12-05 19:30:26,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76505 conditions, 23930 events. 14653/23930 cut-off events. For 41859/41859 co-relation queries the response was YES. Maximal size of possible extension queue 1304. Compared 189388 event pairs, 1034 based on Foata normal form. 2/23783 useless extension candidates. Maximal degree in co-relation 76442. Up to 7152 conditions per place. [2022-12-05 19:30:27,041 INFO L137 encePairwiseOnDemand]: 98/141 looper letters, 801 selfloop transitions, 650 changer transitions 16/1505 dead transitions. [2022-12-05 19:30:27,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 1505 transitions, 10856 flow [2022-12-05 19:30:27,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2022-12-05 19:30:27,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2022-12-05 19:30:27,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 6362 transitions. [2022-12-05 19:30:27,058 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3698407161957912 [2022-12-05 19:30:27,058 INFO L175 Difference]: Start difference. First operand has 196 places, 205 transitions, 1132 flow. Second operand 122 states and 6362 transitions. [2022-12-05 19:30:27,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 1505 transitions, 10856 flow [2022-12-05 19:30:27,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 1505 transitions, 10253 flow, removed 257 selfloop flow, removed 16 redundant places. [2022-12-05 19:30:27,424 INFO L231 Difference]: Finished difference. Result has 373 places, 848 transitions, 7588 flow [2022-12-05 19:30:27,425 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=1014, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=122, PETRI_FLOW=7588, PETRI_PLACES=373, PETRI_TRANSITIONS=848} [2022-12-05 19:30:27,428 INFO L294 CegarLoopForPetriNet]: 126 programPoint places, 247 predicate places. [2022-12-05 19:30:27,428 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 848 transitions, 7588 flow [2022-12-05 19:30:27,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 45.49367088607595) internal successors, (3594), 79 states have internal predecessors, (3594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:30:27,430 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:30:27,430 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:30:27,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-05 19:30:27,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:30:27,636 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:30:27,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:30:27,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1796122836, now seen corresponding path program 3 times [2022-12-05 19:30:27,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:30:27,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232133891] [2022-12-05 19:30:27,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:30:27,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:30:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:30:29,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:30:29,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:30:29,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232133891] [2022-12-05 19:30:29,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232133891] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:30:29,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143270328] [2022-12-05 19:30:29,490 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-05 19:30:29,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:30:29,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:30:29,496 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 19:30:29,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-05 19:30:29,580 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-05 19:30:29,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 19:30:29,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-05 19:30:29,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:30:30,261 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:30:30,262 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 64 treesize of output 44 [2022-12-05 19:30:30,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:30:30,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:30:30,975 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:30:30,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 51 [2022-12-05 19:30:31,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:30:31,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143270328] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 19:30:31,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 19:30:31,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 21, 15] total 50 [2022-12-05 19:30:31,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270272302] [2022-12-05 19:30:31,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 19:30:31,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-12-05 19:30:31,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:30:31,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-12-05 19:30:31,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=2086, Unknown=0, NotChecked=0, Total=2450 [2022-12-05 19:30:31,389 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 141 [2022-12-05 19:30:31,392 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 848 transitions, 7588 flow. Second operand has 50 states, 50 states have (on average 47.76) internal successors, (2388), 50 states have internal predecessors, (2388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:30:31,392 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:30:31,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 141 [2022-12-05 19:30:31,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:30:40,856 INFO L130 PetriNetUnfolder]: 15330/25801 cut-off events. [2022-12-05 19:30:40,857 INFO L131 PetriNetUnfolder]: For 298807/299115 co-relation queries the response was YES. [2022-12-05 19:30:41,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132803 conditions, 25801 events. 15330/25801 cut-off events. For 298807/299115 co-relation queries the response was YES. Maximal size of possible extension queue 1438. Compared 215475 event pairs, 1866 based on Foata normal form. 39/25605 useless extension candidates. Maximal degree in co-relation 132657. Up to 14400 conditions per place. [2022-12-05 19:30:41,289 INFO L137 encePairwiseOnDemand]: 106/141 looper letters, 766 selfloop transitions, 478 changer transitions 21/1313 dead transitions. [2022-12-05 19:30:41,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 1313 transitions, 14069 flow [2022-12-05 19:30:41,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-12-05 19:30:41,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2022-12-05 19:30:41,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 2610 transitions. [2022-12-05 19:30:41,294 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36295369211514394 [2022-12-05 19:30:41,294 INFO L175 Difference]: Start difference. First operand has 373 places, 848 transitions, 7588 flow. Second operand 51 states and 2610 transitions. [2022-12-05 19:30:41,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 419 places, 1313 transitions, 14069 flow [2022-12-05 19:30:43,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 1313 transitions, 13322 flow, removed 355 selfloop flow, removed 19 redundant places. [2022-12-05 19:30:43,722 INFO L231 Difference]: Finished difference. Result has 426 places, 1071 transitions, 11059 flow [2022-12-05 19:30:43,724 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=6993, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=848, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=282, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=477, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=11059, PETRI_PLACES=426, PETRI_TRANSITIONS=1071} [2022-12-05 19:30:43,724 INFO L294 CegarLoopForPetriNet]: 126 programPoint places, 300 predicate places. [2022-12-05 19:30:43,724 INFO L495 AbstractCegarLoop]: Abstraction has has 426 places, 1071 transitions, 11059 flow [2022-12-05 19:30:43,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 47.76) internal successors, (2388), 50 states have internal predecessors, (2388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:30:43,726 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:30:43,726 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:30:43,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-05 19:30:43,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:30:43,933 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:30:43,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:30:43,934 INFO L85 PathProgramCache]: Analyzing trace with hash -782127428, now seen corresponding path program 4 times [2022-12-05 19:30:43,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:30:43,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368716198] [2022-12-05 19:30:43,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:30:43,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:30:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:30:45,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:30:45,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:30:45,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368716198] [2022-12-05 19:30:45,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368716198] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:30:45,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138220496] [2022-12-05 19:30:45,217 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-05 19:30:45,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:30:45,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:30:45,219 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 19:30:45,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-05 19:30:45,315 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-05 19:30:45,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 19:30:45,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-05 19:30:45,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:30:46,107 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:30:46,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 43 [2022-12-05 19:30:46,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:30:46,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:30:47,030 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:30:47,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 51 [2022-12-05 19:30:47,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:30:47,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138220496] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 19:30:47,963 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 19:30:47,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 22, 21] total 53 [2022-12-05 19:30:47,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512704409] [2022-12-05 19:30:47,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 19:30:47,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-12-05 19:30:47,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:30:47,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-12-05 19:30:47,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=425, Invalid=2331, Unknown=0, NotChecked=0, Total=2756 [2022-12-05 19:30:47,969 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 141 [2022-12-05 19:30:47,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 1071 transitions, 11059 flow. Second operand has 53 states, 53 states have (on average 56.20754716981132) internal successors, (2979), 53 states have internal predecessors, (2979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:30:47,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:30:47,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 141 [2022-12-05 19:30:47,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:31:03,944 INFO L130 PetriNetUnfolder]: 21519/37196 cut-off events. [2022-12-05 19:31:03,945 INFO L131 PetriNetUnfolder]: For 480293/480641 co-relation queries the response was YES. [2022-12-05 19:31:04,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202949 conditions, 37196 events. 21519/37196 cut-off events. For 480293/480641 co-relation queries the response was YES. Maximal size of possible extension queue 2122. Compared 336261 event pairs, 2874 based on Foata normal form. 69/37011 useless extension candidates. Maximal degree in co-relation 202781. Up to 14717 conditions per place. [2022-12-05 19:31:04,798 INFO L137 encePairwiseOnDemand]: 104/141 looper letters, 1092 selfloop transitions, 1068 changer transitions 25/2235 dead transitions. [2022-12-05 19:31:04,798 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 487 places, 2235 transitions, 27341 flow [2022-12-05 19:31:04,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-12-05 19:31:04,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2022-12-05 19:31:04,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 4123 transitions. [2022-12-05 19:31:04,805 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4364348470413888 [2022-12-05 19:31:04,805 INFO L175 Difference]: Start difference. First operand has 426 places, 1071 transitions, 11059 flow. Second operand 67 states and 4123 transitions. [2022-12-05 19:31:04,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 487 places, 2235 transitions, 27341 flow [2022-12-05 19:31:11,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 465 places, 2235 transitions, 26748 flow, removed 256 selfloop flow, removed 22 redundant places. [2022-12-05 19:31:11,319 INFO L231 Difference]: Finished difference. Result has 501 places, 1741 transitions, 22768 flow [2022-12-05 19:31:11,320 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=10761, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1071, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=460, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=67, PETRI_FLOW=22768, PETRI_PLACES=501, PETRI_TRANSITIONS=1741} [2022-12-05 19:31:11,320 INFO L294 CegarLoopForPetriNet]: 126 programPoint places, 375 predicate places. [2022-12-05 19:31:11,320 INFO L495 AbstractCegarLoop]: Abstraction has has 501 places, 1741 transitions, 22768 flow [2022-12-05 19:31:11,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 56.20754716981132) internal successors, (2979), 53 states have internal predecessors, (2979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:31:11,321 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:31:11,322 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:31:11,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-05 19:31:11,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:31:11,522 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:31:11,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:31:11,523 INFO L85 PathProgramCache]: Analyzing trace with hash 657249584, now seen corresponding path program 5 times [2022-12-05 19:31:11,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:31:11,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519358960] [2022-12-05 19:31:11,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:31:11,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:31:11,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:31:12,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:31:12,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:31:12,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519358960] [2022-12-05 19:31:12,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519358960] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:31:12,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274519656] [2022-12-05 19:31:12,943 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-05 19:31:12,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:31:12,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:31:12,948 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 19:31:12,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-05 19:31:13,052 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 19:31:13,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 19:31:13,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-05 19:31:13,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:31:13,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 19:31:13,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-12-05 19:31:14,194 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:31:14,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 43 [2022-12-05 19:31:14,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:31:14,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:31:15,593 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:31:15,593 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 159 treesize of output 147 [2022-12-05 19:31:15,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 76 [2022-12-05 19:31:15,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 70 [2022-12-05 19:31:16,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:31:16,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274519656] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 19:31:16,705 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 19:31:16,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 23, 22] total 57 [2022-12-05 19:31:16,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877700329] [2022-12-05 19:31:16,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 19:31:16,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-12-05 19:31:16,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:31:16,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-12-05 19:31:16,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=2835, Unknown=11, NotChecked=0, Total=3192 [2022-12-05 19:31:16,709 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 141 [2022-12-05 19:31:16,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 501 places, 1741 transitions, 22768 flow. Second operand has 57 states, 57 states have (on average 50.31578947368421) internal successors, (2868), 57 states have internal predecessors, (2868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:31:16,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:31:16,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 141 [2022-12-05 19:31:16,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:31:34,966 WARN L233 SmtUtils]: Spent 6.24s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 19:31:54,777 INFO L130 PetriNetUnfolder]: 30823/53476 cut-off events. [2022-12-05 19:31:54,777 INFO L131 PetriNetUnfolder]: For 911827/912591 co-relation queries the response was YES. [2022-12-05 19:31:56,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324873 conditions, 53476 events. 30823/53476 cut-off events. For 911827/912591 co-relation queries the response was YES. Maximal size of possible extension queue 3045. Compared 511360 event pairs, 3310 based on Foata normal form. 189/53253 useless extension candidates. Maximal degree in co-relation 324653. Up to 17554 conditions per place. [2022-12-05 19:31:57,298 INFO L137 encePairwiseOnDemand]: 101/141 looper letters, 1438 selfloop transitions, 2141 changer transitions 18/3643 dead transitions. [2022-12-05 19:31:57,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 3643 transitions, 52958 flow [2022-12-05 19:31:57,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-12-05 19:31:57,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2022-12-05 19:31:57,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 4711 transitions. [2022-12-05 19:31:57,304 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39775413711583923 [2022-12-05 19:31:57,304 INFO L175 Difference]: Start difference. First operand has 501 places, 1741 transitions, 22768 flow. Second operand 84 states and 4711 transitions. [2022-12-05 19:31:57,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 3643 transitions, 52958 flow [2022-12-05 19:32:22,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 555 places, 3643 transitions, 52233 flow, removed 335 selfloop flow, removed 23 redundant places. [2022-12-05 19:32:22,333 INFO L231 Difference]: Finished difference. Result has 599 places, 2896 transitions, 46540 flow [2022-12-05 19:32:22,334 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=22265, PETRI_DIFFERENCE_MINUEND_PLACES=472, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1741, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=84, PETRI_FLOW=46540, PETRI_PLACES=599, PETRI_TRANSITIONS=2896} [2022-12-05 19:32:22,335 INFO L294 CegarLoopForPetriNet]: 126 programPoint places, 473 predicate places. [2022-12-05 19:32:22,335 INFO L495 AbstractCegarLoop]: Abstraction has has 599 places, 2896 transitions, 46540 flow [2022-12-05 19:32:22,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 50.31578947368421) internal successors, (2868), 57 states have internal predecessors, (2868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:32:22,336 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:32:22,336 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:32:22,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-05 19:32:22,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-05 19:32:22,537 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:32:22,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:32:22,538 INFO L85 PathProgramCache]: Analyzing trace with hash -996339980, now seen corresponding path program 6 times [2022-12-05 19:32:22,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:32:22,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099727925] [2022-12-05 19:32:22,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:32:22,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:32:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:32:23,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:32:23,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:32:23,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099727925] [2022-12-05 19:32:23,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099727925] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:32:23,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290429575] [2022-12-05 19:32:23,949 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-05 19:32:23,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:32:23,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:32:23,950 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 19:32:23,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-05 19:32:24,035 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-05 19:32:24,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 19:32:24,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-05 19:32:24,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:32:24,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-05 19:32:24,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-05 19:32:25,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 19:32:25,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-12-05 19:32:25,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 19:32:25,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-12-05 19:32:25,685 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:32:25,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 43 [2022-12-05 19:32:26,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:32:26,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:32:28,943 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_339 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_339))) (or (< (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_341 (Array Int Int))) (let ((.cse1 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_340) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_341) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (= c_~min1~0 .cse1) (< 0 ~M~0) (< ~M~0 0) (not (< .cse1 c_~min2~0)))))))) (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_339 (Array Int Int)) (~M~0 Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_341 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_339))) (or (< (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_340) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_341) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min2~0) (< (select (select .cse2 c_~A~0.base) c_~A~0.offset) c_~min1~0) (< 0 ~M~0) (< ~M~0 0))))) (forall ((v_ArrVal_339 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_339))) (let ((.cse4 (select (select .cse5 c_~A~0.base) c_~A~0.offset))) (or (forall ((~M~0 Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_341 (Array Int Int))) (let ((.cse3 (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_340) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_341) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (< ~M~0 0) (not (< .cse3 c_~min2~0)) (= .cse4 .cse3)))) (not (< .cse4 c_~min1~0)))))) (forall ((v_ArrVal_339 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_339))) (let ((.cse7 (select (select .cse6 c_~A~0.base) c_~A~0.offset))) (or (forall ((~M~0 Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_341 (Array Int Int))) (or (< (select (select (store (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_340) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_341) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min2~0) (< 0 ~M~0) (< ~M~0 0))) (= c_~min2~0 .cse7) (not (< .cse7 c_~min1~0))))))) is different from false [2022-12-05 19:32:29,490 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_339 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_339))) (or (forall ((~M~0 Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_341 (Array Int Int))) (let ((.cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_340) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_341) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (= c_~min1~0 .cse0) (< 0 ~M~0) (< ~M~0 0) (not (< .cse0 c_~min2~0))))) (< (select (select .cse1 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0)))) (forall ((v_ArrVal_339 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_339))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (forall ((~M~0 Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_341 (Array Int Int))) (let ((.cse2 (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_340) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_341) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (< 0 ~M~0) (= .cse2 .cse3) (< ~M~0 0) (not (< .cse2 c_~min2~0))))) (not (< .cse3 c_~min1~0)))))) (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_339 (Array Int Int)) (~M~0 Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_341 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_339))) (or (< (select (select .cse5 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0) (< 0 ~M~0) (< ~M~0 0) (< (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_340) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_341) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~min2~0))))) (forall ((v_ArrVal_339 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_339))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (not (< .cse6 c_~min1~0)) (= c_~min2~0 .cse6) (forall ((~M~0 Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_341 (Array Int Int))) (or (< 0 ~M~0) (< ~M~0 0) (< (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_340) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_341) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~min2~0)))))))) is different from false [2022-12-05 19:32:29,552 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_339 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_339))) (or (forall ((~M~0 Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_341 (Array Int Int))) (let ((.cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_340) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_341) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (= c_~min1~0 .cse0) (< 0 ~M~0) (not (< .cse0 c_~min2~0)) (< ~M~0 0)))) (< (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0)))) (forall ((v_ArrVal_339 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_339))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (= c_~min2~0 .cse2) (not (< .cse2 c_~min1~0)) (forall ((~M~0 Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_341 (Array Int Int))) (or (< (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_340) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_341) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min2~0) (< 0 ~M~0) (< ~M~0 0))))))) (or (forall ((v_ArrVal_339 (Array Int Int)) (~M~0 Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_341 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_339))) (or (< (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_340) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_341) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min2~0) (< 0 ~M~0) (< ~M~0 0) (< (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0)))) (= c_~min2~0 c_~min1~0)) (forall ((v_ArrVal_339 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_339))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (not (< .cse5 c_~min1~0)) (forall ((~M~0 Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_341 (Array Int Int))) (let ((.cse6 (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_340) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_341) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< 0 ~M~0) (not (< .cse6 c_~min2~0)) (< ~M~0 0) (= .cse6 .cse5))))))))) is different from false [2022-12-05 19:32:29,625 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_339 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_339))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= c_~min2~0 .cse0) (not (< .cse0 c_~min1~0)) (forall ((~M~0 Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_341 (Array Int Int))) (or (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_340) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_341) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0) (< 0 ~M~0) (< ~M~0 0))))))) (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_339 (Array Int Int)) (~M~0 Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_341 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_339))) (or (< (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_340) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_341) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0) (< 0 ~M~0) (< (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (< ~M~0 0))))) (forall ((v_ArrVal_339 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_339))) (or (< (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_341 (Array Int Int))) (let ((.cse4 (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_340) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_341) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (= c_~min1~0 .cse4) (< 0 ~M~0) (< ~M~0 0) (not (< .cse4 c_~min2~0)))))))) (forall ((v_ArrVal_339 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_339))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((~M~0 Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_341 (Array Int Int))) (let ((.cse6 (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_340) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_341) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (= .cse5 .cse6) (< 0 ~M~0) (< ~M~0 0) (not (< .cse6 c_~min2~0))))) (not (< .cse5 c_~min1~0))))))) is different from false [2022-12-05 19:32:30,011 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:32:30,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 54 [2022-12-05 19:32:30,027 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-05 19:32:30,028 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 1267 treesize of output 1199 [2022-12-05 19:32:30,055 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-05 19:32:30,055 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 1187 treesize of output 1139 [2022-12-05 19:32:30,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1110 treesize of output 918 [2022-12-05 19:32:30,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 918 treesize of output 822 [2022-12-05 19:32:32,306 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:32:32,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 64 [2022-12-05 19:32:32,310 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-05 19:32:32,310 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-05 19:32:32,316 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-05 19:32:32,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 67 [2022-12-05 19:32:32,339 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-05 19:32:32,340 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 47 treesize of output 37 [2022-12-05 19:32:32,369 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:32:32,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 43 [2022-12-05 19:32:32,374 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-05 19:32:32,375 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-05 19:32:32,383 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-05 19:32:32,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 43 [2022-12-05 19:32:32,393 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-05 19:32:32,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2022-12-05 19:32:32,407 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-05 19:32:32,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 1 [2022-12-05 19:32:32,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-05 19:32:32,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290429575] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 19:32:32,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 19:32:32,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 27] total 73 [2022-12-05 19:32:32,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137386427] [2022-12-05 19:32:32,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 19:32:32,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-12-05 19:32:32,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:32:32,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-12-05 19:32:32,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=588, Invalid=4101, Unknown=19, NotChecked=548, Total=5256 [2022-12-05 19:32:32,752 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 141 [2022-12-05 19:32:32,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 599 places, 2896 transitions, 46540 flow. Second operand has 73 states, 73 states have (on average 45.726027397260275) internal successors, (3338), 73 states have internal predecessors, (3338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:32:32,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:32:32,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 141 [2022-12-05 19:32:32,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand