/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-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 16:05:12,717 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 16:05:12,718 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 16:05:12,749 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 16:05:12,750 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 16:05:12,752 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 16:05:12,755 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 16:05:12,758 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 16:05:12,761 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 16:05:12,765 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 16:05:12,766 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 16:05:12,767 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 16:05:12,768 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 16:05:12,769 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 16:05:12,770 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 16:05:12,772 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 16:05:12,773 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 16:05:12,773 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 16:05:12,775 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 16:05:12,779 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 16:05:12,780 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 16:05:12,781 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 16:05:12,781 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 16:05:12,782 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 16:05:12,787 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 16:05:12,788 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 16:05:12,788 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 16:05:12,789 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 16:05:12,790 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 16:05:12,790 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 16:05:12,790 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 16:05:12,791 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 16:05:12,793 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 16:05:12,793 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 16:05:12,794 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 16:05:12,794 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 16:05:12,794 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 16:05:12,794 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 16:05:12,794 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 16:05:12,795 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 16:05:12,795 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 16:05:12,798 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-SemanticLbe.epf [2022-12-12 16:05:12,823 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 16:05:12,823 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 16:05:12,824 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 16:05:12,824 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 16:05:12,825 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 16:05:12,825 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 16:05:12,825 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 16:05:12,826 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 16:05:12,826 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 16:05:12,826 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 16:05:12,826 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 16:05:12,826 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 16:05:12,826 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 16:05:12,827 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 16:05:12,827 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 16:05:12,827 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 16:05:12,827 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 16:05:12,827 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 16:05:12,827 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 16:05:12,827 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 16:05:12,827 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 16:05:12,827 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 16:05:12,828 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 16:05:12,828 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 16:05:12,828 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 16:05:12,828 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 16:05:12,828 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 16:05:12,828 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 16:05:12,828 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 16:05:12,828 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 16:05:12,828 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-12 16:05:13,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 16:05:13,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 16:05:13,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 16:05:13,083 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 16:05:13,084 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 16:05:13,085 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2022-12-12 16:05:14,059 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 16:05:14,270 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 16:05:14,270 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2022-12-12 16:05:14,288 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/818809426/687b1674546b4cf1bd2aea6abed358bb/FLAG67f448fe7 [2022-12-12 16:05:14,302 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/818809426/687b1674546b4cf1bd2aea6abed358bb [2022-12-12 16:05:14,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 16:05:14,305 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 16:05:14,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 16:05:14,306 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 16:05:14,307 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 16:05:14,308 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 04:05:14" (1/1) ... [2022-12-12 16:05:14,309 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49f2c138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:05:14, skipping insertion in model container [2022-12-12 16:05:14,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 04:05:14" (1/1) ... [2022-12-12 16:05:14,313 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 16:05:14,328 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 16:05:14,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 16:05:14,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 16:05:14,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 16:05:14,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 16:05:14,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 16:05:14,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 16:05:14,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 16:05:14,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 16:05:14,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 16:05:14,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 16:05:14,446 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-inc-subseq.wvr.c[2924,2937] [2022-12-12 16:05:14,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 16:05:14,463 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 16:05:14,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 16:05:14,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 16:05:14,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 16:05:14,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 16:05:14,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 16:05:14,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 16:05:14,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 16:05:14,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 16:05:14,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 16:05:14,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 16:05:14,483 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-inc-subseq.wvr.c[2924,2937] [2022-12-12 16:05:14,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 16:05:14,499 INFO L208 MainTranslator]: Completed translation [2022-12-12 16:05:14,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:05:14 WrapperNode [2022-12-12 16:05:14,499 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 16:05:14,500 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 16:05:14,500 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 16:05:14,500 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 16:05:14,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:05:14" (1/1) ... [2022-12-12 16:05:14,511 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:05:14" (1/1) ... [2022-12-12 16:05:14,527 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 191 [2022-12-12 16:05:14,528 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 16:05:14,528 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 16:05:14,528 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 16:05:14,528 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 16:05:14,541 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:05:14" (1/1) ... [2022-12-12 16:05:14,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:05:14" (1/1) ... [2022-12-12 16:05:14,544 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:05:14" (1/1) ... [2022-12-12 16:05:14,544 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:05:14" (1/1) ... [2022-12-12 16:05:14,549 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:05:14" (1/1) ... [2022-12-12 16:05:14,562 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:05:14" (1/1) ... [2022-12-12 16:05:14,564 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:05:14" (1/1) ... [2022-12-12 16:05:14,565 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:05:14" (1/1) ... [2022-12-12 16:05:14,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 16:05:14,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 16:05:14,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 16:05:14,567 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 16:05:14,568 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:05:14" (1/1) ... [2022-12-12 16:05:14,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 16:05:14,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:05:14,611 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-12 16:05:14,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-12 16:05:14,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 16:05:14,641 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-12 16:05:14,642 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-12 16:05:14,642 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-12 16:05:14,642 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-12 16:05:14,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 16:05:14,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 16:05:14,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 16:05:14,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 16:05:14,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 16:05:14,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-12 16:05:14,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 16:05:14,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 16:05:14,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-12 16:05:14,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 16:05:14,644 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 16:05:14,712 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 16:05:14,713 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 16:05:14,918 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 16:05:14,976 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 16:05:14,977 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-12 16:05:14,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 04:05:14 BoogieIcfgContainer [2022-12-12 16:05:14,979 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 16:05:14,983 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 16:05:14,983 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 16:05:14,986 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 16:05:14,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 04:05:14" (1/3) ... [2022-12-12 16:05:14,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f7e6838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 04:05:14, skipping insertion in model container [2022-12-12 16:05:14,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:05:14" (2/3) ... [2022-12-12 16:05:14,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f7e6838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 04:05:14, skipping insertion in model container [2022-12-12 16:05:14,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 04:05:14" (3/3) ... [2022-12-12 16:05:14,989 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-inc-subseq.wvr.c [2022-12-12 16:05:15,001 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 16:05:15,001 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-12 16:05:15,002 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 16:05:15,066 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-12 16:05:15,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 173 transitions, 362 flow [2022-12-12 16:05:15,145 INFO L130 PetriNetUnfolder]: 15/171 cut-off events. [2022-12-12 16:05:15,145 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-12 16:05:15,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 171 events. 15/171 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 138. Up to 2 conditions per place. [2022-12-12 16:05:15,149 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 173 transitions, 362 flow [2022-12-12 16:05:15,152 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 163 transitions, 338 flow [2022-12-12 16:05:15,154 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 16:05:15,165 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 163 transitions, 338 flow [2022-12-12 16:05:15,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 163 transitions, 338 flow [2022-12-12 16:05:15,193 INFO L130 PetriNetUnfolder]: 15/163 cut-off events. [2022-12-12 16:05:15,194 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-12 16:05:15,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 163 events. 15/163 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 138. Up to 2 conditions per place. [2022-12-12 16:05:15,210 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 163 transitions, 338 flow [2022-12-12 16:05:15,210 INFO L226 LiptonReduction]: Number of co-enabled transitions 690 [2022-12-12 16:05:20,069 INFO L241 LiptonReduction]: Total number of compositions: 140 [2022-12-12 16:05:20,080 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 16:05:20,084 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;@3303778b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 16:05:20,085 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-12 16:05:20,089 INFO L130 PetriNetUnfolder]: 5/22 cut-off events. [2022-12-12 16:05:20,089 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-12 16:05:20,089 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:05:20,089 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:05:20,089 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 16:05:20,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:05:20,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1533171233, now seen corresponding path program 1 times [2022-12-12 16:05:20,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:05:20,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325432761] [2022-12-12 16:05:20,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:05:20,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:05:20,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:05:20,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:05:20,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:05:20,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325432761] [2022-12-12 16:05:20,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325432761] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 16:05:20,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 16:05:20,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 16:05:20,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466794931] [2022-12-12 16:05:20,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 16:05:20,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 16:05:20,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:05:20,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 16:05:20,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 16:05:20,555 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-12 16:05:20,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 23 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:05:20,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:05:20,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-12 16:05:20,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:05:20,661 INFO L130 PetriNetUnfolder]: 146/245 cut-off events. [2022-12-12 16:05:20,661 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-12 16:05:20,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 245 events. 146/245 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 773 event pairs, 38 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 472. Up to 153 conditions per place. [2022-12-12 16:05:20,664 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 31 selfloop transitions, 4 changer transitions 0/35 dead transitions. [2022-12-12 16:05:20,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 35 transitions, 155 flow [2022-12-12 16:05:20,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 16:05:20,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 16:05:20,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-12 16:05:20,673 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.391304347826087 [2022-12-12 16:05:20,674 INFO L175 Difference]: Start difference. First operand has 25 places, 23 transitions, 58 flow. Second operand 4 states and 36 transitions. [2022-12-12 16:05:20,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 35 transitions, 155 flow [2022-12-12 16:05:20,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 35 transitions, 145 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-12 16:05:20,678 INFO L231 Difference]: Finished difference. Result has 25 places, 25 transitions, 71 flow [2022-12-12 16:05:20,679 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=71, PETRI_PLACES=25, PETRI_TRANSITIONS=25} [2022-12-12 16:05:20,681 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 0 predicate places. [2022-12-12 16:05:20,682 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 25 transitions, 71 flow [2022-12-12 16:05:20,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:05:20,682 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:05:20,683 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:05:20,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 16:05:20,683 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 16:05:20,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:05:20,686 INFO L85 PathProgramCache]: Analyzing trace with hash 908602455, now seen corresponding path program 1 times [2022-12-12 16:05:20,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:05:20,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969011198] [2022-12-12 16:05:20,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:05:20,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:05:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:05:20,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:05:20,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:05:20,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969011198] [2022-12-12 16:05:20,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969011198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 16:05:20,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 16:05:20,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 16:05:20,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893680857] [2022-12-12 16:05:20,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 16:05:20,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 16:05:20,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:05:20,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 16:05:20,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-12 16:05:20,829 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-12 16:05:20,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 25 transitions, 71 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:05:20,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:05:20,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-12 16:05:20,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:05:20,926 INFO L130 PetriNetUnfolder]: 146/246 cut-off events. [2022-12-12 16:05:20,927 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-12 16:05:20,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 566 conditions, 246 events. 146/246 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 769 event pairs, 38 based on Foata normal form. 1/206 useless extension candidates. Maximal degree in co-relation 182. Up to 153 conditions per place. [2022-12-12 16:05:20,931 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 31 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2022-12-12 16:05:20,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 36 transitions, 166 flow [2022-12-12 16:05:20,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 16:05:20,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 16:05:20,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-12 16:05:20,934 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40217391304347827 [2022-12-12 16:05:20,934 INFO L175 Difference]: Start difference. First operand has 25 places, 25 transitions, 71 flow. Second operand 4 states and 37 transitions. [2022-12-12 16:05:20,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 36 transitions, 166 flow [2022-12-12 16:05:20,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 36 transitions, 161 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-12 16:05:20,935 INFO L231 Difference]: Finished difference. Result has 27 places, 26 transitions, 84 flow [2022-12-12 16:05:20,935 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=27, PETRI_TRANSITIONS=26} [2022-12-12 16:05:20,936 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 2 predicate places. [2022-12-12 16:05:20,936 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 26 transitions, 84 flow [2022-12-12 16:05:20,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:05:20,936 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:05:20,936 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:05:20,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 16:05:20,937 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 16:05:20,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:05:20,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1972392944, now seen corresponding path program 1 times [2022-12-12 16:05:20,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:05:20,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588915511] [2022-12-12 16:05:20,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:05:20,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:05:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:05:21,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 16:05:21,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:05:21,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588915511] [2022-12-12 16:05:21,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588915511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 16:05:21,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 16:05:21,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 16:05:21,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016067660] [2022-12-12 16:05:21,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 16:05:21,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 16:05:21,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:05:21,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 16:05:21,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 16:05:21,074 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-12 16:05:21,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 26 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:05:21,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:05:21,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-12 16:05:21,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:05:21,177 INFO L130 PetriNetUnfolder]: 228/382 cut-off events. [2022-12-12 16:05:21,177 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2022-12-12 16:05:21,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 882 conditions, 382 events. 228/382 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1410 event pairs, 40 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 858. Up to 213 conditions per place. [2022-12-12 16:05:21,180 INFO L137 encePairwiseOnDemand]: 16/23 looper letters, 37 selfloop transitions, 16 changer transitions 0/53 dead transitions. [2022-12-12 16:05:21,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 53 transitions, 272 flow [2022-12-12 16:05:21,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 16:05:21,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 16:05:21,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-12-12 16:05:21,182 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41739130434782606 [2022-12-12 16:05:21,182 INFO L175 Difference]: Start difference. First operand has 27 places, 26 transitions, 84 flow. Second operand 5 states and 48 transitions. [2022-12-12 16:05:21,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 53 transitions, 272 flow [2022-12-12 16:05:21,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 53 transitions, 254 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-12 16:05:21,185 INFO L231 Difference]: Finished difference. Result has 32 places, 40 transitions, 189 flow [2022-12-12 16:05:21,185 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=189, PETRI_PLACES=32, PETRI_TRANSITIONS=40} [2022-12-12 16:05:21,186 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 7 predicate places. [2022-12-12 16:05:21,186 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 40 transitions, 189 flow [2022-12-12 16:05:21,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:05:21,187 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:05:21,187 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:05:21,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 16:05:21,187 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 16:05:21,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:05:21,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1222069868, now seen corresponding path program 2 times [2022-12-12 16:05:21,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:05:21,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358668645] [2022-12-12 16:05:21,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:05:21,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:05:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:05:21,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 16:05:21,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:05:21,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358668645] [2022-12-12 16:05:21,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358668645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 16:05:21,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 16:05:21,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 16:05:21,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552781915] [2022-12-12 16:05:21,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 16:05:21,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 16:05:21,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:05:21,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 16:05:21,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 16:05:21,283 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-12 16:05:21,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 40 transitions, 189 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:05:21,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:05:21,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-12 16:05:21,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:05:21,349 INFO L130 PetriNetUnfolder]: 296/491 cut-off events. [2022-12-12 16:05:21,349 INFO L131 PetriNetUnfolder]: For 454/463 co-relation queries the response was YES. [2022-12-12 16:05:21,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1577 conditions, 491 events. 296/491 cut-off events. For 454/463 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1913 event pairs, 100 based on Foata normal form. 5/451 useless extension candidates. Maximal degree in co-relation 1553. Up to 263 conditions per place. [2022-12-12 16:05:21,351 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 47 selfloop transitions, 5 changer transitions 2/56 dead transitions. [2022-12-12 16:05:21,351 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 56 transitions, 368 flow [2022-12-12 16:05:21,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 16:05:21,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 16:05:21,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-12-12 16:05:21,353 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5652173913043478 [2022-12-12 16:05:21,353 INFO L175 Difference]: Start difference. First operand has 32 places, 40 transitions, 189 flow. Second operand 3 states and 39 transitions. [2022-12-12 16:05:21,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 56 transitions, 368 flow [2022-12-12 16:05:21,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 56 transitions, 364 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-12 16:05:21,357 INFO L231 Difference]: Finished difference. Result has 35 places, 42 transitions, 215 flow [2022-12-12 16:05:21,357 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=215, PETRI_PLACES=35, PETRI_TRANSITIONS=42} [2022-12-12 16:05:21,358 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 10 predicate places. [2022-12-12 16:05:21,359 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 42 transitions, 215 flow [2022-12-12 16:05:21,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:05:21,362 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:05:21,362 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:05:21,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 16:05:21,362 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 16:05:21,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:05:21,362 INFO L85 PathProgramCache]: Analyzing trace with hash -99717384, now seen corresponding path program 1 times [2022-12-12 16:05:21,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:05:21,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280751872] [2022-12-12 16:05:21,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:05:21,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:05:21,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:05:21,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 16:05:21,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:05:21,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280751872] [2022-12-12 16:05:21,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280751872] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 16:05:21,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 16:05:21,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 16:05:21,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140515536] [2022-12-12 16:05:21,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 16:05:21,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 16:05:21,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:05:21,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 16:05:21,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 16:05:21,538 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-12 16:05:21,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 42 transitions, 215 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:05:21,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:05:21,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-12 16:05:21,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:05:21,624 INFO L130 PetriNetUnfolder]: 306/539 cut-off events. [2022-12-12 16:05:21,624 INFO L131 PetriNetUnfolder]: For 462/462 co-relation queries the response was YES. [2022-12-12 16:05:21,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1766 conditions, 539 events. 306/539 cut-off events. For 462/462 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2195 event pairs, 68 based on Foata normal form. 34/541 useless extension candidates. Maximal degree in co-relation 1739. Up to 374 conditions per place. [2022-12-12 16:05:21,626 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 51 selfloop transitions, 2 changer transitions 15/68 dead transitions. [2022-12-12 16:05:21,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 68 transitions, 452 flow [2022-12-12 16:05:21,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 16:05:21,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 16:05:21,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-12-12 16:05:21,627 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4260869565217391 [2022-12-12 16:05:21,627 INFO L175 Difference]: Start difference. First operand has 35 places, 42 transitions, 215 flow. Second operand 5 states and 49 transitions. [2022-12-12 16:05:21,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 68 transitions, 452 flow [2022-12-12 16:05:21,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 68 transitions, 447 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-12 16:05:21,629 INFO L231 Difference]: Finished difference. Result has 41 places, 42 transitions, 232 flow [2022-12-12 16:05:21,629 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=232, PETRI_PLACES=41, PETRI_TRANSITIONS=42} [2022-12-12 16:05:21,630 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 16 predicate places. [2022-12-12 16:05:21,630 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 42 transitions, 232 flow [2022-12-12 16:05:21,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:05:21,630 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:05:21,630 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:05:21,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 16:05:21,630 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 16:05:21,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:05:21,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1508888626, now seen corresponding path program 1 times [2022-12-12 16:05:21,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:05:21,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595676187] [2022-12-12 16:05:21,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:05:21,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:05:21,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:05:21,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 16:05:21,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:05:21,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595676187] [2022-12-12 16:05:21,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595676187] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 16:05:21,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 16:05:21,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 16:05:21,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133913091] [2022-12-12 16:05:21,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 16:05:21,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 16:05:21,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:05:21,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 16:05:21,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 16:05:21,695 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-12 16:05:21,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 42 transitions, 232 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:05:21,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:05:21,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-12 16:05:21,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:05:21,764 INFO L130 PetriNetUnfolder]: 320/573 cut-off events. [2022-12-12 16:05:21,764 INFO L131 PetriNetUnfolder]: For 811/823 co-relation queries the response was YES. [2022-12-12 16:05:21,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2013 conditions, 573 events. 320/573 cut-off events. For 811/823 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2402 event pairs, 188 based on Foata normal form. 21/530 useless extension candidates. Maximal degree in co-relation 1701. Up to 447 conditions per place. [2022-12-12 16:05:21,767 INFO L137 encePairwiseOnDemand]: 19/23 looper letters, 39 selfloop transitions, 2 changer transitions 17/60 dead transitions. [2022-12-12 16:05:21,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 60 transitions, 434 flow [2022-12-12 16:05:21,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 16:05:21,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 16:05:21,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-12-12 16:05:21,768 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42391304347826086 [2022-12-12 16:05:21,768 INFO L175 Difference]: Start difference. First operand has 41 places, 42 transitions, 232 flow. Second operand 4 states and 39 transitions. [2022-12-12 16:05:21,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 60 transitions, 434 flow [2022-12-12 16:05:21,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 60 transitions, 426 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-12 16:05:21,771 INFO L231 Difference]: Finished difference. Result has 42 places, 43 transitions, 238 flow [2022-12-12 16:05:21,771 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=238, PETRI_PLACES=42, PETRI_TRANSITIONS=43} [2022-12-12 16:05:21,771 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 17 predicate places. [2022-12-12 16:05:21,771 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 43 transitions, 238 flow [2022-12-12 16:05:21,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:05:21,772 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:05:21,772 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:05:21,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 16:05:21,772 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 16:05:21,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:05:21,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1724536694, now seen corresponding path program 1 times [2022-12-12 16:05:21,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:05:21,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339881981] [2022-12-12 16:05:21,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:05:21,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:05:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:05:22,370 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 16:05:22,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:05:22,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339881981] [2022-12-12 16:05:22,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339881981] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:05:22,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596377719] [2022-12-12 16:05:22,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:05:22,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:05:22,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:05:22,374 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:05:22,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-12 16:05:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:05:22,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-12 16:05:22,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:05:22,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:05:22,728 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 18 treesize of output 20 [2022-12-12 16:05:22,973 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-12-12 16:05:22,973 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 44 treesize of output 10 [2022-12-12 16:05:22,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 16:05:22,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:05:23,323 INFO L321 Elim1Store]: treesize reduction 15, result has 83.9 percent of original size [2022-12-12 16:05:23,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 259 treesize of output 256 [2022-12-12 16:05:23,345 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:05:23,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 174 treesize of output 189 [2022-12-12 16:05:23,358 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:05:23,358 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 144 treesize of output 137 [2022-12-12 16:05:23,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 16:05:23,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596377719] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:05:23,992 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:05:23,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 26 [2022-12-12 16:05:23,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084425665] [2022-12-12 16:05:23,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:05:23,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-12 16:05:23,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:05:23,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-12 16:05:23,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=588, Unknown=2, NotChecked=0, Total=756 [2022-12-12 16:05:23,993 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-12 16:05:23,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 43 transitions, 238 flow. Second operand has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:05:23,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:05:23,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-12 16:05:23,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:05:31,202 WARN L233 SmtUtils]: Spent 6.34s on a formula simplification. DAG size of input: 85 DAG size of output: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 16:05:45,716 WARN L233 SmtUtils]: Spent 8.75s on a formula simplification. DAG size of input: 92 DAG size of output: 72 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 16:05:52,180 WARN L233 SmtUtils]: Spent 6.26s on a formula simplification. DAG size of input: 84 DAG size of output: 64 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 16:05:58,482 WARN L233 SmtUtils]: Spent 6.21s on a formula simplification. DAG size of input: 83 DAG size of output: 72 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 16:06:10,516 WARN L233 SmtUtils]: Spent 11.60s on a formula simplification. DAG size of input: 91 DAG size of output: 83 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 16:06:17,679 WARN L233 SmtUtils]: Spent 6.28s on a formula simplification. DAG size of input: 95 DAG size of output: 68 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 16:06:18,381 INFO L130 PetriNetUnfolder]: 1548/2708 cut-off events. [2022-12-12 16:06:18,382 INFO L131 PetriNetUnfolder]: For 3053/3053 co-relation queries the response was YES. [2022-12-12 16:06:18,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9359 conditions, 2708 events. 1548/2708 cut-off events. For 3053/3053 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 15556 event pairs, 205 based on Foata normal form. 75/2593 useless extension candidates. Maximal degree in co-relation 9336. Up to 649 conditions per place. [2022-12-12 16:06:18,394 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 264 selfloop transitions, 118 changer transitions 81/463 dead transitions. [2022-12-12 16:06:18,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 463 transitions, 3234 flow [2022-12-12 16:06:18,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-12-12 16:06:18,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2022-12-12 16:06:18,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 363 transitions. [2022-12-12 16:06:18,397 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.358695652173913 [2022-12-12 16:06:18,397 INFO L175 Difference]: Start difference. First operand has 42 places, 43 transitions, 238 flow. Second operand 44 states and 363 transitions. [2022-12-12 16:06:18,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 463 transitions, 3234 flow [2022-12-12 16:06:18,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 463 transitions, 3200 flow, removed 16 selfloop flow, removed 3 redundant places. [2022-12-12 16:06:18,419 INFO L231 Difference]: Finished difference. Result has 105 places, 164 transitions, 1459 flow [2022-12-12 16:06:18,419 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=1459, PETRI_PLACES=105, PETRI_TRANSITIONS=164} [2022-12-12 16:06:18,420 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 80 predicate places. [2022-12-12 16:06:18,420 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 164 transitions, 1459 flow [2022-12-12 16:06:18,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:06:18,420 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:06:18,420 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:06:18,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-12 16:06:18,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:06:18,627 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 16:06:18,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:06:18,627 INFO L85 PathProgramCache]: Analyzing trace with hash 941799216, now seen corresponding path program 2 times [2022-12-12 16:06:18,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:06:18,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599397440] [2022-12-12 16:06:18,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:06:18,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:06:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:06:18,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 16:06:18,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:06:18,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599397440] [2022-12-12 16:06:18,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599397440] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:06:18,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632003024] [2022-12-12 16:06:18,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 16:06:18,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:06:18,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:06:18,741 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:06:18,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-12 16:06:18,818 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 16:06:18,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 16:06:18,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-12 16:06:18,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:06:18,845 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 16:06:18,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:06:18,912 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 16:06:18,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632003024] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:06:18,912 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:06:18,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2022-12-12 16:06:18,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176256968] [2022-12-12 16:06:18,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:06:18,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 16:06:18,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:06:18,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 16:06:18,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-12 16:06:18,913 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-12 16:06:18,914 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 164 transitions, 1459 flow. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:06:18,914 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:06:18,914 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-12 16:06:18,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:06:19,248 INFO L130 PetriNetUnfolder]: 1203/2133 cut-off events. [2022-12-12 16:06:19,248 INFO L131 PetriNetUnfolder]: For 11910/11910 co-relation queries the response was YES. [2022-12-12 16:06:19,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10464 conditions, 2133 events. 1203/2133 cut-off events. For 11910/11910 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 11736 event pairs, 140 based on Foata normal form. 80/2213 useless extension candidates. Maximal degree in co-relation 10356. Up to 637 conditions per place. [2022-12-12 16:06:19,264 INFO L137 encePairwiseOnDemand]: 16/23 looper letters, 125 selfloop transitions, 89 changer transitions 0/214 dead transitions. [2022-12-12 16:06:19,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 214 transitions, 2280 flow [2022-12-12 16:06:19,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 16:06:19,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 16:06:19,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2022-12-12 16:06:19,265 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37681159420289856 [2022-12-12 16:06:19,265 INFO L175 Difference]: Start difference. First operand has 105 places, 164 transitions, 1459 flow. Second operand 6 states and 52 transitions. [2022-12-12 16:06:19,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 214 transitions, 2280 flow [2022-12-12 16:06:19,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 214 transitions, 2032 flow, removed 99 selfloop flow, removed 10 redundant places. [2022-12-12 16:06:19,304 INFO L231 Difference]: Finished difference. Result has 97 places, 177 transitions, 1793 flow [2022-12-12 16:06:19,305 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=1193, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1793, PETRI_PLACES=97, PETRI_TRANSITIONS=177} [2022-12-12 16:06:19,305 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 72 predicate places. [2022-12-12 16:06:19,305 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 177 transitions, 1793 flow [2022-12-12 16:06:19,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:06:19,305 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:06:19,305 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:06:19,313 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-12 16:06:19,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-12 16:06:19,511 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 16:06:19,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:06:19,511 INFO L85 PathProgramCache]: Analyzing trace with hash -31986696, now seen corresponding path program 3 times [2022-12-12 16:06:19,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:06:19,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467068024] [2022-12-12 16:06:19,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:06:19,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:06:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:06:20,168 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 16:06:20,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:06:20,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467068024] [2022-12-12 16:06:20,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467068024] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:06:20,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964144433] [2022-12-12 16:06:20,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-12 16:06:20,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:06:20,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:06:20,170 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:06:20,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-12 16:06:20,240 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-12 16:06:20,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 16:06:20,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-12 16:06:20,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:06:20,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:06:20,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:06:20,267 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-12 16:06:20,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-12-12 16:06:20,312 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-12 16:06:20,352 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-12 16:06:20,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-12 16:06:20,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 16:06:20,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 16:06:20,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:06:20,558 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-12 16:06:20,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-12-12 16:06:20,566 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 27 treesize of output 15 [2022-12-12 16:06:20,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-12 16:06:20,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:06:20,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:06:21,348 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:06:21,349 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 56 treesize of output 45 [2022-12-12 16:06:21,362 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:06:21,362 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 422 treesize of output 378 [2022-12-12 16:06:21,375 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:06:21,376 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 358 treesize of output 279 [2022-12-12 16:06:21,389 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:06:21,389 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 262 treesize of output 231 [2022-12-12 16:06:21,512 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:06:21,512 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 117 treesize of output 81 [2022-12-12 16:06:21,548 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:06:21,549 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 4396 treesize of output 3934 [2022-12-12 16:06:21,594 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:06:21,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3884 treesize of output 3544 [2022-12-12 16:06:21,647 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:06:21,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3500 treesize of output 2776 [2022-12-12 16:06:21,671 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 2294 treesize of output 1910 [2022-12-12 16:06:28,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:06:28,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964144433] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:06:28,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:06:28,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 28 [2022-12-12 16:06:28,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530085135] [2022-12-12 16:06:28,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:06:28,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-12 16:06:28,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:06:28,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-12 16:06:28,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=688, Unknown=12, NotChecked=0, Total=870 [2022-12-12 16:06:28,289 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-12 16:06:28,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 177 transitions, 1793 flow. Second operand has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:06:28,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:06:28,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-12 16:06:28,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:06:28,710 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (not (< c_~end~0 c_~n~0))) (.cse6 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse2 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse3 (not (= (mod c_~ok~0 256) 0))) (.cse7 (not (<= 0 c_~end~0)))) (and (or .cse0 (and (or (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_220 (Array Int Int)) (~A~0.base Int)) (not (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_220))) (= (select (select .cse1 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse1 c_~queue~0.base) .cse2))))) .cse3) (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_220 (Array Int Int)) (~A~0.base Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_220))) (let ((.cse4 (select (select .cse5 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (not (= .cse4 (select (select .cse5 c_~queue~0.base) .cse2))) (forall ((v_ArrVal_221 (Array Int Int))) (< .cse4 (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_221) c_~queue~0.base) .cse6) 1)))))))) .cse7) (= c_~ok~0 1) (or .cse0 (and (forall ((~A~0.offset Int) (v_ArrVal_219 (Array Int Int)) (~i~0 Int) (v_ArrVal_220 (Array Int Int)) (~A~0.base Int)) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_219) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_220))) (let ((.cse9 (select (select .cse8 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (not (= (select (select .cse8 c_~queue~0.base) .cse2) .cse9)) (forall ((v_ArrVal_221 (Array Int Int))) (< .cse9 (+ 1 (select (select (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_221) c_~queue~0.base) .cse6)))))))) (or (forall ((~A~0.offset Int) (v_ArrVal_219 (Array Int Int)) (~i~0 Int) (v_ArrVal_220 (Array Int Int)) (~A~0.base Int)) (not (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_219) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_220))) (= (select (select .cse10 c_~queue~0.base) .cse2) (select (select .cse10 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) .cse3)) .cse7))) is different from false [2022-12-12 16:06:29,129 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_~start~0 4))) (let ((.cse10 (+ .cse3 c_~queue~0.offset)) (.cse2 (* c_~end~0 4))) (let ((.cse0 (not (< c_~end~0 c_~n~0))) (.cse7 (+ .cse2 c_~queue~0.offset)) (.cse5 (not (= (mod c_~ok~0 256) 0))) (.cse1 (not (<= 0 c_~end~0))) (.cse15 (select (select |c_#memory_int| c_~queue~0.base) .cse10)) (.cse16 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (and (<= c_~start~0 0) (or .cse0 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse1 (let ((.cse4 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_113| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_113|) 0))))) (and (or (= .cse2 .cse3) .cse4) (or .cse5 .cse4) (or .cse4 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))))) (<= (+ c_~start~0 1) c_~end~0) (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|)) (<= 0 c_~start~0) (or .cse0 (and (or (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_220 (Array Int Int)) (~A~0.base Int)) (not (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_220))) (= (select (select .cse6 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse6 c_~queue~0.base) .cse7))))) .cse5) (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_220 (Array Int Int)) (~A~0.base Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_220))) (let ((.cse8 (select (select .cse9 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (not (= .cse8 (select (select .cse9 c_~queue~0.base) .cse7))) (forall ((v_ArrVal_221 (Array Int Int))) (< .cse8 (+ (select (select (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_221) c_~queue~0.base) .cse10) 1)))))))) .cse1) (<= (+ c_~queue~0.base 2) |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~ok~0 1) (or .cse0 (and (forall ((~A~0.offset Int) (v_ArrVal_219 (Array Int Int)) (~i~0 Int) (v_ArrVal_220 (Array Int Int)) (~A~0.base Int)) (let ((.cse11 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_219) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_220))) (let ((.cse12 (select (select .cse11 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (not (= (select (select .cse11 c_~queue~0.base) .cse7) .cse12)) (forall ((v_ArrVal_221 (Array Int Int))) (< .cse12 (+ 1 (select (select (store .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_221) c_~queue~0.base) .cse10)))))))) (or (forall ((~A~0.offset Int) (v_ArrVal_219 (Array Int Int)) (~i~0 Int) (v_ArrVal_220 (Array Int Int)) (~A~0.base Int)) (not (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_219) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_220))) (= (select (select .cse13 c_~queue~0.base) .cse7) (select (select .cse13 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) .cse5)) .cse1) (= c_~queue~0.offset 0) (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (let ((.cse14 (select (select |c_#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= c_~v_old~0 .cse14) (= .cse14 .cse15)))) (= .cse10 0) (<= c_~v_old~0 .cse16) (= .cse15 .cse16))))) is different from false [2022-12-12 16:06:30,219 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_221 (Array Int Int))) (< c_~v_old~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_221) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) 1))) (not (= (mod c_~ok~0 256) 0)) (= c_~ok~0 1)) is different from false [2022-12-12 16:06:31,920 INFO L130 PetriNetUnfolder]: 2707/4757 cut-off events. [2022-12-12 16:06:31,920 INFO L131 PetriNetUnfolder]: For 29042/29042 co-relation queries the response was YES. [2022-12-12 16:06:31,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25918 conditions, 4757 events. 2707/4757 cut-off events. For 29042/29042 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 30497 event pairs, 566 based on Foata normal form. 8/4765 useless extension candidates. Maximal degree in co-relation 23070. Up to 1474 conditions per place. [2022-12-12 16:06:31,963 INFO L137 encePairwiseOnDemand]: 7/23 looper letters, 402 selfloop transitions, 170 changer transitions 39/611 dead transitions. [2022-12-12 16:06:31,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 611 transitions, 7363 flow [2022-12-12 16:06:31,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-12 16:06:31,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-12-12 16:06:31,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 251 transitions. [2022-12-12 16:06:31,965 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29494712103407755 [2022-12-12 16:06:31,965 INFO L175 Difference]: Start difference. First operand has 97 places, 177 transitions, 1793 flow. Second operand 37 states and 251 transitions. [2022-12-12 16:06:31,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 611 transitions, 7363 flow [2022-12-12 16:06:32,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 611 transitions, 7158 flow, removed 62 selfloop flow, removed 1 redundant places. [2022-12-12 16:06:32,103 INFO L231 Difference]: Finished difference. Result has 146 places, 307 transitions, 3627 flow [2022-12-12 16:06:32,103 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=1722, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=3627, PETRI_PLACES=146, PETRI_TRANSITIONS=307} [2022-12-12 16:06:32,104 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 121 predicate places. [2022-12-12 16:06:32,104 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 307 transitions, 3627 flow [2022-12-12 16:06:32,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:06:32,104 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:06:32,104 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:06:32,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-12 16:06:32,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:06:32,322 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 16:06:32,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:06:32,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1593898030, now seen corresponding path program 4 times [2022-12-12 16:06:32,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:06:32,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193910272] [2022-12-12 16:06:32,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:06:32,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:06:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:06:33,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 16:06:33,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:06:33,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193910272] [2022-12-12 16:06:33,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193910272] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:06:33,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883960647] [2022-12-12 16:06:33,083 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-12 16:06:33,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:06:33,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:06:33,091 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:06:33,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-12 16:06:33,169 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-12 16:06:33,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 16:06:33,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-12 16:06:33,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:06:33,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:06:33,451 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-12 16:06:33,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-12-12 16:06:33,458 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 27 treesize of output 15 [2022-12-12 16:06:33,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-12 16:06:33,565 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 16:06:33,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:06:33,842 INFO L321 Elim1Store]: treesize reduction 19, result has 62.7 percent of original size [2022-12-12 16:06:33,842 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 74 treesize of output 73 [2022-12-12 16:06:33,850 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 33 treesize of output 27 [2022-12-12 16:06:34,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 16:06:34,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883960647] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:06:34,051 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:06:34,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 28 [2022-12-12 16:06:34,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519085628] [2022-12-12 16:06:34,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:06:34,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-12 16:06:34,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:06:34,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-12 16:06:34,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=697, Unknown=5, NotChecked=0, Total=870 [2022-12-12 16:06:34,052 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-12 16:06:34,052 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 307 transitions, 3627 flow. Second operand has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:06:34,052 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:06:34,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-12 16:06:34,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:06:37,400 INFO L130 PetriNetUnfolder]: 3504/6137 cut-off events. [2022-12-12 16:06:37,400 INFO L131 PetriNetUnfolder]: For 47881/47881 co-relation queries the response was YES. [2022-12-12 16:06:37,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38086 conditions, 6137 events. 3504/6137 cut-off events. For 47881/47881 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 40131 event pairs, 450 based on Foata normal form. 30/6167 useless extension candidates. Maximal degree in co-relation 38015. Up to 1944 conditions per place. [2022-12-12 16:06:37,482 INFO L137 encePairwiseOnDemand]: 3/23 looper letters, 324 selfloop transitions, 313 changer transitions 70/707 dead transitions. [2022-12-12 16:06:37,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 707 transitions, 9134 flow [2022-12-12 16:06:37,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-12 16:06:37,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-12 16:06:37,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 310 transitions. [2022-12-12 16:06:37,485 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39641943734015345 [2022-12-12 16:06:37,485 INFO L175 Difference]: Start difference. First operand has 146 places, 307 transitions, 3627 flow. Second operand 34 states and 310 transitions. [2022-12-12 16:06:37,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 707 transitions, 9134 flow [2022-12-12 16:06:37,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 707 transitions, 9006 flow, removed 54 selfloop flow, removed 6 redundant places. [2022-12-12 16:06:37,683 INFO L231 Difference]: Finished difference. Result has 183 places, 404 transitions, 5719 flow [2022-12-12 16:06:37,683 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=3346, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=206, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=5719, PETRI_PLACES=183, PETRI_TRANSITIONS=404} [2022-12-12 16:06:37,684 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 158 predicate places. [2022-12-12 16:06:37,684 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 404 transitions, 5719 flow [2022-12-12 16:06:37,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:06:37,685 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:06:37,685 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:06:37,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-12 16:06:37,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:06:37,892 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 16:06:37,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:06:37,892 INFO L85 PathProgramCache]: Analyzing trace with hash -2129237098, now seen corresponding path program 5 times [2022-12-12 16:06:37,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:06:37,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610057009] [2022-12-12 16:06:37,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:06:37,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:06:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:06:38,036 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 16:06:38,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:06:38,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610057009] [2022-12-12 16:06:38,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610057009] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:06:38,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552450380] [2022-12-12 16:06:38,037 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-12 16:06:38,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:06:38,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:06:38,039 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:06:38,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-12 16:06:38,152 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 16:06:38,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 16:06:38,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-12 16:06:38,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:06:38,179 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 16:06:38,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:06:38,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 16:06:38,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552450380] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:06:38,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:06:38,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 4] total 9 [2022-12-12 16:06:38,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956743125] [2022-12-12 16:06:38,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:06:38,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-12 16:06:38,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:06:38,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-12 16:06:38,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-12-12 16:06:38,254 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-12 16:06:38,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 404 transitions, 5719 flow. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:06:38,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:06:38,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-12 16:06:38,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:06:39,513 INFO L130 PetriNetUnfolder]: 3815/6797 cut-off events. [2022-12-12 16:06:39,514 INFO L131 PetriNetUnfolder]: For 78760/78760 co-relation queries the response was YES. [2022-12-12 16:06:39,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48816 conditions, 6797 events. 3815/6797 cut-off events. For 78760/78760 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 45876 event pairs, 501 based on Foata normal form. 278/7075 useless extension candidates. Maximal degree in co-relation 48697. Up to 2540 conditions per place. [2022-12-12 16:06:39,578 INFO L137 encePairwiseOnDemand]: 19/23 looper letters, 313 selfloop transitions, 174 changer transitions 55/542 dead transitions. [2022-12-12 16:06:39,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 542 transitions, 8758 flow [2022-12-12 16:06:39,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 16:06:39,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 16:06:39,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-12-12 16:06:39,579 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.453416149068323 [2022-12-12 16:06:39,579 INFO L175 Difference]: Start difference. First operand has 183 places, 404 transitions, 5719 flow. Second operand 7 states and 73 transitions. [2022-12-12 16:06:39,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 542 transitions, 8758 flow [2022-12-12 16:06:39,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 542 transitions, 8390 flow, removed 118 selfloop flow, removed 13 redundant places. [2022-12-12 16:06:39,872 INFO L231 Difference]: Finished difference. Result has 172 places, 420 transitions, 6586 flow [2022-12-12 16:06:39,872 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=4699, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6586, PETRI_PLACES=172, PETRI_TRANSITIONS=420} [2022-12-12 16:06:39,873 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 147 predicate places. [2022-12-12 16:06:39,873 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 420 transitions, 6586 flow [2022-12-12 16:06:39,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:06:39,873 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:06:39,873 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:06:39,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-12 16:06:40,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-12 16:06:40,078 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 16:06:40,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:06:40,078 INFO L85 PathProgramCache]: Analyzing trace with hash -237743322, now seen corresponding path program 6 times [2022-12-12 16:06:40,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:06:40,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948167475] [2022-12-12 16:06:40,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:06:40,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:06:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:06:42,045 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:06:42,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:06:42,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948167475] [2022-12-12 16:06:42,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948167475] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:06:42,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945817113] [2022-12-12 16:06:42,046 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-12 16:06:42,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:06:42,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:06:42,059 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:06:42,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-12 16:06:42,308 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-12 16:06:42,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 16:06:42,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-12 16:06:42,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:06:42,604 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-12-12 16:06:42,604 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 42 treesize of output 10 [2022-12-12 16:06:42,626 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 16:06:42,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:06:44,846 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:06:44,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 126 [2022-12-12 16:06:45,120 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-12 16:06:45,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945817113] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:06:45,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:06:45,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 6] total 28 [2022-12-12 16:06:45,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743559463] [2022-12-12 16:06:45,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:06:45,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-12 16:06:45,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:06:45,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-12 16:06:45,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=698, Unknown=0, NotChecked=0, Total=870 [2022-12-12 16:06:45,127 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-12 16:06:45,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 420 transitions, 6586 flow. Second operand has 30 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:06:45,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:06:45,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-12 16:06:45,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:06:48,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-12 16:06:50,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-12 16:06:52,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-12 16:06:54,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-12 16:07:09,794 WARN L233 SmtUtils]: Spent 12.12s on a formula simplification. DAG size of input: 54 DAG size of output: 47 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 16:07:12,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-12 16:07:13,671 INFO L130 PetriNetUnfolder]: 6020/11106 cut-off events. [2022-12-12 16:07:13,671 INFO L131 PetriNetUnfolder]: For 128169/128169 co-relation queries the response was YES. [2022-12-12 16:07:13,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81862 conditions, 11106 events. 6020/11106 cut-off events. For 128169/128169 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 85530 event pairs, 452 based on Foata normal form. 9/11103 useless extension candidates. Maximal degree in co-relation 73693. Up to 3936 conditions per place. [2022-12-12 16:07:13,862 INFO L137 encePairwiseOnDemand]: 6/23 looper letters, 487 selfloop transitions, 616 changer transitions 56/1159 dead transitions. [2022-12-12 16:07:13,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 1159 transitions, 19069 flow [2022-12-12 16:07:13,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-12-12 16:07:13,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2022-12-12 16:07:13,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 322 transitions. [2022-12-12 16:07:13,864 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25925925925925924 [2022-12-12 16:07:13,864 INFO L175 Difference]: Start difference. First operand has 172 places, 420 transitions, 6586 flow. Second operand 54 states and 322 transitions. [2022-12-12 16:07:13,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 1159 transitions, 19069 flow [2022-12-12 16:07:14,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 1159 transitions, 18677 flow, removed 196 selfloop flow, removed 0 redundant places. [2022-12-12 16:07:14,402 INFO L231 Difference]: Finished difference. Result has 250 places, 872 transitions, 15764 flow [2022-12-12 16:07:14,402 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=6400, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=203, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=15764, PETRI_PLACES=250, PETRI_TRANSITIONS=872} [2022-12-12 16:07:14,403 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 225 predicate places. [2022-12-12 16:07:14,403 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 872 transitions, 15764 flow [2022-12-12 16:07:14,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:07:14,403 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:07:14,403 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:07:14,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-12 16:07:14,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:07:14,608 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 16:07:14,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:07:14,616 INFO L85 PathProgramCache]: Analyzing trace with hash -859809058, now seen corresponding path program 7 times [2022-12-12 16:07:14,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:07:14,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22334319] [2022-12-12 16:07:14,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:07:14,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:07:14,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:07:16,677 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:07:16,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:07:16,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22334319] [2022-12-12 16:07:16,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22334319] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:07:16,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187915828] [2022-12-12 16:07:16,678 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-12 16:07:16,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:07:16,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:07:16,684 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:07:16,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-12 16:07:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:07:16,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-12 16:07:16,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:07:17,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:07:17,058 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-12 16:07:17,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-12-12 16:07:17,062 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 27 treesize of output 15 [2022-12-12 16:07:17,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-12 16:07:17,215 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 16:07:17,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:07:17,495 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:07:17,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 140 [2022-12-12 16:07:17,500 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 42 treesize of output 36 [2022-12-12 16:07:17,844 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-12 16:07:17,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187915828] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:07:17,844 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:07:17,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 8] total 32 [2022-12-12 16:07:17,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712511761] [2022-12-12 16:07:17,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:07:17,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-12 16:07:17,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:07:17,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-12 16:07:17,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=920, Unknown=2, NotChecked=0, Total=1122 [2022-12-12 16:07:17,845 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-12 16:07:17,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 872 transitions, 15764 flow. Second operand has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:07:17,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:07:17,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-12 16:07:17,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:07:22,846 INFO L130 PetriNetUnfolder]: 7243/13189 cut-off events. [2022-12-12 16:07:22,846 INFO L131 PetriNetUnfolder]: For 221384/221384 co-relation queries the response was YES. [2022-12-12 16:07:22,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110698 conditions, 13189 events. 7243/13189 cut-off events. For 221384/221384 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 102892 event pairs, 633 based on Foata normal form. 9/13186 useless extension candidates. Maximal degree in co-relation 109597. Up to 4632 conditions per place. [2022-12-12 16:07:23,003 INFO L137 encePairwiseOnDemand]: 9/23 looper letters, 505 selfloop transitions, 704 changer transitions 46/1255 dead transitions. [2022-12-12 16:07:23,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 1255 transitions, 24600 flow [2022-12-12 16:07:23,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-12 16:07:23,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-12 16:07:23,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 172 transitions. [2022-12-12 16:07:23,005 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2991304347826087 [2022-12-12 16:07:23,005 INFO L175 Difference]: Start difference. First operand has 250 places, 872 transitions, 15764 flow. Second operand 25 states and 172 transitions. [2022-12-12 16:07:23,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 1255 transitions, 24600 flow [2022-12-12 16:07:25,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 1255 transitions, 23481 flow, removed 501 selfloop flow, removed 8 redundant places. [2022-12-12 16:07:25,099 INFO L231 Difference]: Finished difference. Result has 273 places, 1045 transitions, 20626 flow [2022-12-12 16:07:25,099 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=14978, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=872, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=534, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=20626, PETRI_PLACES=273, PETRI_TRANSITIONS=1045} [2022-12-12 16:07:25,100 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 248 predicate places. [2022-12-12 16:07:25,100 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 1045 transitions, 20626 flow [2022-12-12 16:07:25,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:07:25,100 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:07:25,100 INFO L214 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:07:25,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-12 16:07:25,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:07:25,307 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 16:07:25,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:07:25,308 INFO L85 PathProgramCache]: Analyzing trace with hash 675130544, now seen corresponding path program 8 times [2022-12-12 16:07:25,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:07:25,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515648443] [2022-12-12 16:07:25,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:07:25,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:07:25,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:07:26,745 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 16:07:26,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:07:26,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515648443] [2022-12-12 16:07:26,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515648443] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:07:26,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789041705] [2022-12-12 16:07:26,745 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 16:07:26,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:07:26,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:07:26,747 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:07:26,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-12 16:07:26,855 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 16:07:26,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 16:07:26,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-12 16:07:26,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:07:27,057 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-12 16:07:27,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:07:27,101 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 14 treesize of output 16 [2022-12-12 16:07:27,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:07:27,193 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 14 treesize of output 16 [2022-12-12 16:07:27,361 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-12-12 16:07:27,361 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 34 treesize of output 10 [2022-12-12 16:07:27,388 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 16:07:27,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:07:35,015 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~end~0 4)) (.cse2 (+ c_~A~0.offset (* c_~i~0 4)))) (and (or (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_457 (Array Int Int)) (~queue~0.base Int) (~queue~0.offset Int)) (not (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_457))) (= (select (select .cse0 ~queue~0.base) (+ .cse1 ~queue~0.offset)) (select (select .cse0 c_~A~0.base) .cse2)))))) (forall ((v_ArrVal_457 (Array Int Int)) (~queue~0.base Int) (~queue~0.offset Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_457))) (let ((.cse3 (select .cse4 ~queue~0.base))) (or (not (= (select .cse3 (+ .cse1 ~queue~0.offset)) (select (select .cse4 c_~A~0.base) .cse2))) (< c_~v_old~0 (+ (select .cse3 (+ (* c_~start~0 4) ~queue~0.offset)) 1)))))))) is different from false [2022-12-12 16:07:35,087 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* c_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (* c_~end~0 4))) (and (or (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_457 (Array Int Int)) (~queue~0.base Int) (~queue~0.offset Int) (v_ArrVal_456 (Array Int Int))) (not (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_457))) (= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) (select (select .cse0 ~queue~0.base) (+ .cse2 ~queue~0.offset))))))) (forall ((v_ArrVal_457 (Array Int Int)) (~queue~0.base Int) (~queue~0.offset Int) (v_ArrVal_456 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_457))) (let ((.cse4 (select .cse3 ~queue~0.base))) (or (not (= (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) (select .cse4 (+ .cse2 ~queue~0.offset)))) (< (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ (select .cse4 (+ (* c_~start~0 4) ~queue~0.offset)) 1)))))))) is different from false [2022-12-12 16:07:35,104 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:07:35,105 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 56 treesize of output 45 [2022-12-12 16:07:35,114 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:07:35,115 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 854 treesize of output 746 [2022-12-12 16:07:35,125 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:07:35,125 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 726 treesize of output 551 [2022-12-12 16:07:35,136 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:07:35,136 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 534 treesize of output 455 [2022-12-12 16:07:35,256 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:07:35,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 74 [2022-12-12 16:07:35,267 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:07:35,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 979 treesize of output 951 [2022-12-12 16:07:35,328 INFO L321 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2022-12-12 16:07:35,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1243 treesize of output 1232 [2022-12-12 16:07:35,362 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:07:35,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1244 treesize of output 1048 [2022-12-12 16:07:35,402 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:07:35,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 917 treesize of output 841 [2022-12-12 16:08:35,655 WARN L233 SmtUtils]: Spent 55.13s on a formula simplification. DAG size of input: 11033 DAG size of output: 1 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-12-12 16:08:35,656 INFO L321 Elim1Store]: treesize reduction 32108, result has 0.0 percent of original size [2022-12-12 16:08:35,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 75 select indices, 75 select index equivalence classes, 0 disjoint index pairs (out of 2775 index pairs), introduced 75 new quantified variables, introduced 2775 case distinctions, treesize of input 2178 treesize of output 1 [2022-12-12 16:08:35,951 INFO L321 Elim1Store]: treesize reduction 10, result has 96.4 percent of original size [2022-12-12 16:08:35,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 200 treesize of output 390 [2022-12-12 16:08:35,955 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-12 16:08:38,513 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 2 not checked. [2022-12-12 16:08:38,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789041705] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:08:38,513 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:08:38,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 9] total 35 [2022-12-12 16:08:38,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335700790] [2022-12-12 16:08:38,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:08:38,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-12 16:08:38,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:08:38,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-12 16:08:38,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=992, Unknown=3, NotChecked=134, Total=1332 [2022-12-12 16:08:38,514 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-12 16:08:38,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 1045 transitions, 20626 flow. Second operand has 37 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 36 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:08:38,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:08:38,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-12 16:08:38,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:08:48,093 INFO L130 PetriNetUnfolder]: 9576/17145 cut-off events. [2022-12-12 16:08:48,093 INFO L131 PetriNetUnfolder]: For 309959/309959 co-relation queries the response was YES. [2022-12-12 16:08:48,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148934 conditions, 17145 events. 9576/17145 cut-off events. For 309959/309959 co-relation queries the response was YES. Maximal size of possible extension queue 665. Compared 136297 event pairs, 865 based on Foata normal form. 9/17142 useless extension candidates. Maximal degree in co-relation 148801. Up to 7631 conditions per place. [2022-12-12 16:08:48,295 INFO L137 encePairwiseOnDemand]: 10/23 looper letters, 743 selfloop transitions, 873 changer transitions 45/1661 dead transitions. [2022-12-12 16:08:48,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 1661 transitions, 34784 flow [2022-12-12 16:08:48,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-12 16:08:48,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-12 16:08:48,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 186 transitions. [2022-12-12 16:08:48,302 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27886056971514245 [2022-12-12 16:08:48,302 INFO L175 Difference]: Start difference. First operand has 273 places, 1045 transitions, 20626 flow. Second operand 29 states and 186 transitions. [2022-12-12 16:08:48,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 1661 transitions, 34784 flow [2022-12-12 16:08:51,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 1661 transitions, 34362 flow, removed 183 selfloop flow, removed 9 redundant places. [2022-12-12 16:08:51,778 INFO L231 Difference]: Finished difference. Result has 301 places, 1398 transitions, 30782 flow [2022-12-12 16:08:51,779 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=20301, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1045, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=540, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=30782, PETRI_PLACES=301, PETRI_TRANSITIONS=1398} [2022-12-12 16:08:51,779 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 276 predicate places. [2022-12-12 16:08:51,779 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 1398 transitions, 30782 flow [2022-12-12 16:08:51,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 36 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:08:51,779 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:08:51,779 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:08:51,785 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-12 16:08:51,984 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,SelfDestructingSolverStorable13 [2022-12-12 16:08:51,985 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 16:08:51,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:08:51,985 INFO L85 PathProgramCache]: Analyzing trace with hash 8091068, now seen corresponding path program 9 times [2022-12-12 16:08:51,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:08:51,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94556094] [2022-12-12 16:08:51,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:08:51,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:08:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:08:52,105 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 16:08:52,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:08:52,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94556094] [2022-12-12 16:08:52,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94556094] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:08:52,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877904762] [2022-12-12 16:08:52,105 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-12 16:08:52,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:08:52,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:08:52,121 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:08:52,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-12 16:08:52,264 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-12 16:08:52,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 16:08:52,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-12 16:08:52,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:08:52,351 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 16:08:52,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:08:52,424 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 16:08:52,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877904762] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:08:52,424 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:08:52,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2022-12-12 16:08:52,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682012014] [2022-12-12 16:08:52,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:08:52,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-12 16:08:52,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:08:52,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-12 16:08:52,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-12-12 16:08:52,425 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-12 16:08:52,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 1398 transitions, 30782 flow. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:08:52,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:08:52,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-12 16:08:52,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:08:57,875 INFO L130 PetriNetUnfolder]: 8008/14740 cut-off events. [2022-12-12 16:08:57,875 INFO L131 PetriNetUnfolder]: For 320948/320948 co-relation queries the response was YES. [2022-12-12 16:08:57,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134036 conditions, 14740 events. 8008/14740 cut-off events. For 320948/320948 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 117686 event pairs, 990 based on Foata normal form. 625/15359 useless extension candidates. Maximal degree in co-relation 133940. Up to 7757 conditions per place. [2022-12-12 16:08:58,023 INFO L137 encePairwiseOnDemand]: 12/23 looper letters, 844 selfloop transitions, 70 changer transitions 618/1532 dead transitions. [2022-12-12 16:08:58,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 1532 transitions, 35660 flow [2022-12-12 16:08:58,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-12 16:08:58,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-12 16:08:58,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 139 transitions. [2022-12-12 16:08:58,025 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30217391304347824 [2022-12-12 16:08:58,025 INFO L175 Difference]: Start difference. First operand has 301 places, 1398 transitions, 30782 flow. Second operand 20 states and 139 transitions. [2022-12-12 16:08:58,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 1532 transitions, 35660 flow [2022-12-12 16:09:01,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 1532 transitions, 35350 flow, removed 48 selfloop flow, removed 12 redundant places. [2022-12-12 16:09:01,710 INFO L231 Difference]: Finished difference. Result has 304 places, 840 transitions, 18815 flow [2022-12-12 16:09:01,711 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=25712, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=18815, PETRI_PLACES=304, PETRI_TRANSITIONS=840} [2022-12-12 16:09:01,711 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 279 predicate places. [2022-12-12 16:09:01,711 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 840 transitions, 18815 flow [2022-12-12 16:09:01,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:09:01,712 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:09:01,712 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:09:01,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-12 16:09:01,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-12 16:09:01,917 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 16:09:01,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:09:01,917 INFO L85 PathProgramCache]: Analyzing trace with hash 2040379843, now seen corresponding path program 1 times [2022-12-12 16:09:01,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:09:01,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090457048] [2022-12-12 16:09:01,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:09:01,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:09:01,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:09:02,199 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-12 16:09:02,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:09:02,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090457048] [2022-12-12 16:09:02,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090457048] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:09:02,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170409408] [2022-12-12 16:09:02,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:09:02,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:09:02,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:09:02,201 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:09:02,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-12 16:09:02,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:09:02,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-12 16:09:02,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:09:02,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:09:02,349 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 14 treesize of output 16 [2022-12-12 16:09:02,368 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-12 16:09:02,368 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-12 16:09:02,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170409408] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 16:09:02,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-12 16:09:02,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2022-12-12 16:09:02,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636943820] [2022-12-12 16:09:02,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 16:09:02,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 16:09:02,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:09:02,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 16:09:02,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-12 16:09:02,370 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-12 16:09:02,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 840 transitions, 18815 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:09:02,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:09:02,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-12 16:09:02,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:09:05,079 INFO L130 PetriNetUnfolder]: 5734/10084 cut-off events. [2022-12-12 16:09:05,080 INFO L131 PetriNetUnfolder]: For 234962/234962 co-relation queries the response was YES. [2022-12-12 16:09:05,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96187 conditions, 10084 events. 5734/10084 cut-off events. For 234962/234962 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 71745 event pairs, 425 based on Foata normal form. 12/10090 useless extension candidates. Maximal degree in co-relation 96091. Up to 8998 conditions per place. [2022-12-12 16:09:05,207 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 759 selfloop transitions, 60 changer transitions 0/819 dead transitions. [2022-12-12 16:09:05,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 819 transitions, 19767 flow [2022-12-12 16:09:05,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 16:09:05,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 16:09:05,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-12-12 16:09:05,208 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42391304347826086 [2022-12-12 16:09:05,208 INFO L175 Difference]: Start difference. First operand has 304 places, 840 transitions, 18815 flow. Second operand 4 states and 39 transitions. [2022-12-12 16:09:05,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 819 transitions, 19767 flow [2022-12-12 16:09:07,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 819 transitions, 18427 flow, removed 307 selfloop flow, removed 44 redundant places. [2022-12-12 16:09:07,141 INFO L231 Difference]: Finished difference. Result has 192 places, 785 transitions, 16436 flow [2022-12-12 16:09:07,141 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=16272, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=784, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=725, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=16436, PETRI_PLACES=192, PETRI_TRANSITIONS=785} [2022-12-12 16:09:07,142 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 167 predicate places. [2022-12-12 16:09:07,142 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 785 transitions, 16436 flow [2022-12-12 16:09:07,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:09:07,142 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:09:07,143 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:09:07,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-12 16:09:07,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-12 16:09:07,351 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 16:09:07,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:09:07,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1810143663, now seen corresponding path program 10 times [2022-12-12 16:09:07,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:09:07,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193897167] [2022-12-12 16:09:07,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:09:07,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:09:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:09:08,785 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 16:09:08,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:09:08,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193897167] [2022-12-12 16:09:08,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193897167] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:09:08,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478884976] [2022-12-12 16:09:08,785 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-12 16:09:08,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:09:08,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:09:08,786 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:09:08,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-12 16:09:08,934 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-12 16:09:08,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 16:09:08,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 77 conjunts are in the unsatisfiable core [2022-12-12 16:09:08,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:09:08,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:09:08,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:09:08,962 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-12 16:09:08,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-12-12 16:09:09,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-12 16:09:09,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:09:09,138 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-12-12 16:09:09,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-12-12 16:09:09,191 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 16:09:09,208 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 16:09:09,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 16:09:09,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-12 16:09:10,157 INFO L321 Elim1Store]: treesize reduction 46, result has 29.2 percent of original size [2022-12-12 16:09:10,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 82 treesize of output 34 [2022-12-12 16:09:10,194 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 16:09:10,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:09:16,242 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:09:16,242 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 251 treesize of output 167 [2022-12-12 16:09:16,282 INFO L321 Elim1Store]: treesize reduction 31, result has 41.5 percent of original size [2022-12-12 16:09:16,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 7463 treesize of output 7178 [2022-12-12 16:09:16,332 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:09:16,339 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:09:16,339 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:09:16,407 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:09:16,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 6870 treesize of output 6386 [2022-12-12 16:09:16,446 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:09:16,453 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:09:16,453 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:09:16,523 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:09:16,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 6515 treesize of output 4921 [2022-12-12 16:09:16,571 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:09:16,575 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:09:16,575 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:09:16,645 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:09:16,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 4763 treesize of output 4045 [2022-12-12 16:09:55,055 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:09:55,055 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 187 treesize of output 127 [2022-12-12 16:09:55,077 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:09:55,078 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 7018 treesize of output 6746 [2022-12-12 16:09:55,131 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:09:55,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 6746 treesize of output 5176 [2022-12-12 16:09:55,217 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:09:55,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 5040 treesize of output 4502 [2022-12-12 16:09:55,281 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:09:55,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 4482 treesize of output 3736 [2022-12-12 16:10:03,186 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:10:03,186 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 247 treesize of output 163 [2022-12-12 16:10:03,218 INFO L321 Elim1Store]: treesize reduction 15, result has 44.4 percent of original size [2022-12-12 16:10:03,219 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 7879 treesize of output 7587 [2022-12-12 16:10:03,355 INFO L321 Elim1Store]: treesize reduction 14, result has 89.8 percent of original size [2022-12-12 16:10:03,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 7575 treesize of output 5953 [2022-12-12 16:10:03,401 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:10:03,457 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:10:03,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 5831 treesize of output 4985 [2022-12-12 16:10:03,512 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:10:03,572 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:10:03,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 4817 treesize of output 4203 [2022-12-12 16:11:44,358 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 11 refuted. 2 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 16:11:44,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478884976] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:11:44,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:11:44,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 43 [2022-12-12 16:11:44,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940093526] [2022-12-12 16:11:44,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:11:44,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-12-12 16:11:44,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:11:44,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-12-12 16:11:44,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=1661, Unknown=12, NotChecked=0, Total=1980 [2022-12-12 16:11:44,360 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-12 16:11:44,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 785 transitions, 16436 flow. Second operand has 45 states, 44 states have (on average 1.75) internal successors, (77), 44 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:11:44,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:11:44,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-12 16:11:44,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:11:47,776 WARN L837 $PredicateComparison]: unable to prove that (and (= c_~ok~0 1) (let ((.cse0 (+ c_~end~0 1))) (or (<= .cse0 c_~start~0) (<= c_~n~0 .cse0) (< c_~start~0 0) (let ((.cse22 (* c_~end~0 4)) (.cse5 (* c_~start~0 4))) (let ((.cse4 (+ .cse5 c_~queue~0.offset)) (.cse3 (+ .cse22 c_~queue~0.offset 4)) (.cse7 (+ .cse22 c_~queue~0.offset))) (and (forall ((v_~i~0_124 Int) (~A~0.offset Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (~i~0 Int)) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_603) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_604) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_605))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse1 (select .cse9 (+ (* v_~i~0_124 4) ~A~0.offset))) (.cse6 (select .cse9 (+ (* ~i~0 4) ~A~0.offset))) (.cse2 (select .cse8 c_~queue~0.base))) (or (not (= .cse1 (select .cse2 .cse3))) (< (select .cse2 .cse4) (+ (select .cse2 (+ .cse5 c_~queue~0.offset 4)) 1)) (< .cse1 .cse6) (not (= .cse6 (select .cse2 .cse7)))))))) (or (forall ((v_~i~0_124 Int) (~A~0.offset Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (~i~0 Int)) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_603) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_604) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_605))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse10 (select .cse14 (+ (* v_~i~0_124 4) ~A~0.offset))) (.cse12 (select .cse14 (+ (* ~i~0 4) ~A~0.offset))) (.cse11 (select .cse13 c_~queue~0.base))) (or (not (= .cse10 (select .cse11 .cse3))) (< .cse10 .cse12) (not (= .cse12 (select .cse11 .cse7)))))))) (not (= (mod c_~ok~0 256) 0))) (forall ((v_~i~0_124 Int) (~A~0.offset Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (~i~0 Int)) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_603) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_604))) (let ((.cse20 (store .cse15 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_605))) (let ((.cse16 (+ (* ~i~0 4) ~A~0.offset)) (.cse21 (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse18 (select .cse21 (+ (* v_~i~0_124 4) ~A~0.offset))) (.cse19 (select .cse21 .cse16)) (.cse17 (select .cse20 c_~queue~0.base))) (or (< (select (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse16) (+ (select .cse17 .cse4) 1)) (not (= .cse18 (select .cse17 .cse3))) (< .cse18 .cse19) (not (= .cse19 (select .cse17 .cse7))))))))))))))) is different from false [2022-12-12 16:12:25,125 WARN L233 SmtUtils]: Spent 6.63s on a formula simplification. DAG size of input: 194 DAG size of output: 132 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 16:12:36,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-12 16:12:41,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-12 16:12:51,641 INFO L130 PetriNetUnfolder]: 10686/19172 cut-off events. [2022-12-12 16:12:51,641 INFO L131 PetriNetUnfolder]: For 280672/280672 co-relation queries the response was YES. [2022-12-12 16:12:51,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154887 conditions, 19172 events. 10686/19172 cut-off events. For 280672/280672 co-relation queries the response was YES. Maximal size of possible extension queue 844. Compared 154081 event pairs, 1351 based on Foata normal form. 174/19302 useless extension candidates. Maximal degree in co-relation 154822. Up to 7113 conditions per place. [2022-12-12 16:12:51,800 INFO L137 encePairwiseOnDemand]: 7/23 looper letters, 1161 selfloop transitions, 1141 changer transitions 453/2755 dead transitions. [2022-12-12 16:12:51,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 2755 transitions, 54128 flow [2022-12-12 16:12:51,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2022-12-12 16:12:51,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2022-12-12 16:12:51,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 778 transitions. [2022-12-12 16:12:51,803 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25821440424825753 [2022-12-12 16:12:51,803 INFO L175 Difference]: Start difference. First operand has 192 places, 785 transitions, 16436 flow. Second operand 131 states and 778 transitions. [2022-12-12 16:12:51,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 2755 transitions, 54128 flow [2022-12-12 16:12:53,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 2755 transitions, 53499 flow, removed 112 selfloop flow, removed 2 redundant places. [2022-12-12 16:12:53,468 INFO L231 Difference]: Finished difference. Result has 372 places, 1680 transitions, 38912 flow [2022-12-12 16:12:53,468 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=16126, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=785, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=390, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=131, PETRI_FLOW=38912, PETRI_PLACES=372, PETRI_TRANSITIONS=1680} [2022-12-12 16:12:53,468 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 347 predicate places. [2022-12-12 16:12:53,468 INFO L495 AbstractCegarLoop]: Abstraction has has 372 places, 1680 transitions, 38912 flow [2022-12-12 16:12:53,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.75) internal successors, (77), 44 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:12:53,469 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:12:53,469 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:12:53,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-12 16:12:53,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-12 16:12:53,678 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 16:12:53,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:12:53,678 INFO L85 PathProgramCache]: Analyzing trace with hash -205149255, now seen corresponding path program 11 times [2022-12-12 16:12:53,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:12:53,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376839786] [2022-12-12 16:12:53,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:12:53,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:12:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:12:54,916 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 16:12:54,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:12:54,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376839786] [2022-12-12 16:12:54,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376839786] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:12:54,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229711141] [2022-12-12 16:12:54,916 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-12 16:12:54,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:12:54,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:12:54,918 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:12:54,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-12 16:12:55,039 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-12 16:12:55,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 16:12:55,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-12 16:12:55,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:12:55,703 INFO L321 Elim1Store]: treesize reduction 41, result has 56.8 percent of original size [2022-12-12 16:12:55,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 69 [2022-12-12 16:12:55,738 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-12 16:12:55,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:12:57,333 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:12:57,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 235 treesize of output 1307 Received shutdown request... [2022-12-12 16:19:18,552 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-12 16:19:18,554 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-12 16:19:18,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-12 16:19:18,589 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-12 16:19:18,589 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-12 16:19:18,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-12 16:19:18,755 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 29 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 0ms.. [2022-12-12 16:19:18,756 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-12 16:19:18,756 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-12 16:19:18,756 INFO L445 BasicCegarLoop]: Path program histogram: [11, 2, 1, 1, 1, 1, 1] [2022-12-12 16:19:18,758 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 16:19:18,759 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 16:19:18,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 04:19:18 BasicIcfg [2022-12-12 16:19:18,760 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 16:19:18,760 INFO L158 Benchmark]: Toolchain (without parser) took 844455.84ms. Allocated memory was 186.6MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 163.0MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2022-12-12 16:19:18,761 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 186.6MB. Free memory was 163.4MB in the beginning and 163.3MB in the end (delta: 75.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 16:19:18,761 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.82ms. Allocated memory is still 186.6MB. Free memory was 162.4MB in the beginning and 149.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-12 16:19:18,761 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.62ms. Allocated memory is still 186.6MB. Free memory was 149.9MB in the beginning and 147.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 16:19:18,761 INFO L158 Benchmark]: Boogie Preprocessor took 38.05ms. Allocated memory is still 186.6MB. Free memory was 147.8MB in the beginning and 146.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 16:19:18,761 INFO L158 Benchmark]: RCFGBuilder took 411.68ms. Allocated memory is still 186.6MB. Free memory was 145.7MB in the beginning and 121.0MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-12 16:19:18,761 INFO L158 Benchmark]: TraceAbstraction took 843777.37ms. Allocated memory was 186.6MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 120.0MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2022-12-12 16:19:18,762 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 186.6MB. Free memory was 163.4MB in the beginning and 163.3MB in the end (delta: 75.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 193.82ms. Allocated memory is still 186.6MB. Free memory was 162.4MB in the beginning and 149.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.62ms. Allocated memory is still 186.6MB. Free memory was 149.9MB in the beginning and 147.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.05ms. Allocated memory is still 186.6MB. Free memory was 147.8MB in the beginning and 146.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 411.68ms. Allocated memory is still 186.6MB. Free memory was 145.7MB in the beginning and 121.0MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 843777.37ms. Allocated memory was 186.6MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 120.0MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.9s, 155 PlacesBefore, 25 PlacesAfterwards, 163 TransitionsBefore, 23 TransitionsAfterwards, 690 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 110 TrivialYvCompositions, 20 ConcurrentYvCompositions, 10 ChoiceCompositions, 140 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 482, independent: 454, independent conditional: 454, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 482, independent: 454, independent conditional: 0, independent unconditional: 454, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 482, independent: 454, independent conditional: 0, independent unconditional: 454, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 482, independent: 454, independent conditional: 0, independent unconditional: 454, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 423, independent: 408, independent conditional: 0, independent unconditional: 408, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 423, independent: 407, independent conditional: 0, independent unconditional: 407, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 482, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 423, unknown conditional: 0, unknown unconditional: 423] , Statistics on independence cache: Total cache size (in pairs): 638, Positive cache size: 623, Positive conditional cache size: 0, Positive unconditional cache size: 623, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 29 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 0ms.. - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 29 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 0ms.. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 29 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 0ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 183 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 843.7s, OverallIterations: 18, TraceHistogramMax: 5, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.0s, AutomataDifference: 197.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.0s, HoareTripleCheckerStatistics: 278 mSolverCounterUnknown, 4056 SdHoareTripleChecker+Valid, 30.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4056 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 28.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 271 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 720 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12590 IncrementalHoareTripleChecker+Invalid, 13859 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 720 mSolverCounterUnsat, 2 mSDtfsCounter, 12590 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 914 GetRequests, 330 SyntacticMatches, 10 SemanticMatches, 574 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 12955 ImplicationChecksByTransitivity, 147.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38912occurred in iteration=17, InterpolantAutomatonStates: 416, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 251.6s InterpolantComputationTime, 622 NumberOfCodeBlocks, 622 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 817 ConstructedInterpolants, 74 QuantifiedInterpolants, 18619 SizeOfPredicates, 195 NumberOfNonLiveVariables, 2969 ConjunctsInSsa, 376 ConjunctsInUnsatCore, 38 InterpolantComputations, 7 PerfectInterpolantSequences, 148/321 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown