/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked TOGETHER -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-more-max-array.wvr_bound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 20:39:09,262 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 20:39:09,320 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 20:39:09,325 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 20:39:09,325 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 20:39:09,326 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 20:39:09,326 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 20:39:09,347 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 20:39:09,348 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 20:39:09,350 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 20:39:09,350 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 20:39:09,351 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 20:39:09,351 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 20:39:09,352 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 20:39:09,352 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 20:39:09,352 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 20:39:09,353 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 20:39:09,353 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 20:39:09,353 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 20:39:09,353 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 20:39:09,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 20:39:09,353 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 20:39:09,353 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 20:39:09,354 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 20:39:09,354 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 20:39:09,355 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 20:39:09,355 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 20:39:09,355 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 20:39:09,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 20:39:09,355 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 20:39:09,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 20:39:09,356 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 20:39:09,356 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 20:39:09,356 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 20:39:09,356 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 20:39:09,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 20:39:09,357 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 20:39:09,357 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 20:39:09,357 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 20:39:09,357 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 20:39:09,357 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 20:39:09,357 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> TOGETHER [2023-08-03 20:39:09,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 20:39:09,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 20:39:09,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 20:39:09,540 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 20:39:09,540 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 20:39:09,541 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-more-max-array.wvr_bound2.c [2023-08-03 20:39:10,412 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 20:39:10,568 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 20:39:10,569 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-more-max-array.wvr_bound2.c [2023-08-03 20:39:10,574 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2192f0087/82bc12d5d9f441fdbaa1bee7fd2d33ff/FLAG7be8e29a3 [2023-08-03 20:39:10,990 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2192f0087/82bc12d5d9f441fdbaa1bee7fd2d33ff [2023-08-03 20:39:10,996 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 20:39:10,997 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 20:39:10,998 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 20:39:10,999 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 20:39:11,001 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 20:39:11,001 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 08:39:10" (1/1) ... [2023-08-03 20:39:11,002 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36c06d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:39:11, skipping insertion in model container [2023-08-03 20:39:11,002 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 08:39:10" (1/1) ... [2023-08-03 20:39:11,015 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 20:39:11,140 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-more-max-array.wvr_bound2.c[2796,2809] [2023-08-03 20:39:11,150 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 20:39:11,156 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 20:39:11,191 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-more-max-array.wvr_bound2.c[2796,2809] [2023-08-03 20:39:11,193 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 20:39:11,198 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 20:39:11,198 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 20:39:11,203 INFO L206 MainTranslator]: Completed translation [2023-08-03 20:39:11,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:39:11 WrapperNode [2023-08-03 20:39:11,205 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 20:39:11,208 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 20:39:11,208 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 20:39:11,208 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 20:39:11,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:39:11" (1/1) ... [2023-08-03 20:39:11,218 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:39:11" (1/1) ... [2023-08-03 20:39:11,232 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 152 [2023-08-03 20:39:11,233 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 20:39:11,233 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 20:39:11,233 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 20:39:11,233 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 20:39:11,238 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:39:11" (1/1) ... [2023-08-03 20:39:11,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:39:11" (1/1) ... [2023-08-03 20:39:11,240 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:39:11" (1/1) ... [2023-08-03 20:39:11,241 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:39:11" (1/1) ... [2023-08-03 20:39:11,245 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:39:11" (1/1) ... [2023-08-03 20:39:11,249 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:39:11" (1/1) ... [2023-08-03 20:39:11,250 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:39:11" (1/1) ... [2023-08-03 20:39:11,250 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:39:11" (1/1) ... [2023-08-03 20:39:11,252 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 20:39:11,253 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 20:39:11,253 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 20:39:11,253 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 20:39:11,253 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:39:11" (1/1) ... [2023-08-03 20:39:11,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 20:39:11,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:39:11,275 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-03 20:39:11,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-03 20:39:11,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 20:39:11,299 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-03 20:39:11,300 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-03 20:39:11,300 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-03 20:39:11,300 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-03 20:39:11,300 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-03 20:39:11,300 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-03 20:39:11,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 20:39:11,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 20:39:11,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 20:39:11,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-03 20:39:11,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-03 20:39:11,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-03 20:39:11,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 20:39:11,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 20:39:11,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-03 20:39:11,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 20:39:11,302 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-03 20:39:11,374 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 20:39:11,375 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 20:39:11,585 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 20:39:11,623 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 20:39:11,623 INFO L302 CfgBuilder]: Removed 10 assume(true) statements. [2023-08-03 20:39:11,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 08:39:11 BoogieIcfgContainer [2023-08-03 20:39:11,625 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 20:39:11,626 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 20:39:11,626 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 20:39:11,628 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 20:39:11,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 08:39:10" (1/3) ... [2023-08-03 20:39:11,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb2a827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 08:39:11, skipping insertion in model container [2023-08-03 20:39:11,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:39:11" (2/3) ... [2023-08-03 20:39:11,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb2a827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 08:39:11, skipping insertion in model container [2023-08-03 20:39:11,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 08:39:11" (3/3) ... [2023-08-03 20:39:11,629 INFO L112 eAbstractionObserver]: Analyzing ICFG weaver_popl20-more-max-array.wvr_bound2.c [2023-08-03 20:39:11,634 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 20:39:11,640 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 20:39:11,640 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-03 20:39:11,640 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 20:39:11,687 INFO L144 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2023-08-03 20:39:11,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 192 transitions, 426 flow [2023-08-03 20:39:11,811 INFO L124 PetriNetUnfolderBase]: 101/660 cut-off events. [2023-08-03 20:39:11,811 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-08-03 20:39:11,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 660 events. 101/660 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3241 event pairs, 0 based on Foata normal form. 0/549 useless extension candidates. Maximal degree in co-relation 371. Up to 16 conditions per place. [2023-08-03 20:39:11,817 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 192 transitions, 426 flow [2023-08-03 20:39:11,822 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 172 places, 192 transitions, 426 flow [2023-08-03 20:39:11,824 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 20:39:11,830 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 192 transitions, 426 flow [2023-08-03 20:39:11,831 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 192 transitions, 426 flow [2023-08-03 20:39:11,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 192 transitions, 426 flow [2023-08-03 20:39:11,932 INFO L124 PetriNetUnfolderBase]: 101/660 cut-off events. [2023-08-03 20:39:11,933 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-08-03 20:39:11,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 660 events. 101/660 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3241 event pairs, 0 based on Foata normal form. 0/549 useless extension candidates. Maximal degree in co-relation 371. Up to 16 conditions per place. [2023-08-03 20:39:11,940 INFO L119 LiptonReduction]: Number of co-enabled transitions 5220 [2023-08-03 20:39:15,668 INFO L134 LiptonReduction]: Checked pairs total: 9109 [2023-08-03 20:39:15,668 INFO L136 LiptonReduction]: Total number of compositions: 170 [2023-08-03 20:39:15,677 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 20:39:15,681 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7fa503df, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 20:39:15,681 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-03 20:39:15,684 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 20:39:15,684 INFO L124 PetriNetUnfolderBase]: 4/33 cut-off events. [2023-08-03 20:39:15,684 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 20:39:15,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:39:15,685 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-03 20:39:15,685 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 20:39:15,688 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:39:15,688 INFO L85 PathProgramCache]: Analyzing trace with hash -281942865, now seen corresponding path program 1 times [2023-08-03 20:39:15,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:39:15,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571296743] [2023-08-03 20:39:15,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:39:15,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:39:15,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:39:16,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-03 20:39:16,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:39:16,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571296743] [2023-08-03 20:39:16,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571296743] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:39:16,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 20:39:16,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 20:39:16,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540915091] [2023-08-03 20:39:16,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:39:16,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 20:39:16,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:39:16,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 20:39:16,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 20:39:16,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 362 [2023-08-03 20:39:16,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 49 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:39:16,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:39:16,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 362 [2023-08-03 20:39:16,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:39:16,271 INFO L124 PetriNetUnfolderBase]: 2293/3230 cut-off events. [2023-08-03 20:39:16,272 INFO L125 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2023-08-03 20:39:16,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6524 conditions, 3230 events. 2293/3230 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 14905 event pairs, 1048 based on Foata normal form. 0/1846 useless extension candidates. Maximal degree in co-relation 4977. Up to 3069 conditions per place. [2023-08-03 20:39:16,286 INFO L140 encePairwiseOnDemand]: 358/362 looper letters, 38 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2023-08-03 20:39:16,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 220 flow [2023-08-03 20:39:16,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 20:39:16,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 20:39:16,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 513 transitions. [2023-08-03 20:39:16,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4723756906077348 [2023-08-03 20:39:16,302 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 513 transitions. [2023-08-03 20:39:16,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 513 transitions. [2023-08-03 20:39:16,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:39:16,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 513 transitions. [2023-08-03 20:39:16,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:39:16,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:39:16,315 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:39:16,317 INFO L175 Difference]: Start difference. First operand has 43 places, 49 transitions, 140 flow. Second operand 3 states and 513 transitions. [2023-08-03 20:39:16,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 220 flow [2023-08-03 20:39:16,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 49 transitions, 220 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 20:39:16,322 INFO L231 Difference]: Finished difference. Result has 45 places, 49 transitions, 150 flow [2023-08-03 20:39:16,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=45, PETRI_TRANSITIONS=49} [2023-08-03 20:39:16,326 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2023-08-03 20:39:16,326 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 49 transitions, 150 flow [2023-08-03 20:39:16,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:39:16,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:39:16,327 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-03 20:39:16,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 20:39:16,327 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 20:39:16,329 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:39:16,329 INFO L85 PathProgramCache]: Analyzing trace with hash 2015478006, now seen corresponding path program 1 times [2023-08-03 20:39:16,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:39:16,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553738263] [2023-08-03 20:39:16,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:39:16,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:39:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 20:39:16,394 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 20:39:16,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 20:39:16,435 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 20:39:16,435 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 20:39:16,436 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2023-08-03 20:39:16,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-03 20:39:16,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-08-03 20:39:16,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-08-03 20:39:16,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 20:39:16,441 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-03 20:39:16,444 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 20:39:16,444 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 20:39:16,472 INFO L144 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2023-08-03 20:39:16,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 234 transitions, 558 flow [2023-08-03 20:39:16,787 INFO L124 PetriNetUnfolderBase]: 891/4149 cut-off events. [2023-08-03 20:39:16,788 INFO L125 PetriNetUnfolderBase]: For 602/602 co-relation queries the response was YES. [2023-08-03 20:39:16,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4823 conditions, 4149 events. 891/4149 cut-off events. For 602/602 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 33195 event pairs, 11 based on Foata normal form. 0/3502 useless extension candidates. Maximal degree in co-relation 2466. Up to 192 conditions per place. [2023-08-03 20:39:16,813 INFO L82 GeneralOperation]: Start removeDead. Operand has 205 places, 234 transitions, 558 flow [2023-08-03 20:39:16,830 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 205 places, 234 transitions, 558 flow [2023-08-03 20:39:16,831 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 20:39:16,831 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 234 transitions, 558 flow [2023-08-03 20:39:16,831 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 205 places, 234 transitions, 558 flow [2023-08-03 20:39:16,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 234 transitions, 558 flow [2023-08-03 20:39:17,158 INFO L124 PetriNetUnfolderBase]: 891/4149 cut-off events. [2023-08-03 20:39:17,158 INFO L125 PetriNetUnfolderBase]: For 602/602 co-relation queries the response was YES. [2023-08-03 20:39:17,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4823 conditions, 4149 events. 891/4149 cut-off events. For 602/602 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 33195 event pairs, 11 based on Foata normal form. 0/3502 useless extension candidates. Maximal degree in co-relation 2466. Up to 192 conditions per place. [2023-08-03 20:39:17,233 INFO L119 LiptonReduction]: Number of co-enabled transitions 13500 [2023-08-03 20:39:21,630 INFO L134 LiptonReduction]: Checked pairs total: 27035 [2023-08-03 20:39:21,630 INFO L136 LiptonReduction]: Total number of compositions: 186 [2023-08-03 20:39:21,631 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 20:39:21,632 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7fa503df, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 20:39:21,632 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-03 20:39:21,635 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 20:39:21,635 INFO L124 PetriNetUnfolderBase]: 4/32 cut-off events. [2023-08-03 20:39:21,635 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-03 20:39:21,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:39:21,635 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:39:21,635 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 20:39:21,635 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:39:21,635 INFO L85 PathProgramCache]: Analyzing trace with hash 2005627499, now seen corresponding path program 1 times [2023-08-03 20:39:21,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:39:21,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108271868] [2023-08-03 20:39:21,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:39:21,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:39:21,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:39:21,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 20:39:21,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:39:21,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108271868] [2023-08-03 20:39:21,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108271868] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:39:21,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 20:39:21,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 20:39:21,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837907687] [2023-08-03 20:39:21,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:39:21,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 20:39:21,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:39:21,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 20:39:21,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 20:39:21,682 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 420 [2023-08-03 20:39:21,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 73 transitions, 236 flow. Second operand has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:39:21,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:39:21,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 420 [2023-08-03 20:39:21,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:39:39,409 INFO L124 PetriNetUnfolderBase]: 282559/337065 cut-off events. [2023-08-03 20:39:39,410 INFO L125 PetriNetUnfolderBase]: For 35184/35184 co-relation queries the response was YES. [2023-08-03 20:39:40,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 685343 conditions, 337065 events. 282559/337065 cut-off events. For 35184/35184 co-relation queries the response was YES. Maximal size of possible extension queue 6293. Compared 1588640 event pairs, 121223 based on Foata normal form. 0/188807 useless extension candidates. Maximal degree in co-relation 224681. Up to 327393 conditions per place. [2023-08-03 20:39:41,178 INFO L140 encePairwiseOnDemand]: 416/420 looper letters, 59 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2023-08-03 20:39:41,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 76 transitions, 364 flow [2023-08-03 20:39:41,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 20:39:41,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 20:39:41,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 609 transitions. [2023-08-03 20:39:41,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2023-08-03 20:39:41,181 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 609 transitions. [2023-08-03 20:39:41,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 609 transitions. [2023-08-03 20:39:41,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:39:41,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 609 transitions. [2023-08-03 20:39:41,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:39:41,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 420.0) internal successors, (1680), 4 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:39:41,185 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 420.0) internal successors, (1680), 4 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:39:41,185 INFO L175 Difference]: Start difference. First operand has 61 places, 73 transitions, 236 flow. Second operand 3 states and 609 transitions. [2023-08-03 20:39:41,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 76 transitions, 364 flow [2023-08-03 20:39:41,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 76 transitions, 364 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 20:39:41,207 INFO L231 Difference]: Finished difference. Result has 63 places, 73 transitions, 246 flow [2023-08-03 20:39:41,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=246, PETRI_PLACES=63, PETRI_TRANSITIONS=73} [2023-08-03 20:39:41,208 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 2 predicate places. [2023-08-03 20:39:41,208 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 73 transitions, 246 flow [2023-08-03 20:39:41,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:39:41,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:39:41,209 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2023-08-03 20:39:41,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 20:39:41,209 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 20:39:41,210 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:39:41,210 INFO L85 PathProgramCache]: Analyzing trace with hash -2026015434, now seen corresponding path program 1 times [2023-08-03 20:39:41,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:39:41,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049218128] [2023-08-03 20:39:41,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:39:41,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:39:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:39:41,250 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 20:39:41,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:39:41,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049218128] [2023-08-03 20:39:41,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049218128] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:39:41,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339840426] [2023-08-03 20:39:41,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:39:41,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:39:41,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:39:41,253 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:39:41,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-03 20:39:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:39:41,324 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 20:39:41,325 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:39:41,358 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 20:39:41,358 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 20:39:41,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339840426] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:39:41,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 20:39:41,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-03 20:39:41,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327907385] [2023-08-03 20:39:41,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:39:41,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 20:39:41,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:39:41,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 20:39:41,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 20:39:41,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 420 [2023-08-03 20:39:41,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 73 transitions, 246 flow. Second operand has 5 states, 5 states have (on average 182.8) internal successors, (914), 5 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:39:41,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:39:41,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 420 [2023-08-03 20:39:41,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:39:58,985 INFO L124 PetriNetUnfolderBase]: 282509/337009 cut-off events. [2023-08-03 20:39:58,985 INFO L125 PetriNetUnfolderBase]: For 35164/35164 co-relation queries the response was YES. [2023-08-03 20:39:59,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 685241 conditions, 337009 events. 282509/337009 cut-off events. For 35164/35164 co-relation queries the response was YES. Maximal size of possible extension queue 6409. Compared 1589746 event pairs, 98664 based on Foata normal form. 9/188798 useless extension candidates. Maximal degree in co-relation 392073. Up to 327295 conditions per place. [2023-08-03 20:40:01,015 INFO L140 encePairwiseOnDemand]: 416/420 looper letters, 62 selfloop transitions, 4 changer transitions 0/80 dead transitions. [2023-08-03 20:40:01,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 80 transitions, 390 flow [2023-08-03 20:40:01,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 20:40:01,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 20:40:01,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 972 transitions. [2023-08-03 20:40:01,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46285714285714286 [2023-08-03 20:40:01,018 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 972 transitions. [2023-08-03 20:40:01,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 972 transitions. [2023-08-03 20:40:01,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:40:01,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 972 transitions. [2023-08-03 20:40:01,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 194.4) internal successors, (972), 5 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:40:01,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 420.0) internal successors, (2520), 6 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:40:01,023 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 420.0) internal successors, (2520), 6 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:40:01,023 INFO L175 Difference]: Start difference. First operand has 63 places, 73 transitions, 246 flow. Second operand 5 states and 972 transitions. [2023-08-03 20:40:01,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 80 transitions, 390 flow [2023-08-03 20:40:01,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 80 transitions, 380 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 20:40:01,048 INFO L231 Difference]: Finished difference. Result has 65 places, 73 transitions, 251 flow [2023-08-03 20:40:01,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=251, PETRI_PLACES=65, PETRI_TRANSITIONS=73} [2023-08-03 20:40:01,049 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 4 predicate places. [2023-08-03 20:40:01,049 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 73 transitions, 251 flow [2023-08-03 20:40:01,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 182.8) internal successors, (914), 5 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:40:01,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:40:01,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:40:01,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-03 20:40:01,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:40:01,254 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 20:40:01,254 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:40:01,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1635938419, now seen corresponding path program 1 times [2023-08-03 20:40:01,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:40:01,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615675989] [2023-08-03 20:40:01,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:40:01,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:40:01,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:40:01,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 20:40:01,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:40:01,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615675989] [2023-08-03 20:40:01,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615675989] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:40:01,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565828404] [2023-08-03 20:40:01,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:40:01,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:40:01,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:40:01,301 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:40:01,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-03 20:40:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:40:01,364 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 20:40:01,364 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:40:01,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 20:40:01,369 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 20:40:01,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565828404] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:40:01,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 20:40:01,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-03 20:40:01,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012681481] [2023-08-03 20:40:01,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:40:01,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 20:40:01,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:40:01,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 20:40:01,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 20:40:01,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 420 [2023-08-03 20:40:01,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 73 transitions, 251 flow. Second operand has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:40:01,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:40:01,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 420 [2023-08-03 20:40:01,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:40:18,361 INFO L124 PetriNetUnfolderBase]: 278777/332617 cut-off events. [2023-08-03 20:40:18,362 INFO L125 PetriNetUnfolderBase]: For 28847/28847 co-relation queries the response was YES. [2023-08-03 20:40:19,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 673655 conditions, 332617 events. 278777/332617 cut-off events. For 28847/28847 co-relation queries the response was YES. Maximal size of possible extension queue 6522. Compared 1588844 event pairs, 119869 based on Foata normal form. 0/186401 useless extension candidates. Maximal degree in co-relation 231660. Up to 322781 conditions per place. [2023-08-03 20:40:20,356 INFO L140 encePairwiseOnDemand]: 417/420 looper letters, 64 selfloop transitions, 3 changer transitions 0/81 dead transitions. [2023-08-03 20:40:20,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 81 transitions, 401 flow [2023-08-03 20:40:20,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 20:40:20,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 20:40:20,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 612 transitions. [2023-08-03 20:40:20,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2023-08-03 20:40:20,358 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 612 transitions. [2023-08-03 20:40:20,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 612 transitions. [2023-08-03 20:40:20,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:40:20,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 612 transitions. [2023-08-03 20:40:20,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:40:20,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 420.0) internal successors, (1680), 4 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:40:20,362 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 420.0) internal successors, (1680), 4 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:40:20,362 INFO L175 Difference]: Start difference. First operand has 65 places, 73 transitions, 251 flow. Second operand 3 states and 612 transitions. [2023-08-03 20:40:20,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 81 transitions, 401 flow [2023-08-03 20:40:20,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 81 transitions, 394 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-03 20:40:20,374 INFO L231 Difference]: Finished difference. Result has 66 places, 74 transitions, 259 flow [2023-08-03 20:40:20,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=259, PETRI_PLACES=66, PETRI_TRANSITIONS=74} [2023-08-03 20:40:20,376 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 5 predicate places. [2023-08-03 20:40:20,376 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 74 transitions, 259 flow [2023-08-03 20:40:20,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:40:20,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:40:20,376 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:40:20,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-03 20:40:20,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:40:20,580 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 20:40:20,581 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:40:20,581 INFO L85 PathProgramCache]: Analyzing trace with hash 930284318, now seen corresponding path program 1 times [2023-08-03 20:40:20,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:40:20,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560038264] [2023-08-03 20:40:20,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:40:20,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:40:20,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:40:20,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 20:40:20,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:40:20,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560038264] [2023-08-03 20:40:20,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560038264] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:40:20,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419207188] [2023-08-03 20:40:20,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:40:20,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:40:20,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:40:20,629 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:40:20,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-03 20:40:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:40:20,706 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 20:40:20,707 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:40:20,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-03 20:40:20,717 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 20:40:20,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419207188] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:40:20,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 20:40:20,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-03 20:40:20,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166168797] [2023-08-03 20:40:20,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:40:20,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 20:40:20,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:40:20,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 20:40:20,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 20:40:20,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 420 [2023-08-03 20:40:20,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 74 transitions, 259 flow. Second operand has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:40:20,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:40:20,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 420 [2023-08-03 20:40:20,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:40:39,306 INFO L124 PetriNetUnfolderBase]: 278153/334081 cut-off events. [2023-08-03 20:40:39,306 INFO L125 PetriNetUnfolderBase]: For 21696/21696 co-relation queries the response was YES. [2023-08-03 20:40:40,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 674690 conditions, 334081 events. 278153/334081 cut-off events. For 21696/21696 co-relation queries the response was YES. Maximal size of possible extension queue 7103. Compared 1675953 event pairs, 118825 based on Foata normal form. 0/188393 useless extension candidates. Maximal degree in co-relation 232257. Up to 318849 conditions per place. [2023-08-03 20:40:41,417 INFO L140 encePairwiseOnDemand]: 417/420 looper letters, 70 selfloop transitions, 2 changer transitions 0/86 dead transitions. [2023-08-03 20:40:41,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 86 transitions, 427 flow [2023-08-03 20:40:41,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 20:40:41,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 20:40:41,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 616 transitions. [2023-08-03 20:40:41,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2023-08-03 20:40:41,419 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 616 transitions. [2023-08-03 20:40:41,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 616 transitions. [2023-08-03 20:40:41,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:40:41,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 616 transitions. [2023-08-03 20:40:41,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:40:41,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 420.0) internal successors, (1680), 4 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:40:41,423 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 420.0) internal successors, (1680), 4 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:40:41,423 INFO L175 Difference]: Start difference. First operand has 66 places, 74 transitions, 259 flow. Second operand 3 states and 616 transitions. [2023-08-03 20:40:41,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 86 transitions, 427 flow [2023-08-03 20:40:41,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 86 transitions, 424 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 20:40:41,430 INFO L231 Difference]: Finished difference. Result has 68 places, 75 transitions, 268 flow [2023-08-03 20:40:41,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=68, PETRI_TRANSITIONS=75} [2023-08-03 20:40:41,430 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 7 predicate places. [2023-08-03 20:40:41,430 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 75 transitions, 268 flow [2023-08-03 20:40:41,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:40:41,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:40:41,431 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:40:41,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-03 20:40:41,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:40:41,635 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 20:40:41,636 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:40:41,636 INFO L85 PathProgramCache]: Analyzing trace with hash -395015766, now seen corresponding path program 1 times [2023-08-03 20:40:41,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:40:41,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542610760] [2023-08-03 20:40:41,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:40:41,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:40:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:40:41,688 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 20:40:41,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:40:41,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542610760] [2023-08-03 20:40:41,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542610760] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:40:41,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979643544] [2023-08-03 20:40:41,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:40:41,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:40:41,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:40:41,691 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:40:41,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-03 20:40:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:40:41,766 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 20:40:41,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:40:41,778 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 20:40:41,778 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:40:41,790 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 20:40:41,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979643544] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:40:41,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:40:41,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 20:40:41,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493224966] [2023-08-03 20:40:41,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:40:41,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 20:40:41,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:40:41,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 20:40:41,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 20:40:41,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 420 [2023-08-03 20:40:41,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 75 transitions, 268 flow. Second operand has 5 states, 5 states have (on average 183.8) internal successors, (919), 5 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:40:41,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:40:41,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 420 [2023-08-03 20:40:41,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:40:58,933 INFO L124 PetriNetUnfolderBase]: 270979/325098 cut-off events. [2023-08-03 20:40:58,933 INFO L125 PetriNetUnfolderBase]: For 22473/22473 co-relation queries the response was YES. [2023-08-03 20:40:59,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 659098 conditions, 325098 events. 270979/325098 cut-off events. For 22473/22473 co-relation queries the response was YES. Maximal size of possible extension queue 7112. Compared 1620287 event pairs, 95892 based on Foata normal form. 3/184668 useless extension candidates. Maximal degree in co-relation 186197. Up to 313776 conditions per place. [2023-08-03 20:41:01,041 INFO L140 encePairwiseOnDemand]: 417/420 looper letters, 64 selfloop transitions, 3 changer transitions 0/81 dead transitions. [2023-08-03 20:41:01,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 81 transitions, 410 flow [2023-08-03 20:41:01,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 20:41:01,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 20:41:01,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 790 transitions. [2023-08-03 20:41:01,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47023809523809523 [2023-08-03 20:41:01,044 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 790 transitions. [2023-08-03 20:41:01,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 790 transitions. [2023-08-03 20:41:01,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:41:01,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 790 transitions. [2023-08-03 20:41:01,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 197.5) internal successors, (790), 4 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:41:01,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 420.0) internal successors, (2100), 5 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:41:01,047 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 420.0) internal successors, (2100), 5 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:41:01,047 INFO L175 Difference]: Start difference. First operand has 68 places, 75 transitions, 268 flow. Second operand 4 states and 790 transitions. [2023-08-03 20:41:01,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 81 transitions, 410 flow [2023-08-03 20:41:01,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 81 transitions, 408 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 20:41:01,057 INFO L231 Difference]: Finished difference. Result has 70 places, 74 transitions, 264 flow [2023-08-03 20:41:01,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=264, PETRI_PLACES=70, PETRI_TRANSITIONS=74} [2023-08-03 20:41:01,058 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 9 predicate places. [2023-08-03 20:41:01,058 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 74 transitions, 264 flow [2023-08-03 20:41:01,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 183.8) internal successors, (919), 5 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:41:01,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:41:01,059 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:41:01,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-03 20:41:01,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:41:01,263 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 20:41:01,263 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:41:01,263 INFO L85 PathProgramCache]: Analyzing trace with hash 899980865, now seen corresponding path program 1 times [2023-08-03 20:41:01,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:41:01,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136523733] [2023-08-03 20:41:01,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:41:01,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:41:01,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:41:01,309 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 20:41:01,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:41:01,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136523733] [2023-08-03 20:41:01,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136523733] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:41:01,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230564520] [2023-08-03 20:41:01,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:41:01,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:41:01,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:41:01,312 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:41:01,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-03 20:41:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:41:01,380 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 20:41:01,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:41:01,400 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 20:41:01,400 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 20:41:01,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230564520] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:41:01,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 20:41:01,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-03 20:41:01,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67761131] [2023-08-03 20:41:01,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:41:01,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 20:41:01,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:41:01,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 20:41:01,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 20:41:01,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 420 [2023-08-03 20:41:01,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 74 transitions, 264 flow. Second operand has 5 states, 5 states have (on average 183.8) internal successors, (919), 5 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:41:01,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:41:01,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 420 [2023-08-03 20:41:01,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:41:18,123 INFO L124 PetriNetUnfolderBase]: 270385/324423 cut-off events. [2023-08-03 20:41:18,124 INFO L125 PetriNetUnfolderBase]: For 21950/21950 co-relation queries the response was YES. [2023-08-03 20:41:19,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 657379 conditions, 324423 events. 270385/324423 cut-off events. For 21950/21950 co-relation queries the response was YES. Maximal size of possible extension queue 7094. Compared 1615542 event pairs, 52863 based on Foata normal form. 81/184368 useless extension candidates. Maximal degree in co-relation 286135. Up to 312342 conditions per place. [2023-08-03 20:41:20,273 INFO L140 encePairwiseOnDemand]: 416/420 looper letters, 76 selfloop transitions, 4 changer transitions 0/93 dead transitions. [2023-08-03 20:41:20,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 93 transitions, 462 flow [2023-08-03 20:41:20,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 20:41:20,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 20:41:20,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 984 transitions. [2023-08-03 20:41:20,276 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4685714285714286 [2023-08-03 20:41:20,276 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 984 transitions. [2023-08-03 20:41:20,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 984 transitions. [2023-08-03 20:41:20,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:41:20,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 984 transitions. [2023-08-03 20:41:20,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 196.8) internal successors, (984), 5 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:41:20,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 420.0) internal successors, (2520), 6 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:41:20,280 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 420.0) internal successors, (2520), 6 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:41:20,280 INFO L175 Difference]: Start difference. First operand has 70 places, 74 transitions, 264 flow. Second operand 5 states and 984 transitions. [2023-08-03 20:41:20,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 93 transitions, 462 flow [2023-08-03 20:41:20,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 93 transitions, 448 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-03 20:41:20,295 INFO L231 Difference]: Finished difference. Result has 70 places, 74 transitions, 267 flow [2023-08-03 20:41:20,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=267, PETRI_PLACES=70, PETRI_TRANSITIONS=74} [2023-08-03 20:41:20,295 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 9 predicate places. [2023-08-03 20:41:20,295 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 74 transitions, 267 flow [2023-08-03 20:41:20,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 183.8) internal successors, (919), 5 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:41:20,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:41:20,296 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:41:20,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-03 20:41:20,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:41:20,500 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 20:41:20,500 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:41:20,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1374446388, now seen corresponding path program 1 times [2023-08-03 20:41:20,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:41:20,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84614862] [2023-08-03 20:41:20,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:41:20,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:41:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:41:20,536 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-03 20:41:20,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:41:20,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84614862] [2023-08-03 20:41:20,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84614862] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:41:20,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289591191] [2023-08-03 20:41:20,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:41:20,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:41:20,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:41:20,538 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:41:20,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-03 20:41:20,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:41:20,604 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 20:41:20,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:41:20,610 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 20:41:20,610 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 20:41:20,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289591191] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:41:20,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 20:41:20,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-03 20:41:20,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941834928] [2023-08-03 20:41:20,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:41:20,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 20:41:20,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:41:20,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 20:41:20,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 20:41:20,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 420 [2023-08-03 20:41:20,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 74 transitions, 267 flow. Second operand has 3 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:41:20,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:41:20,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 420 [2023-08-03 20:41:20,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:41:35,991 INFO L124 PetriNetUnfolderBase]: 230668/278064 cut-off events. [2023-08-03 20:41:35,991 INFO L125 PetriNetUnfolderBase]: For 14554/14554 co-relation queries the response was YES. [2023-08-03 20:41:37,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562562 conditions, 278064 events. 230668/278064 cut-off events. For 14554/14554 co-relation queries the response was YES. Maximal size of possible extension queue 6404. Compared 1394577 event pairs, 92028 based on Foata normal form. 0/158691 useless extension candidates. Maximal degree in co-relation 253648. Up to 230759 conditions per place. [2023-08-03 20:41:38,096 INFO L140 encePairwiseOnDemand]: 417/420 looper letters, 79 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2023-08-03 20:41:38,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 94 transitions, 483 flow [2023-08-03 20:41:38,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 20:41:38,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 20:41:38,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 624 transitions. [2023-08-03 20:41:38,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49523809523809526 [2023-08-03 20:41:38,098 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 624 transitions. [2023-08-03 20:41:38,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 624 transitions. [2023-08-03 20:41:38,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:41:38,098 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 624 transitions. [2023-08-03 20:41:38,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:41:38,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 420.0) internal successors, (1680), 4 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:41:38,101 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 420.0) internal successors, (1680), 4 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:41:38,101 INFO L175 Difference]: Start difference. First operand has 70 places, 74 transitions, 267 flow. Second operand 3 states and 624 transitions. [2023-08-03 20:41:38,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 94 transitions, 483 flow [2023-08-03 20:41:38,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 94 transitions, 476 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-03 20:41:38,113 INFO L231 Difference]: Finished difference. Result has 71 places, 75 transitions, 272 flow [2023-08-03 20:41:38,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=272, PETRI_PLACES=71, PETRI_TRANSITIONS=75} [2023-08-03 20:41:38,114 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 10 predicate places. [2023-08-03 20:41:38,114 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 75 transitions, 272 flow [2023-08-03 20:41:38,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:41:38,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:41:38,114 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:41:38,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-03 20:41:38,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:41:38,317 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 20:41:38,317 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:41:38,317 INFO L85 PathProgramCache]: Analyzing trace with hash -913534003, now seen corresponding path program 1 times [2023-08-03 20:41:38,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:41:38,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775721981] [2023-08-03 20:41:38,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:41:38,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:41:38,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:41:38,352 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-03 20:41:38,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:41:38,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775721981] [2023-08-03 20:41:38,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775721981] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:41:38,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797389823] [2023-08-03 20:41:38,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:41:38,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:41:38,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:41:38,354 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:41:38,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-03 20:41:38,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:41:38,432 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 20:41:38,435 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:41:38,445 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-03 20:41:38,446 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:41:38,460 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-03 20:41:38,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797389823] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:41:38,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:41:38,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 20:41:38,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276924558] [2023-08-03 20:41:38,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:41:38,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 20:41:38,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:41:38,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 20:41:38,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 20:41:38,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 420 [2023-08-03 20:41:38,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 75 transitions, 272 flow. Second operand has 5 states, 5 states have (on average 184.8) internal successors, (924), 5 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:41:38,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:41:38,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 420 [2023-08-03 20:41:38,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:41:52,932 INFO L124 PetriNetUnfolderBase]: 218491/263160 cut-off events. [2023-08-03 20:41:52,932 INFO L125 PetriNetUnfolderBase]: For 21347/21347 co-relation queries the response was YES. [2023-08-03 20:41:53,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 541883 conditions, 263160 events. 218491/263160 cut-off events. For 21347/21347 co-relation queries the response was YES. Maximal size of possible extension queue 6440. Compared 1319298 event pairs, 78674 based on Foata normal form. 27/153121 useless extension candidates. Maximal degree in co-relation 248918. Up to 253901 conditions per place. [2023-08-03 20:41:54,717 INFO L140 encePairwiseOnDemand]: 417/420 looper letters, 73 selfloop transitions, 3 changer transitions 0/89 dead transitions. [2023-08-03 20:41:54,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 89 transitions, 448 flow [2023-08-03 20:41:54,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 20:41:54,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 20:41:54,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 798 transitions. [2023-08-03 20:41:54,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2023-08-03 20:41:54,719 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 798 transitions. [2023-08-03 20:41:54,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 798 transitions. [2023-08-03 20:41:54,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:41:54,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 798 transitions. [2023-08-03 20:41:54,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 199.5) internal successors, (798), 4 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:41:54,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 420.0) internal successors, (2100), 5 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:41:54,723 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 420.0) internal successors, (2100), 5 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:41:54,723 INFO L175 Difference]: Start difference. First operand has 71 places, 75 transitions, 272 flow. Second operand 4 states and 798 transitions. [2023-08-03 20:41:54,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 89 transitions, 448 flow [2023-08-03 20:41:54,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 89 transitions, 446 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 20:41:54,867 INFO L231 Difference]: Finished difference. Result has 73 places, 74 transitions, 268 flow [2023-08-03 20:41:54,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=268, PETRI_PLACES=73, PETRI_TRANSITIONS=74} [2023-08-03 20:41:54,867 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 12 predicate places. [2023-08-03 20:41:54,867 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 74 transitions, 268 flow [2023-08-03 20:41:54,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 184.8) internal successors, (924), 5 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:41:54,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:41:54,868 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:41:54,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-03 20:41:55,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:41:55,073 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 20:41:55,073 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:41:55,073 INFO L85 PathProgramCache]: Analyzing trace with hash -2120234537, now seen corresponding path program 1 times [2023-08-03 20:41:55,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:41:55,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572144668] [2023-08-03 20:41:55,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:41:55,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:41:55,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:41:55,119 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-03 20:41:55,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:41:55,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572144668] [2023-08-03 20:41:55,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572144668] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:41:55,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613586293] [2023-08-03 20:41:55,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:41:55,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:41:55,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:41:55,121 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:41:55,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-03 20:41:55,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:41:55,200 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 20:41:55,201 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:41:55,212 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-03 20:41:55,212 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 20:41:55,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613586293] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:41:55,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 20:41:55,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-03 20:41:55,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448375874] [2023-08-03 20:41:55,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:41:55,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 20:41:55,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:41:55,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 20:41:55,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 20:41:55,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 420 [2023-08-03 20:41:55,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 74 transitions, 268 flow. Second operand has 5 states, 5 states have (on average 184.8) internal successors, (924), 5 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:41:55,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:41:55,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 420 [2023-08-03 20:41:55,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:42:08,811 INFO L124 PetriNetUnfolderBase]: 212659/255575 cut-off events. [2023-08-03 20:42:08,811 INFO L125 PetriNetUnfolderBase]: For 20129/20129 co-relation queries the response was YES. [2023-08-03 20:42:09,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525469 conditions, 255575 events. 212659/255575 cut-off events. For 20129/20129 co-relation queries the response was YES. Maximal size of possible extension queue 6299. Compared 1257576 event pairs, 10590 based on Foata normal form. 729/149154 useless extension candidates. Maximal degree in co-relation 243708. Up to 237039 conditions per place. [2023-08-03 20:42:10,358 INFO L140 encePairwiseOnDemand]: 416/420 looper letters, 89 selfloop transitions, 4 changer transitions 0/105 dead transitions. [2023-08-03 20:42:10,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 105 transitions, 516 flow [2023-08-03 20:42:10,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 20:42:10,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 20:42:10,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 996 transitions. [2023-08-03 20:42:10,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742857142857143 [2023-08-03 20:42:10,361 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 996 transitions. [2023-08-03 20:42:10,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 996 transitions. [2023-08-03 20:42:10,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:42:10,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 996 transitions. [2023-08-03 20:42:10,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 199.2) internal successors, (996), 5 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:42:10,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 420.0) internal successors, (2520), 6 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:42:10,364 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 420.0) internal successors, (2520), 6 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:42:10,365 INFO L175 Difference]: Start difference. First operand has 73 places, 74 transitions, 268 flow. Second operand 5 states and 996 transitions. [2023-08-03 20:42:10,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 105 transitions, 516 flow [2023-08-03 20:42:10,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 105 transitions, 502 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-03 20:42:10,489 INFO L231 Difference]: Finished difference. Result has 73 places, 74 transitions, 271 flow [2023-08-03 20:42:10,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=271, PETRI_PLACES=73, PETRI_TRANSITIONS=74} [2023-08-03 20:42:10,489 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 12 predicate places. [2023-08-03 20:42:10,489 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 74 transitions, 271 flow [2023-08-03 20:42:10,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 184.8) internal successors, (924), 5 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:42:10,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:42:10,490 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:42:10,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-03 20:42:10,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-03 20:42:10,693 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 20:42:10,693 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:42:10,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1691348527, now seen corresponding path program 1 times [2023-08-03 20:42:10,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:42:10,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108593871] [2023-08-03 20:42:10,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:42:10,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:42:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:42:10,728 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-03 20:42:10,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:42:10,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108593871] [2023-08-03 20:42:10,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108593871] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:42:10,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956199803] [2023-08-03 20:42:10,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:42:10,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:42:10,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:42:10,730 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:42:10,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-03 20:42:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:42:10,811 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 20:42:10,812 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:42:10,818 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-03 20:42:10,818 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 20:42:10,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956199803] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:42:10,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 20:42:10,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-03 20:42:10,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858082614] [2023-08-03 20:42:10,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:42:10,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 20:42:10,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:42:10,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 20:42:10,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 20:42:10,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 420 [2023-08-03 20:42:10,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 74 transitions, 271 flow. Second operand has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:42:10,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:42:10,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 420 [2023-08-03 20:42:10,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:42:23,942 INFO L124 PetriNetUnfolderBase]: 195528/237627 cut-off events. [2023-08-03 20:42:23,943 INFO L125 PetriNetUnfolderBase]: For 20564/20564 co-relation queries the response was YES. [2023-08-03 20:42:24,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489071 conditions, 237627 events. 195528/237627 cut-off events. For 20564/20564 co-relation queries the response was YES. Maximal size of possible extension queue 5066. Compared 1212442 event pairs, 71309 based on Foata normal form. 0/140917 useless extension candidates. Maximal degree in co-relation 235371. Up to 171899 conditions per place. [2023-08-03 20:42:25,549 INFO L140 encePairwiseOnDemand]: 417/420 looper letters, 80 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2023-08-03 20:42:25,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 94 transitions, 487 flow [2023-08-03 20:42:25,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 20:42:25,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 20:42:25,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 624 transitions. [2023-08-03 20:42:25,551 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49523809523809526 [2023-08-03 20:42:25,551 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 624 transitions. [2023-08-03 20:42:25,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 624 transitions. [2023-08-03 20:42:25,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:42:25,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 624 transitions. [2023-08-03 20:42:25,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:42:25,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 420.0) internal successors, (1680), 4 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:42:25,553 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 420.0) internal successors, (1680), 4 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:42:25,554 INFO L175 Difference]: Start difference. First operand has 73 places, 74 transitions, 271 flow. Second operand 3 states and 624 transitions. [2023-08-03 20:42:25,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 94 transitions, 487 flow [2023-08-03 20:42:25,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 94 transitions, 480 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-03 20:42:25,663 INFO L231 Difference]: Finished difference. Result has 74 places, 75 transitions, 276 flow [2023-08-03 20:42:25,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=74, PETRI_TRANSITIONS=75} [2023-08-03 20:42:25,664 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 13 predicate places. [2023-08-03 20:42:25,664 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 75 transitions, 276 flow [2023-08-03 20:42:25,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:42:25,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:42:25,664 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:42:25,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-03 20:42:25,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:42:25,865 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 20:42:25,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:42:25,865 INFO L85 PathProgramCache]: Analyzing trace with hash 2123665476, now seen corresponding path program 1 times [2023-08-03 20:42:25,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:42:25,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217782764] [2023-08-03 20:42:25,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:42:25,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:42:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:42:25,918 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-03 20:42:25,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:42:25,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217782764] [2023-08-03 20:42:25,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217782764] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:42:25,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828970833] [2023-08-03 20:42:25,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:42:25,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:42:25,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:42:25,920 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:42:25,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-03 20:42:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:42:26,001 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 20:42:26,002 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:42:26,009 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-03 20:42:26,009 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 20:42:26,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828970833] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:42:26,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 20:42:26,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-08-03 20:42:26,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686716249] [2023-08-03 20:42:26,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:42:26,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 20:42:26,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:42:26,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 20:42:26,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 20:42:26,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 420 [2023-08-03 20:42:26,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 75 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:42:26,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:42:26,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 420 [2023-08-03 20:42:26,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:42:40,169 INFO L124 PetriNetUnfolderBase]: 194462/237042 cut-off events. [2023-08-03 20:42:40,169 INFO L125 PetriNetUnfolderBase]: For 24557/24557 co-relation queries the response was YES. [2023-08-03 20:42:41,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 497044 conditions, 237042 events. 194462/237042 cut-off events. For 24557/24557 co-relation queries the response was YES. Maximal size of possible extension queue 4793. Compared 1216965 event pairs, 84459 based on Foata normal form. 0/143960 useless extension candidates. Maximal degree in co-relation 242597. Up to 202426 conditions per place. [2023-08-03 20:42:41,867 INFO L140 encePairwiseOnDemand]: 417/420 looper letters, 81 selfloop transitions, 2 changer transitions 0/95 dead transitions. [2023-08-03 20:42:41,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 95 transitions, 494 flow [2023-08-03 20:42:41,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 20:42:41,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 20:42:41,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 624 transitions. [2023-08-03 20:42:41,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49523809523809526 [2023-08-03 20:42:41,868 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 624 transitions. [2023-08-03 20:42:41,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 624 transitions. [2023-08-03 20:42:41,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:42:41,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 624 transitions. [2023-08-03 20:42:41,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:42:41,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 420.0) internal successors, (1680), 4 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:42:41,871 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 420.0) internal successors, (1680), 4 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:42:41,871 INFO L175 Difference]: Start difference. First operand has 74 places, 75 transitions, 276 flow. Second operand 3 states and 624 transitions. [2023-08-03 20:42:41,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 95 transitions, 494 flow [2023-08-03 20:42:44,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 95 transitions, 492 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 20:42:44,288 INFO L231 Difference]: Finished difference. Result has 76 places, 76 transitions, 286 flow [2023-08-03 20:42:44,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=286, PETRI_PLACES=76, PETRI_TRANSITIONS=76} [2023-08-03 20:42:44,289 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 15 predicate places. [2023-08-03 20:42:44,289 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 76 transitions, 286 flow [2023-08-03 20:42:44,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:42:44,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:42:44,289 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:42:44,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-03 20:42:44,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-03 20:42:44,493 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 20:42:44,493 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:42:44,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1977235426, now seen corresponding path program 1 times [2023-08-03 20:42:44,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:42:44,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929099072] [2023-08-03 20:42:44,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:42:44,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:42:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:42:44,533 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-03 20:42:44,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:42:44,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929099072] [2023-08-03 20:42:44,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929099072] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:42:44,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334036430] [2023-08-03 20:42:44,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:42:44,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:42:44,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:42:44,535 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:42:44,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-03 20:42:44,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:42:44,620 INFO L262 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 20:42:44,621 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:42:44,632 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-03 20:42:44,632 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:42:44,645 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-03 20:42:44,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334036430] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:42:44,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:42:44,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 20:42:44,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631720209] [2023-08-03 20:42:44,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:42:44,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 20:42:44,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:42:44,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 20:42:44,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 20:42:44,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 420 [2023-08-03 20:42:44,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 76 transitions, 286 flow. Second operand has 5 states, 5 states have (on average 188.0) internal successors, (940), 5 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:42:44,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:42:44,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 420 [2023-08-03 20:42:44,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:42:58,057 INFO L124 PetriNetUnfolderBase]: 188657/229941 cut-off events. [2023-08-03 20:42:58,058 INFO L125 PetriNetUnfolderBase]: For 22084/22084 co-relation queries the response was YES. [2023-08-03 20:42:58,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484107 conditions, 229941 events. 188657/229941 cut-off events. For 22084/22084 co-relation queries the response was YES. Maximal size of possible extension queue 5054. Compared 1202043 event pairs, 67625 based on Foata normal form. 243/140496 useless extension candidates. Maximal degree in co-relation 400633. Up to 212649 conditions per place. [2023-08-03 20:42:59,579 INFO L140 encePairwiseOnDemand]: 417/420 looper letters, 83 selfloop transitions, 3 changer transitions 0/98 dead transitions. [2023-08-03 20:42:59,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 98 transitions, 498 flow [2023-08-03 20:42:59,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 20:42:59,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 20:42:59,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 806 transitions. [2023-08-03 20:42:59,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4797619047619048 [2023-08-03 20:42:59,581 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 806 transitions. [2023-08-03 20:42:59,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 806 transitions. [2023-08-03 20:42:59,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:42:59,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 806 transitions. [2023-08-03 20:42:59,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 201.5) internal successors, (806), 4 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:42:59,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 420.0) internal successors, (2100), 5 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:42:59,584 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 420.0) internal successors, (2100), 5 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:42:59,584 INFO L175 Difference]: Start difference. First operand has 76 places, 76 transitions, 286 flow. Second operand 4 states and 806 transitions. [2023-08-03 20:42:59,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 98 transitions, 498 flow [2023-08-03 20:43:04,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 98 transitions, 496 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 20:43:04,733 INFO L231 Difference]: Finished difference. Result has 78 places, 75 transitions, 282 flow [2023-08-03 20:43:04,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=282, PETRI_PLACES=78, PETRI_TRANSITIONS=75} [2023-08-03 20:43:04,733 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 17 predicate places. [2023-08-03 20:43:04,733 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 75 transitions, 282 flow [2023-08-03 20:43:04,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 188.0) internal successors, (940), 5 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:43:04,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:43:04,734 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:43:04,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-08-03 20:43:04,938 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,SelfDestructingSolverStorable13 [2023-08-03 20:43:04,938 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 20:43:04,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:43:04,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1472343446, now seen corresponding path program 1 times [2023-08-03 20:43:04,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:43:04,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65070622] [2023-08-03 20:43:04,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:43:04,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:43:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:43:05,017 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-08-03 20:43:05,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:43:05,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65070622] [2023-08-03 20:43:05,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65070622] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:43:05,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190510473] [2023-08-03 20:43:05,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:43:05,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:43:05,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:43:05,019 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:43:05,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-03 20:43:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:43:05,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 20:43:05,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:43:05,120 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-08-03 20:43:05,120 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:43:05,136 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-08-03 20:43:05,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190510473] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:43:05,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:43:05,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 20:43:05,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535271390] [2023-08-03 20:43:05,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:43:05,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 20:43:05,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:43:05,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 20:43:05,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 20:43:05,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 420 [2023-08-03 20:43:05,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 75 transitions, 282 flow. Second operand has 5 states, 5 states have (on average 188.2) internal successors, (941), 5 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:43:05,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:43:05,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 420 [2023-08-03 20:43:05,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:43:13,574 INFO L124 PetriNetUnfolderBase]: 121202/148230 cut-off events. [2023-08-03 20:43:13,574 INFO L125 PetriNetUnfolderBase]: For 17421/17421 co-relation queries the response was YES. [2023-08-03 20:43:14,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311729 conditions, 148230 events. 121202/148230 cut-off events. For 17421/17421 co-relation queries the response was YES. Maximal size of possible extension queue 2635. Compared 719603 event pairs, 29065 based on Foata normal form. 1458/91500 useless extension candidates. Maximal degree in co-relation 290959. Up to 71816 conditions per place. [2023-08-03 20:43:14,448 INFO L140 encePairwiseOnDemand]: 416/420 looper letters, 91 selfloop transitions, 4 changer transitions 0/107 dead transitions. [2023-08-03 20:43:14,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 107 transitions, 548 flow [2023-08-03 20:43:14,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 20:43:14,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 20:43:14,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 815 transitions. [2023-08-03 20:43:14,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4851190476190476 [2023-08-03 20:43:14,450 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 815 transitions. [2023-08-03 20:43:14,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 815 transitions. [2023-08-03 20:43:14,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:43:14,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 815 transitions. [2023-08-03 20:43:14,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 203.75) internal successors, (815), 4 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:43:14,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 420.0) internal successors, (2100), 5 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:43:14,453 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 420.0) internal successors, (2100), 5 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:43:14,453 INFO L175 Difference]: Start difference. First operand has 78 places, 75 transitions, 282 flow. Second operand 4 states and 815 transitions. [2023-08-03 20:43:14,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 107 transitions, 548 flow [2023-08-03 20:43:15,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 107 transitions, 542 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 20:43:15,973 INFO L231 Difference]: Finished difference. Result has 80 places, 76 transitions, 296 flow [2023-08-03 20:43:15,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=296, PETRI_PLACES=80, PETRI_TRANSITIONS=76} [2023-08-03 20:43:15,974 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 19 predicate places. [2023-08-03 20:43:15,974 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 76 transitions, 296 flow [2023-08-03 20:43:15,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 188.2) internal successors, (941), 5 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:43:15,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:43:15,975 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:43:15,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-03 20:43:16,175 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,SelfDestructingSolverStorable14 [2023-08-03 20:43:16,175 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 20:43:16,175 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:43:16,175 INFO L85 PathProgramCache]: Analyzing trace with hash -206641084, now seen corresponding path program 1 times [2023-08-03 20:43:16,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:43:16,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548995162] [2023-08-03 20:43:16,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:43:16,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:43:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:43:16,225 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-08-03 20:43:16,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:43:16,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548995162] [2023-08-03 20:43:16,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548995162] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:43:16,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732623974] [2023-08-03 20:43:16,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:43:16,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:43:16,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:43:16,227 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:43:16,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-03 20:43:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:43:16,319 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 20:43:16,320 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:43:16,331 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-08-03 20:43:16,331 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:43:16,340 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-08-03 20:43:16,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732623974] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:43:16,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:43:16,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 20:43:16,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614028142] [2023-08-03 20:43:16,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:43:16,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 20:43:16,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:43:16,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 20:43:16,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 20:43:16,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 420 [2023-08-03 20:43:16,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 76 transitions, 296 flow. Second operand has 5 states, 5 states have (on average 188.6) internal successors, (943), 5 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:43:16,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:43:16,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 420 [2023-08-03 20:43:16,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:43:24,588 INFO L124 PetriNetUnfolderBase]: 115307/140698 cut-off events. [2023-08-03 20:43:24,588 INFO L125 PetriNetUnfolderBase]: For 34004/34004 co-relation queries the response was YES. [2023-08-03 20:43:25,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 309055 conditions, 140698 events. 115307/140698 cut-off events. For 34004/34004 co-relation queries the response was YES. Maximal size of possible extension queue 2635. Compared 673530 event pairs, 44506 based on Foata normal form. 694/85904 useless extension candidates. Maximal degree in co-relation 305954. Up to 101420 conditions per place. [2023-08-03 20:43:25,471 INFO L140 encePairwiseOnDemand]: 416/420 looper letters, 92 selfloop transitions, 4 changer transitions 0/108 dead transitions. [2023-08-03 20:43:25,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 108 transitions, 564 flow [2023-08-03 20:43:25,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 20:43:25,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 20:43:25,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 815 transitions. [2023-08-03 20:43:25,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4851190476190476 [2023-08-03 20:43:25,473 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 815 transitions. [2023-08-03 20:43:25,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 815 transitions. [2023-08-03 20:43:25,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:43:25,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 815 transitions. [2023-08-03 20:43:25,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 203.75) internal successors, (815), 4 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:43:25,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 420.0) internal successors, (2100), 5 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:43:25,476 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 420.0) internal successors, (2100), 5 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:43:25,476 INFO L175 Difference]: Start difference. First operand has 80 places, 76 transitions, 296 flow. Second operand 4 states and 815 transitions. [2023-08-03 20:43:25,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 108 transitions, 564 flow [2023-08-03 20:43:27,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 108 transitions, 560 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-03 20:43:27,073 INFO L231 Difference]: Finished difference. Result has 84 places, 77 transitions, 312 flow [2023-08-03 20:43:27,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=312, PETRI_PLACES=84, PETRI_TRANSITIONS=77} [2023-08-03 20:43:27,074 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 23 predicate places. [2023-08-03 20:43:27,074 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 77 transitions, 312 flow [2023-08-03 20:43:27,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 188.6) internal successors, (943), 5 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:43:27,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:43:27,074 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:43:27,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-03 20:43:27,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-03 20:43:27,275 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 20:43:27,275 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:43:27,275 INFO L85 PathProgramCache]: Analyzing trace with hash -2002749904, now seen corresponding path program 1 times [2023-08-03 20:43:27,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:43:27,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558969328] [2023-08-03 20:43:27,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:43:27,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:43:27,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:43:27,315 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-08-03 20:43:27,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:43:27,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558969328] [2023-08-03 20:43:27,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558969328] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:43:27,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751242692] [2023-08-03 20:43:27,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:43:27,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:43:27,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:43:27,317 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:43:27,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-03 20:43:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:43:27,419 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 20:43:27,420 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:43:27,429 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-08-03 20:43:27,429 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:43:27,439 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-08-03 20:43:27,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751242692] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:43:27,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:43:27,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 20:43:27,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257620711] [2023-08-03 20:43:27,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:43:27,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 20:43:27,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:43:27,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 20:43:27,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 20:43:27,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 420 [2023-08-03 20:43:27,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 77 transitions, 312 flow. Second operand has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:43:27,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:43:27,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 420 [2023-08-03 20:43:27,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:43:35,881 INFO L124 PetriNetUnfolderBase]: 115283/140657 cut-off events. [2023-08-03 20:43:35,882 INFO L125 PetriNetUnfolderBase]: For 33870/33870 co-relation queries the response was YES. [2023-08-03 20:43:36,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314204 conditions, 140657 events. 115283/140657 cut-off events. For 33870/33870 co-relation queries the response was YES. Maximal size of possible extension queue 2635. Compared 673191 event pairs, 57259 based on Foata normal form. 19/85200 useless extension candidates. Maximal degree in co-relation 311047. Up to 134406 conditions per place. [2023-08-03 20:43:36,966 INFO L140 encePairwiseOnDemand]: 416/420 looper letters, 91 selfloop transitions, 3 changer transitions 3/109 dead transitions. [2023-08-03 20:43:36,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 109 transitions, 582 flow [2023-08-03 20:43:36,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 20:43:36,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 20:43:36,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 815 transitions. [2023-08-03 20:43:36,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4851190476190476 [2023-08-03 20:43:36,968 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 815 transitions. [2023-08-03 20:43:36,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 815 transitions. [2023-08-03 20:43:36,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:43:36,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 815 transitions. [2023-08-03 20:43:36,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 203.75) internal successors, (815), 4 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:43:36,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 420.0) internal successors, (2100), 5 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:43:36,970 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 420.0) internal successors, (2100), 5 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:43:36,970 INFO L175 Difference]: Start difference. First operand has 84 places, 77 transitions, 312 flow. Second operand 4 states and 815 transitions. [2023-08-03 20:43:36,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 109 transitions, 582 flow [2023-08-03 20:43:40,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 109 transitions, 578 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-03 20:43:40,539 INFO L231 Difference]: Finished difference. Result has 88 places, 75 transitions, 310 flow [2023-08-03 20:43:40,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=310, PETRI_PLACES=88, PETRI_TRANSITIONS=75} [2023-08-03 20:43:40,539 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 27 predicate places. [2023-08-03 20:43:40,540 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 75 transitions, 310 flow [2023-08-03 20:43:40,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:43:40,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:43:40,540 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:43:40,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-03 20:43:40,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:43:40,742 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 20:43:40,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:43:40,743 INFO L85 PathProgramCache]: Analyzing trace with hash 22524300, now seen corresponding path program 1 times [2023-08-03 20:43:40,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:43:40,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299714845] [2023-08-03 20:43:40,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:43:40,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:43:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:43:40,840 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-08-03 20:43:40,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:43:40,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299714845] [2023-08-03 20:43:40,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299714845] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:43:40,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 20:43:40,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 20:43:40,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956306685] [2023-08-03 20:43:40,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:43:40,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 20:43:40,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:43:40,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 20:43:40,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 20:43:40,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 420 [2023-08-03 20:43:40,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 75 transitions, 310 flow. Second operand has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:43:40,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:43:40,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 420 [2023-08-03 20:43:40,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:43:47,874 INFO L124 PetriNetUnfolderBase]: 92554/111835 cut-off events. [2023-08-03 20:43:47,874 INFO L125 PetriNetUnfolderBase]: For 25645/25645 co-relation queries the response was YES. [2023-08-03 20:43:48,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244772 conditions, 111835 events. 92554/111835 cut-off events. For 25645/25645 co-relation queries the response was YES. Maximal size of possible extension queue 2311. Compared 503627 event pairs, 45875 based on Foata normal form. 1/66584 useless extension candidates. Maximal degree in co-relation 244502. Up to 107740 conditions per place. [2023-08-03 20:43:48,796 INFO L140 encePairwiseOnDemand]: 417/420 looper letters, 62 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2023-08-03 20:43:48,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 76 transitions, 440 flow [2023-08-03 20:43:48,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 20:43:48,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 20:43:48,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 596 transitions. [2023-08-03 20:43:48,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.473015873015873 [2023-08-03 20:43:48,797 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 596 transitions. [2023-08-03 20:43:48,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 596 transitions. [2023-08-03 20:43:48,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:43:48,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 596 transitions. [2023-08-03 20:43:48,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:43:48,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 420.0) internal successors, (1680), 4 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:43:48,799 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 420.0) internal successors, (1680), 4 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:43:48,800 INFO L175 Difference]: Start difference. First operand has 88 places, 75 transitions, 310 flow. Second operand 3 states and 596 transitions. [2023-08-03 20:43:48,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 76 transitions, 440 flow [2023-08-03 20:43:50,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 76 transitions, 430 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-03 20:43:50,812 INFO L231 Difference]: Finished difference. Result has 87 places, 76 transitions, 312 flow [2023-08-03 20:43:50,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=312, PETRI_PLACES=87, PETRI_TRANSITIONS=76} [2023-08-03 20:43:50,812 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 26 predicate places. [2023-08-03 20:43:50,812 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 76 transitions, 312 flow [2023-08-03 20:43:50,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:43:50,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:43:50,813 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:43:50,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-03 20:43:50,813 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 20:43:50,813 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:43:50,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1757890215, now seen corresponding path program 1 times [2023-08-03 20:43:50,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:43:50,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888350589] [2023-08-03 20:43:50,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:43:50,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:43:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:43:50,886 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-08-03 20:43:50,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:43:50,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888350589] [2023-08-03 20:43:50,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888350589] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:43:50,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885428031] [2023-08-03 20:43:50,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:43:50,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:43:50,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:43:50,889 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:43:50,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-03 20:43:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:43:50,997 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-03 20:43:50,998 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:43:51,021 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-08-03 20:43:51,021 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:43:51,042 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-08-03 20:43:51,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885428031] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-03 20:43:51,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-03 20:43:51,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2023-08-03 20:43:51,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530191784] [2023-08-03 20:43:51,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:43:51,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 20:43:51,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:43:51,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 20:43:51,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-08-03 20:43:51,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 420 [2023-08-03 20:43:51,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 76 transitions, 312 flow. Second operand has 5 states, 5 states have (on average 182.2) internal successors, (911), 5 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:43:51,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:43:51,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 420 [2023-08-03 20:43:51,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:43:59,487 INFO L124 PetriNetUnfolderBase]: 112829/136103 cut-off events. [2023-08-03 20:43:59,487 INFO L125 PetriNetUnfolderBase]: For 30814/30814 co-relation queries the response was YES. [2023-08-03 20:44:00,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297934 conditions, 136103 events. 112829/136103 cut-off events. For 30814/30814 co-relation queries the response was YES. Maximal size of possible extension queue 2761. Compared 636615 event pairs, 45876 based on Foata normal form. 0/84774 useless extension candidates. Maximal degree in co-relation 297905. Up to 103991 conditions per place. [2023-08-03 20:44:00,440 INFO L140 encePairwiseOnDemand]: 415/420 looper letters, 114 selfloop transitions, 4 changer transitions 0/129 dead transitions. [2023-08-03 20:44:00,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 129 transitions, 783 flow [2023-08-03 20:44:00,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 20:44:00,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 20:44:00,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 978 transitions. [2023-08-03 20:44:00,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4657142857142857 [2023-08-03 20:44:00,442 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 978 transitions. [2023-08-03 20:44:00,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 978 transitions. [2023-08-03 20:44:00,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:44:00,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 978 transitions. [2023-08-03 20:44:00,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 195.6) internal successors, (978), 5 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:44:00,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 420.0) internal successors, (2520), 6 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:44:00,445 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 420.0) internal successors, (2520), 6 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:44:00,445 INFO L175 Difference]: Start difference. First operand has 87 places, 76 transitions, 312 flow. Second operand 5 states and 978 transitions. [2023-08-03 20:44:00,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 129 transitions, 783 flow [2023-08-03 20:44:01,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 129 transitions, 779 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-03 20:44:01,875 INFO L231 Difference]: Finished difference. Result has 91 places, 77 transitions, 324 flow [2023-08-03 20:44:01,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=324, PETRI_PLACES=91, PETRI_TRANSITIONS=77} [2023-08-03 20:44:01,875 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 30 predicate places. [2023-08-03 20:44:01,876 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 77 transitions, 324 flow [2023-08-03 20:44:01,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 182.2) internal successors, (911), 5 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:44:01,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:44:01,876 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:44:01,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-03 20:44:02,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:44:02,076 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 20:44:02,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:44:02,077 INFO L85 PathProgramCache]: Analyzing trace with hash -2032457286, now seen corresponding path program 1 times [2023-08-03 20:44:02,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:44:02,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982411824] [2023-08-03 20:44:02,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:44:02,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:44:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:44:02,146 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-08-03 20:44:02,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:44:02,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982411824] [2023-08-03 20:44:02,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982411824] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:44:02,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884329644] [2023-08-03 20:44:02,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:44:02,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:44:02,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:44:02,148 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:44:02,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-03 20:44:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:44:02,254 INFO L262 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-03 20:44:02,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:44:02,296 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-08-03 20:44:02,296 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:44:02,324 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-08-03 20:44:02,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884329644] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:44:02,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:44:02,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2023-08-03 20:44:02,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114273042] [2023-08-03 20:44:02,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:44:02,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-03 20:44:02,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:44:02,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-03 20:44:02,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-08-03 20:44:02,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 420 [2023-08-03 20:44:02,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 77 transitions, 324 flow. Second operand has 9 states, 9 states have (on average 179.77777777777777) internal successors, (1618), 9 states have internal predecessors, (1618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:44:02,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:44:02,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 420 [2023-08-03 20:44:02,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:44:10,891 INFO L124 PetriNetUnfolderBase]: 107931/131203 cut-off events. [2023-08-03 20:44:10,891 INFO L125 PetriNetUnfolderBase]: For 41145/46051 co-relation queries the response was YES. [2023-08-03 20:44:11,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308023 conditions, 131203 events. 107931/131203 cut-off events. For 41145/46051 co-relation queries the response was YES. Maximal size of possible extension queue 2539. Compared 628499 event pairs, 45881 based on Foata normal form. 4906/89680 useless extension candidates. Maximal degree in co-relation 307986. Up to 100132 conditions per place. [2023-08-03 20:44:12,015 INFO L140 encePairwiseOnDemand]: 415/420 looper letters, 113 selfloop transitions, 4 changer transitions 0/128 dead transitions. [2023-08-03 20:44:12,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 128 transitions, 793 flow [2023-08-03 20:44:12,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 20:44:12,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 20:44:12,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 976 transitions. [2023-08-03 20:44:12,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46476190476190476 [2023-08-03 20:44:12,017 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 976 transitions. [2023-08-03 20:44:12,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 976 transitions. [2023-08-03 20:44:12,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:44:12,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 976 transitions. [2023-08-03 20:44:12,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 195.2) internal successors, (976), 5 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:44:12,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 420.0) internal successors, (2520), 6 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:44:12,020 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 420.0) internal successors, (2520), 6 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:44:12,020 INFO L175 Difference]: Start difference. First operand has 91 places, 77 transitions, 324 flow. Second operand 5 states and 976 transitions. [2023-08-03 20:44:12,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 128 transitions, 793 flow [2023-08-03 20:44:13,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 128 transitions, 782 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-03 20:44:13,290 INFO L231 Difference]: Finished difference. Result has 93 places, 78 transitions, 332 flow [2023-08-03 20:44:13,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=332, PETRI_PLACES=93, PETRI_TRANSITIONS=78} [2023-08-03 20:44:13,290 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 32 predicate places. [2023-08-03 20:44:13,290 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 78 transitions, 332 flow [2023-08-03 20:44:13,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 179.77777777777777) internal successors, (1618), 9 states have internal predecessors, (1618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:44:13,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:44:13,291 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:44:13,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-08-03 20:44:13,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:44:13,491 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 20:44:13,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:44:13,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1167357406, now seen corresponding path program 1 times [2023-08-03 20:44:13,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:44:13,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017772291] [2023-08-03 20:44:13,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:44:13,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:44:13,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:44:13,596 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-08-03 20:44:13,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:44:13,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017772291] [2023-08-03 20:44:13,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017772291] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:44:13,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935734581] [2023-08-03 20:44:13,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:44:13,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:44:13,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:44:13,598 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:44:13,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-03 20:44:13,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:44:13,711 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-03 20:44:13,712 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:44:13,788 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-08-03 20:44:13,788 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:44:13,849 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-08-03 20:44:13,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935734581] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:44:13,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:44:13,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-03 20:44:13,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587548454] [2023-08-03 20:44:13,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:44:13,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-03 20:44:13,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:44:13,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-03 20:44:13,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-08-03 20:44:14,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 420 [2023-08-03 20:44:14,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 78 transitions, 332 flow. Second operand has 13 states, 13 states have (on average 172.69230769230768) internal successors, (2245), 13 states have internal predecessors, (2245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:44:14,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:44:14,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 420 [2023-08-03 20:44:14,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:44:28,820 INFO L124 PetriNetUnfolderBase]: 181820/220872 cut-off events. [2023-08-03 20:44:28,820 INFO L125 PetriNetUnfolderBase]: For 99871/118066 co-relation queries the response was YES. [2023-08-03 20:44:29,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 548438 conditions, 220872 events. 181820/220872 cut-off events. For 99871/118066 co-relation queries the response was YES. Maximal size of possible extension queue 3882. Compared 1138971 event pairs, 9839 based on Foata normal form. 18195/169622 useless extension candidates. Maximal degree in co-relation 548400. Up to 74015 conditions per place. [2023-08-03 20:44:30,674 INFO L140 encePairwiseOnDemand]: 411/420 looper letters, 398 selfloop transitions, 18 changer transitions 0/426 dead transitions. [2023-08-03 20:44:30,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 426 transitions, 2672 flow [2023-08-03 20:44:30,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-03 20:44:30,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-03 20:44:30,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2553 transitions. [2023-08-03 20:44:30,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4675824175824176 [2023-08-03 20:44:30,679 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2553 transitions. [2023-08-03 20:44:30,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2553 transitions. [2023-08-03 20:44:30,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:44:30,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2553 transitions. [2023-08-03 20:44:30,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 196.3846153846154) internal successors, (2553), 13 states have internal predecessors, (2553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:44:30,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 420.0) internal successors, (5880), 14 states have internal predecessors, (5880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:44:30,686 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 420.0) internal successors, (5880), 14 states have internal predecessors, (5880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:44:30,686 INFO L175 Difference]: Start difference. First operand has 93 places, 78 transitions, 332 flow. Second operand 13 states and 2553 transitions. [2023-08-03 20:44:30,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 426 transitions, 2672 flow [2023-08-03 20:44:32,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 426 transitions, 2640 flow, removed 9 selfloop flow, removed 3 redundant places. [2023-08-03 20:44:32,977 INFO L231 Difference]: Finished difference. Result has 108 places, 94 transitions, 438 flow [2023-08-03 20:44:32,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=438, PETRI_PLACES=108, PETRI_TRANSITIONS=94} [2023-08-03 20:44:32,978 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 47 predicate places. [2023-08-03 20:44:32,978 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 94 transitions, 438 flow [2023-08-03 20:44:32,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 172.69230769230768) internal successors, (2245), 13 states have internal predecessors, (2245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:44:32,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:44:32,978 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:44:32,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-08-03 20:44:33,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:44:33,185 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 20:44:33,186 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:44:33,186 INFO L85 PathProgramCache]: Analyzing trace with hash -2083016496, now seen corresponding path program 1 times [2023-08-03 20:44:33,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:44:33,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147090052] [2023-08-03 20:44:33,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:44:33,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:44:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:44:33,287 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-08-03 20:44:33,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:44:33,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147090052] [2023-08-03 20:44:33,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147090052] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:44:33,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508081210] [2023-08-03 20:44:33,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:44:33,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:44:33,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:44:33,293 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:44:33,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-08-03 20:44:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:44:33,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-03 20:44:33,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:44:33,498 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-08-03 20:44:33,498 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:44:33,571 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-08-03 20:44:33,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508081210] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:44:33,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:44:33,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-03 20:44:33,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759814008] [2023-08-03 20:44:33,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:44:33,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-03 20:44:33,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:44:33,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-03 20:44:33,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-08-03 20:44:33,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 420 [2023-08-03 20:44:33,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 94 transitions, 438 flow. Second operand has 13 states, 13 states have (on average 172.69230769230768) internal successors, (2245), 13 states have internal predecessors, (2245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:44:33,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:44:33,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 420 [2023-08-03 20:44:33,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:45:07,122 INFO L124 PetriNetUnfolderBase]: 318942/397276 cut-off events. [2023-08-03 20:45:07,122 INFO L125 PetriNetUnfolderBase]: For 607922/691433 co-relation queries the response was YES. [2023-08-03 20:45:09,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1198325 conditions, 397276 events. 318942/397276 cut-off events. For 607922/691433 co-relation queries the response was YES. Maximal size of possible extension queue 7356. Compared 2315502 event pairs, 22766 based on Foata normal form. 65855/375908 useless extension candidates. Maximal degree in co-relation 1198280. Up to 133921 conditions per place. [2023-08-03 20:45:11,045 INFO L140 encePairwiseOnDemand]: 411/420 looper letters, 482 selfloop transitions, 18 changer transitions 0/514 dead transitions. [2023-08-03 20:45:11,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 514 transitions, 3488 flow [2023-08-03 20:45:11,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-03 20:45:11,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-03 20:45:11,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2537 transitions. [2023-08-03 20:45:11,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46465201465201467 [2023-08-03 20:45:11,049 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2537 transitions. [2023-08-03 20:45:11,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2537 transitions. [2023-08-03 20:45:11,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:45:11,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2537 transitions. [2023-08-03 20:45:11,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 195.15384615384616) internal successors, (2537), 13 states have internal predecessors, (2537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:45:11,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 420.0) internal successors, (5880), 14 states have internal predecessors, (5880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:45:11,057 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 420.0) internal successors, (5880), 14 states have internal predecessors, (5880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:45:11,057 INFO L175 Difference]: Start difference. First operand has 108 places, 94 transitions, 438 flow. Second operand 13 states and 2537 transitions. [2023-08-03 20:45:11,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 514 transitions, 3488 flow [2023-08-03 20:45:24,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 514 transitions, 3359 flow, removed 63 selfloop flow, removed 2 redundant places. [2023-08-03 20:45:24,986 INFO L231 Difference]: Finished difference. Result has 124 places, 110 transitions, 535 flow [2023-08-03 20:45:24,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=535, PETRI_PLACES=124, PETRI_TRANSITIONS=110} [2023-08-03 20:45:24,987 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 63 predicate places. [2023-08-03 20:45:24,987 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 110 transitions, 535 flow [2023-08-03 20:45:24,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 172.69230769230768) internal successors, (2245), 13 states have internal predecessors, (2245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:45:24,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:45:24,987 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:45:24,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-08-03 20:45:25,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:45:25,188 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 20:45:25,188 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:45:25,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1007199490, now seen corresponding path program 1 times [2023-08-03 20:45:25,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:45:25,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161988177] [2023-08-03 20:45:25,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:45:25,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:45:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:45:25,926 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-08-03 20:45:25,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:45:25,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161988177] [2023-08-03 20:45:25,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161988177] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:45:25,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594288753] [2023-08-03 20:45:25,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:45:25,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:45:25,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:45:25,928 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:45:25,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-08-03 20:45:26,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:45:26,059 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 54 conjunts are in the unsatisfiable core [2023-08-03 20:45:26,061 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:45:26,119 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-03 20:45:26,196 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-03 20:45:26,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 20:45:26,362 INFO L351 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 34 treesize of output 32 [2023-08-03 20:45:26,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 20:45:26,617 INFO L351 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 34 treesize of output 32 [2023-08-03 20:45:26,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 20:45:26,700 INFO L351 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 34 treesize of output 32 [2023-08-03 20:45:26,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 20:45:26,806 INFO L351 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 34 treesize of output 32 [2023-08-03 20:45:26,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 20:45:26,875 INFO L351 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 34 treesize of output 32 [2023-08-03 20:45:27,168 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 20:45:27,170 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 20:45:27,170 INFO L351 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 97 treesize of output 52 [2023-08-03 20:45:27,354 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-03 20:45:27,355 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:45:27,624 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or (= c_~max1~0 c_~max2~0) (forall ((v_ArrVal_1018 (Array Int Int))) (< c_~max2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1018) c_~A~0.base) .cse0)))) (forall ((v_ArrVal_1018 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1018) c_~A~0.base) .cse0))) (or (<= .cse1 c_~max2~0) (= .cse1 c_~max1~0)))))) is different from false [2023-08-03 20:45:27,705 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int))) (< c_~max2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1016) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1018) c_~A~0.base) .cse0))) (= c_~max1~0 c_~max2~0)) (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1016) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1018) c_~A~0.base) .cse0))) (or (= c_~max1~0 .cse1) (<= .cse1 c_~max2~0)))))) is different from false [2023-08-03 20:45:28,157 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_1014 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1014))) (or (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int))) (let ((.cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1016) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1018) c_~A~0.base) .cse2))) (or (<= .cse0 c_~max2~0) (= .cse0 c_~max1~0)))) (< c_~max1~0 (select (select .cse1 c_~A~0.base) c_~A~0.offset))))) (forall ((v_ArrVal_1014 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1014))) (let ((.cse3 (select (select .cse5 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int))) (let ((.cse4 (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1016) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1018) c_~A~0.base) .cse2))) (or (= .cse3 .cse4) (<= .cse4 c_~max2~0)))) (<= .cse3 c_~max1~0))))) (forall ((v_ArrVal_1014 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1014))) (let ((.cse6 (select (select .cse7 c_~A~0.base) c_~A~0.offset))) (or (= .cse6 c_~max2~0) (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int))) (< c_~max2~0 (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1016) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1018) c_~A~0.base) .cse2))) (<= .cse6 c_~max1~0))))) (or (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1014 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1014))) (or (< c_~max2~0 (select (select (store (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1016) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1018) c_~A~0.base) .cse2)) (< c_~max1~0 (select (select .cse8 c_~A~0.base) c_~A~0.offset))))) (= c_~max1~0 c_~max2~0)))) is different from false [2023-08-03 20:45:28,633 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse0 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (and (or (<= .cse0 c_~max1~0) (and (forall ((v_ArrVal_1014 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1014))) (let ((.cse1 (select (select .cse2 c_~A~0.base) c_~A~0.offset))) (or (<= .cse1 .cse0) (= .cse1 c_~max2~0) (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int))) (< c_~max2~0 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1016) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1018) c_~A~0.base) .cse3))))))) (or (= .cse0 c_~max2~0) (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1014 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1014))) (or (< c_~max2~0 (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1016) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1018) c_~A~0.base) .cse3)) (< .cse0 (select (select .cse4 c_~A~0.base) c_~A~0.offset)))))) (forall ((v_ArrVal_1014 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1014))) (let ((.cse5 (select (select .cse7 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int))) (let ((.cse6 (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1016) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1018) c_~A~0.base) .cse3))) (or (= .cse5 .cse6) (<= .cse6 c_~max2~0)))) (<= .cse5 .cse0))))) (forall ((v_ArrVal_1014 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1014))) (or (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int))) (let ((.cse8 (select (select (store (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1016) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1018) c_~A~0.base) .cse3))) (or (= .cse0 .cse8) (<= .cse8 c_~max2~0)))) (< .cse0 (select (select .cse9 c_~A~0.base) c_~A~0.offset))))))) (or (and (forall ((v_ArrVal_1014 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1014))) (or (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int))) (let ((.cse10 (select (select (store (store .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1016) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1018) c_~A~0.base) .cse3))) (or (<= .cse10 c_~max2~0) (= .cse10 c_~max1~0)))) (< c_~max1~0 (select (select .cse11 c_~A~0.base) c_~A~0.offset))))) (forall ((v_ArrVal_1014 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1014))) (let ((.cse12 (select (select .cse14 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int))) (let ((.cse13 (select (select (store (store .cse14 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1016) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1018) c_~A~0.base) .cse3))) (or (= .cse12 .cse13) (<= .cse13 c_~max2~0)))) (<= .cse12 c_~max1~0))))) (forall ((v_ArrVal_1014 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1014))) (let ((.cse15 (select (select .cse16 c_~A~0.base) c_~A~0.offset))) (or (= .cse15 c_~max2~0) (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int))) (< c_~max2~0 (select (select (store (store .cse16 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1016) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1018) c_~A~0.base) .cse3))) (<= .cse15 c_~max1~0))))) (or (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1014 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1014))) (or (< c_~max2~0 (select (select (store (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1016) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1018) c_~A~0.base) .cse3)) (< c_~max1~0 (select (select .cse17 c_~A~0.base) c_~A~0.offset))))) (= c_~max1~0 c_~max2~0))) (< c_~max1~0 .cse0)))) is different from false [2023-08-03 20:45:28,865 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_1013 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1013) c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_1014 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1014))) (let ((.cse0 (select (select .cse2 c_~A~0.base) c_~A~0.offset))) (or (<= .cse0 .cse1) (= .cse0 c_~max2~0) (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int))) (< c_~max2~0 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1016) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1018) c_~A~0.base) .cse3))))))) (<= .cse1 c_~max1~0)))) (forall ((v_ArrVal_1013 (Array Int Int))) (let ((.cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1013) c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_1014 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1014))) (or (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int))) (let ((.cse4 (select (select (store (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1016) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1018) c_~A~0.base) .cse3))) (or (= .cse4 .cse5) (<= .cse4 c_~max2~0)))) (< .cse5 (select (select .cse6 c_~A~0.base) c_~A~0.offset))))) (<= .cse5 c_~max1~0)))) (forall ((v_ArrVal_1013 (Array Int Int))) (let ((.cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1013) c_~A~0.base) c_~A~0.offset))) (or (= .cse7 c_~max2~0) (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1014 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1014))) (or (< c_~max2~0 (select (select (store (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1016) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1018) c_~A~0.base) .cse3)) (< .cse7 (select (select .cse8 c_~A~0.base) c_~A~0.offset))))) (<= .cse7 c_~max1~0)))) (or (and (forall ((v_ArrVal_1014 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1014))) (or (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int))) (let ((.cse9 (select (select (store (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1016) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1018) c_~A~0.base) .cse3))) (or (<= .cse9 c_~max2~0) (= .cse9 c_~max1~0)))) (< c_~max1~0 (select (select .cse10 c_~A~0.base) c_~A~0.offset))))) (forall ((v_ArrVal_1014 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1014))) (let ((.cse11 (select (select .cse13 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int))) (let ((.cse12 (select (select (store (store .cse13 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1016) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1018) c_~A~0.base) .cse3))) (or (= .cse11 .cse12) (<= .cse12 c_~max2~0)))) (<= .cse11 c_~max1~0))))) (forall ((v_ArrVal_1014 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1014))) (let ((.cse14 (select (select .cse15 c_~A~0.base) c_~A~0.offset))) (or (= .cse14 c_~max2~0) (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int))) (< c_~max2~0 (select (select (store (store .cse15 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1016) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1018) c_~A~0.base) .cse3))) (<= .cse14 c_~max1~0))))) (or (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1014 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1014))) (or (< c_~max2~0 (select (select (store (store .cse16 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1016) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1018) c_~A~0.base) .cse3)) (< c_~max1~0 (select (select .cse16 c_~A~0.base) c_~A~0.offset))))) (= c_~max1~0 c_~max2~0))) (forall ((v_ArrVal_1013 (Array Int Int))) (< c_~max1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1013) c_~A~0.base) c_~A~0.offset)))) (forall ((v_ArrVal_1013 (Array Int Int))) (let ((.cse20 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1013) c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_1014 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1014))) (let ((.cse17 (select (select .cse19 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int))) (let ((.cse18 (select (select (store (store .cse19 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1016) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1018) c_~A~0.base) .cse3))) (or (= .cse17 .cse18) (<= .cse18 c_~max2~0)))) (<= .cse17 .cse20))))) (<= .cse20 c_~max1~0)))))) is different from false [2023-08-03 20:45:44,932 WARN L233 SmtUtils]: Spent 15.76s on a formula simplification that was a NOOP. DAG size: 98 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 20:45:45,016 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 20:45:45,017 INFO L351 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 147 treesize of output 87 [2023-08-03 20:45:45,030 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 20:45:45,031 INFO L351 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 1073 treesize of output 957 [2023-08-03 20:45:45,053 INFO L351 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 69 treesize of output 57 [2023-08-03 20:45:45,059 INFO L351 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 127 treesize of output 103 [2023-08-03 20:45:45,070 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 20:45:45,070 INFO L351 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 90 treesize of output 76 [2023-08-03 20:45:45,079 INFO L351 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 11 treesize of output 7 [2023-08-03 20:45:45,162 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 20:45:45,163 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 70 [2023-08-03 20:45:45,174 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 20:45:45,174 INFO L351 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 393 treesize of output 365 [2023-08-03 20:45:45,188 INFO L351 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 [2023-08-03 20:45:45,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 20:45:45,193 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 30 [2023-08-03 20:45:45,197 INFO L351 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 32 treesize of output 20 [2023-08-03 20:45:45,208 INFO L351 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 11 treesize of output 7 [2023-08-03 20:45:45,230 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 20:45:45,230 INFO L351 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 376 treesize of output 232 [2023-08-03 20:45:45,298 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 20:45:45,299 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 5559 treesize of output 5095 [2023-08-03 20:45:45,377 INFO L351 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 5 treesize of output 3 [2023-08-03 20:45:45,397 INFO L351 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 935 treesize of output 911 [2023-08-03 20:45:45,417 INFO L351 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 911 treesize of output 887 [2023-08-03 20:45:45,449 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 20:45:45,450 INFO L351 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 887 treesize of output 888 [2023-08-03 20:45:45,472 INFO L351 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 879 treesize of output 867 [2023-08-03 20:45:45,503 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 20:45:45,503 INFO L351 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 867 treesize of output 866 [2023-08-03 20:45:45,526 INFO L351 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 857 treesize of output 833 [2023-08-03 20:45:45,555 INFO L351 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 833 treesize of output 821 [2023-08-03 20:45:45,591 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 20:45:45,591 INFO L351 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 821 treesize of output 808 [2023-08-03 20:45:45,617 INFO L351 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 799 treesize of output 751 [2023-08-03 20:45:45,641 INFO L351 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 751 treesize of output 703 [2023-08-03 20:45:45,675 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 20:45:45,676 INFO L351 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 703 treesize of output 698 [2023-08-03 20:45:45,700 INFO L351 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 689 treesize of output 665 [2023-08-03 20:45:47,079 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 20:45:47,080 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 70 [2023-08-03 20:45:47,096 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 20:45:47,096 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 20:45:47,109 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 20:45:47,109 INFO L351 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 102 treesize of output 86 [2023-08-03 20:45:47,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 20:45:47,121 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-08-03 20:45:47,131 INFO L351 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 28 treesize of output 22 [2023-08-03 20:45:47,143 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-03 20:45:47,143 INFO L351 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 147 treesize of output 1 [2023-08-03 20:45:47,214 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 17 not checked. [2023-08-03 20:45:47,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594288753] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:45:47,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:45:47,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 14] total 38 [2023-08-03 20:45:47,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679446457] [2023-08-03 20:45:47,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:45:47,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-08-03 20:45:47,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:45:47,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-08-03 20:45:47,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1004, Unknown=9, NotChecked=340, Total=1482 [2023-08-03 20:45:47,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 420 [2023-08-03 20:45:47,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 110 transitions, 535 flow. Second operand has 39 states, 39 states have (on average 106.28205128205128) internal successors, (4145), 39 states have internal predecessors, (4145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:45:47,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:45:47,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 420 [2023-08-03 20:45:47,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:46:19,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 20:46:24,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 20:47:05,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]