/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 INSUFFICIENT_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/weaver_test-easy6.wvr_bound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 03:31:10,229 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 03:31:10,303 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 03:31:10,308 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 03:31:10,308 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 03:31:10,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 03:31:10,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 03:31:10,336 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 03:31:10,336 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 03:31:10,340 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 03:31:10,340 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 03:31:10,340 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 03:31:10,341 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 03:31:10,342 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 03:31:10,343 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 03:31:10,343 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 03:31:10,343 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 03:31:10,343 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 03:31:10,344 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 03:31:10,344 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 03:31:10,344 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 03:31:10,344 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 03:31:10,345 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 03:31:10,345 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 03:31:10,345 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 03:31:10,345 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 03:31:10,345 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 03:31:10,346 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 03:31:10,346 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 03:31:10,346 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 03:31:10,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 03:31:10,347 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 03:31:10,348 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 03:31:10,348 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 03:31:10,348 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 03:31:10,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 03:31:10,348 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 03:31:10,348 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 03:31:10,349 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 03:31:10,349 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 03:31:10,349 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 03:31:10,349 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 -> INSUFFICIENT_FIRST [2023-08-04 03:31:10,563 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 03:31:10,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 03:31:10,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 03:31:10,588 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 03:31:10,589 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 03:31:10,589 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/weaver_test-easy6.wvr_bound2.c [2023-08-04 03:31:11,728 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 03:31:11,929 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 03:31:11,930 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/weaver_test-easy6.wvr_bound2.c [2023-08-04 03:31:11,939 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e43b1273/3b85daec80f84ca78be060163cd6d725/FLAGb09e26f54 [2023-08-04 03:31:11,954 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e43b1273/3b85daec80f84ca78be060163cd6d725 [2023-08-04 03:31:11,959 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 03:31:11,960 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 03:31:11,963 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 03:31:11,963 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 03:31:11,966 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 03:31:11,966 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 03:31:11" (1/1) ... [2023-08-04 03:31:11,967 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ed613a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:31:11, skipping insertion in model container [2023-08-04 03:31:11,967 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 03:31:11" (1/1) ... [2023-08-04 03:31:11,995 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 03:31:12,170 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_test-easy6.wvr_bound2.c[3208,3221] [2023-08-04 03:31:12,171 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 03:31:12,183 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 03:31:12,220 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_test-easy6.wvr_bound2.c[3208,3221] [2023-08-04 03:31:12,221 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 03:31:12,227 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 03:31:12,228 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 03:31:12,238 INFO L206 MainTranslator]: Completed translation [2023-08-04 03:31:12,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:31:12 WrapperNode [2023-08-04 03:31:12,239 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 03:31:12,240 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 03:31:12,240 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 03:31:12,240 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 03:31:12,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:31:12" (1/1) ... [2023-08-04 03:31:12,259 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:31:12" (1/1) ... [2023-08-04 03:31:12,287 INFO L138 Inliner]: procedures = 21, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 155 [2023-08-04 03:31:12,287 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 03:31:12,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 03:31:12,288 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 03:31:12,288 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 03:31:12,295 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:31:12" (1/1) ... [2023-08-04 03:31:12,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:31:12" (1/1) ... [2023-08-04 03:31:12,298 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:31:12" (1/1) ... [2023-08-04 03:31:12,298 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:31:12" (1/1) ... [2023-08-04 03:31:12,302 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:31:12" (1/1) ... [2023-08-04 03:31:12,304 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:31:12" (1/1) ... [2023-08-04 03:31:12,305 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:31:12" (1/1) ... [2023-08-04 03:31:12,306 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:31:12" (1/1) ... [2023-08-04 03:31:12,308 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 03:31:12,309 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 03:31:12,309 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 03:31:12,309 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 03:31:12,310 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:31:12" (1/1) ... [2023-08-04 03:31:12,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 03:31:12,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:31:12,338 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-04 03:31:12,364 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-04 03:31:12,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 03:31:12,374 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-04 03:31:12,374 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-04 03:31:12,374 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-04 03:31:12,375 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-04 03:31:12,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 03:31:12,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 03:31:12,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 03:31:12,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 03:31:12,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 03:31:12,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 03:31:12,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 03:31:12,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 03:31:12,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 03:31:12,378 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 03:31:12,480 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 03:31:12,482 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 03:31:12,724 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 03:31:12,779 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 03:31:12,779 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-04 03:31:12,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 03:31:12 BoogieIcfgContainer [2023-08-04 03:31:12,782 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 03:31:12,783 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 03:31:12,783 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 03:31:12,789 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 03:31:12,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 03:31:11" (1/3) ... [2023-08-04 03:31:12,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3086e851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 03:31:12, skipping insertion in model container [2023-08-04 03:31:12,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:31:12" (2/3) ... [2023-08-04 03:31:12,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3086e851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 03:31:12, skipping insertion in model container [2023-08-04 03:31:12,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 03:31:12" (3/3) ... [2023-08-04 03:31:12,794 INFO L112 eAbstractionObserver]: Analyzing ICFG weaver_test-easy6.wvr_bound2.c [2023-08-04 03:31:12,801 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 03:31:12,809 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 03:31:12,809 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-04 03:31:12,809 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 03:31:12,878 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-04 03:31:12,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 108 transitions, 238 flow [2023-08-04 03:31:12,983 INFO L124 PetriNetUnfolderBase]: 26/249 cut-off events. [2023-08-04 03:31:12,983 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2023-08-04 03:31:12,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 249 events. 26/249 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 965 event pairs, 0 based on Foata normal form. 0/213 useless extension candidates. Maximal degree in co-relation 125. Up to 8 conditions per place. [2023-08-04 03:31:12,989 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 108 transitions, 238 flow [2023-08-04 03:31:12,992 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 68 transitions, 146 flow [2023-08-04 03:31:12,996 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 03:31:13,003 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 68 transitions, 146 flow [2023-08-04 03:31:13,005 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 68 transitions, 146 flow [2023-08-04 03:31:13,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 68 transitions, 146 flow [2023-08-04 03:31:13,034 INFO L124 PetriNetUnfolderBase]: 2/105 cut-off events. [2023-08-04 03:31:13,034 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:31:13,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 191 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 64. Up to 4 conditions per place. [2023-08-04 03:31:13,036 INFO L119 LiptonReduction]: Number of co-enabled transitions 990 [2023-08-04 03:31:14,509 INFO L134 LiptonReduction]: Checked pairs total: 4452 [2023-08-04 03:31:14,510 INFO L136 LiptonReduction]: Total number of compositions: 44 [2023-08-04 03:31:14,521 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 03:31:14,526 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;@4c5f8e85, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 03:31:14,527 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 03:31:14,531 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 03:31:14,531 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2023-08-04 03:31:14,531 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:31:14,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:31:14,532 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 03:31:14,533 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 03:31:14,537 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:31:14,537 INFO L85 PathProgramCache]: Analyzing trace with hash 397718277, now seen corresponding path program 1 times [2023-08-04 03:31:14,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:31:14,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423630148] [2023-08-04 03:31:14,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:31:14,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:31:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:31:14,766 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-04 03:31:14,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:31:14,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423630148] [2023-08-04 03:31:14,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423630148] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:31:14,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:31:14,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 03:31:14,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718725917] [2023-08-04 03:31:14,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:31:14,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:31:14,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:31:14,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:31:14,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 03:31:14,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 152 [2023-08-04 03:31:14,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 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-04 03:31:14,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:31:14,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 152 [2023-08-04 03:31:14,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:31:14,870 INFO L124 PetriNetUnfolderBase]: 45/145 cut-off events. [2023-08-04 03:31:14,870 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-04 03:31:14,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 145 events. 45/145 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 580 event pairs, 42 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 244. Up to 90 conditions per place. [2023-08-04 03:31:14,873 INFO L140 encePairwiseOnDemand]: 149/152 looper letters, 15 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2023-08-04 03:31:14,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 31 transitions, 106 flow [2023-08-04 03:31:14,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:31:14,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:31:14,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 282 transitions. [2023-08-04 03:31:14,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.618421052631579 [2023-08-04 03:31:14,885 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 282 transitions. [2023-08-04 03:31:14,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 282 transitions. [2023-08-04 03:31:14,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:31:14,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 282 transitions. [2023-08-04 03:31:14,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 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-04 03:31:14,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 0 states have call successors, (0), 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-04 03:31:14,896 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 0 states have call successors, (0), 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-04 03:31:14,897 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 64 flow. Second operand 3 states and 282 transitions. [2023-08-04 03:31:14,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 31 transitions, 106 flow [2023-08-04 03:31:14,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 31 transitions, 106 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 03:31:14,901 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 72 flow [2023-08-04 03:31:14,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2023-08-04 03:31:14,905 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2023-08-04 03:31:14,905 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 72 flow [2023-08-04 03:31:14,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 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-04 03:31:14,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:31:14,906 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 03:31:14,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 03:31:14,906 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 03:31:14,907 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:31:14,907 INFO L85 PathProgramCache]: Analyzing trace with hash -553733609, now seen corresponding path program 1 times [2023-08-04 03:31:14,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:31:14,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033003549] [2023-08-04 03:31:14,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:31:14,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:31:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 03:31:14,939 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 03:31:14,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 03:31:14,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 03:31:14,966 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 03:31:14,967 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 03:31:14,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 03:31:14,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-04 03:31:14,969 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 03:31:14,971 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (1/2) [2023-08-04 03:31:14,972 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 03:31:14,972 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 03:31:14,994 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2023-08-04 03:31:14,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 136 transitions, 320 flow [2023-08-04 03:31:15,103 INFO L124 PetriNetUnfolderBase]: 117/829 cut-off events. [2023-08-04 03:31:15,103 INFO L125 PetriNetUnfolderBase]: For 72/79 co-relation queries the response was YES. [2023-08-04 03:31:15,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 829 events. 117/829 cut-off events. For 72/79 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4563 event pairs, 2 based on Foata normal form. 0/709 useless extension candidates. Maximal degree in co-relation 484. Up to 32 conditions per place. [2023-08-04 03:31:15,110 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 136 transitions, 320 flow [2023-08-04 03:31:15,112 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 92 transitions, 208 flow [2023-08-04 03:31:15,112 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 03:31:15,112 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 208 flow [2023-08-04 03:31:15,113 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 208 flow [2023-08-04 03:31:15,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 208 flow [2023-08-04 03:31:15,134 INFO L124 PetriNetUnfolderBase]: 3/218 cut-off events. [2023-08-04 03:31:15,135 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 03:31:15,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 218 events. 3/218 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 650 event pairs, 0 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 165. Up to 9 conditions per place. [2023-08-04 03:31:15,139 INFO L119 LiptonReduction]: Number of co-enabled transitions 3036 [2023-08-04 03:31:16,461 INFO L134 LiptonReduction]: Checked pairs total: 16726 [2023-08-04 03:31:16,462 INFO L136 LiptonReduction]: Total number of compositions: 46 [2023-08-04 03:31:16,464 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 03:31:16,464 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;@4c5f8e85, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 03:31:16,465 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 03:31:16,468 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 03:31:16,468 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2023-08-04 03:31:16,468 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-04 03:31:16,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:31:16,468 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2023-08-04 03:31:16,469 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 03:31:16,469 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:31:16,469 INFO L85 PathProgramCache]: Analyzing trace with hash 711643931, now seen corresponding path program 1 times [2023-08-04 03:31:16,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:31:16,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699396421] [2023-08-04 03:31:16,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:31:16,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:31:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:31:16,546 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 03:31:16,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:31:16,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699396421] [2023-08-04 03:31:16,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699396421] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:31:16,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:31:16,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 03:31:16,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610867139] [2023-08-04 03:31:16,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:31:16,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:31:16,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:31:16,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:31:16,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 03:31:16,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 182 [2023-08-04 03:31:16,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 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-04 03:31:16,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:31:16,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 182 [2023-08-04 03:31:16,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:31:16,933 INFO L124 PetriNetUnfolderBase]: 1953/3786 cut-off events. [2023-08-04 03:31:16,933 INFO L125 PetriNetUnfolderBase]: For 260/260 co-relation queries the response was YES. [2023-08-04 03:31:16,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7033 conditions, 3786 events. 1953/3786 cut-off events. For 260/260 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 29214 event pairs, 1296 based on Foata normal form. 0/3554 useless extension candidates. Maximal degree in co-relation 1535. Up to 2830 conditions per place. [2023-08-04 03:31:16,961 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 24 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-08-04 03:31:16,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 54 transitions, 184 flow [2023-08-04 03:31:16,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:31:16,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:31:16,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2023-08-04 03:31:16,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6318681318681318 [2023-08-04 03:31:16,964 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 345 transitions. [2023-08-04 03:31:16,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 345 transitions. [2023-08-04 03:31:16,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:31:16,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 345 transitions. [2023-08-04 03:31:16,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 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-04 03:31:16,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 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-04 03:31:16,969 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 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-04 03:31:16,969 INFO L175 Difference]: Start difference. First operand has 58 places, 49 transitions, 122 flow. Second operand 3 states and 345 transitions. [2023-08-04 03:31:16,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 54 transitions, 184 flow [2023-08-04 03:31:16,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 54 transitions, 180 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-04 03:31:16,972 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 130 flow [2023-08-04 03:31:16,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-08-04 03:31:16,973 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 3 predicate places. [2023-08-04 03:31:16,973 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 130 flow [2023-08-04 03:31:16,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 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-04 03:31:16,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:31:16,973 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-04 03:31:16,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-04 03:31:16,974 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 03:31:16,974 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:31:16,974 INFO L85 PathProgramCache]: Analyzing trace with hash -2135987213, now seen corresponding path program 1 times [2023-08-04 03:31:16,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:31:16,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305361973] [2023-08-04 03:31:16,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:31:16,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:31:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:31:17,042 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-04 03:31:17,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:31:17,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305361973] [2023-08-04 03:31:17,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305361973] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:31:17,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395175101] [2023-08-04 03:31:17,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:31:17,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:31:17,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:31:17,053 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-04 03:31:17,062 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-04 03:31:17,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:31:17,115 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 03:31:17,116 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:31:17,169 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-04 03:31:17,169 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 03:31:17,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395175101] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:31:17,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 03:31:17,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-04 03:31:17,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358095662] [2023-08-04 03:31:17,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:31:17,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 03:31:17,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:31:17,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 03:31:17,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-04 03:31:17,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 182 [2023-08-04 03:31:17,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 130 flow. Second operand has 5 states, 5 states have (on average 106.6) internal successors, (533), 5 states have internal predecessors, (533), 0 states have call successors, (0), 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-04 03:31:17,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:31:17,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 182 [2023-08-04 03:31:17,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:31:17,552 INFO L124 PetriNetUnfolderBase]: 1929/3768 cut-off events. [2023-08-04 03:31:17,552 INFO L125 PetriNetUnfolderBase]: For 191/191 co-relation queries the response was YES. [2023-08-04 03:31:17,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6990 conditions, 3768 events. 1929/3768 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 29224 event pairs, 795 based on Foata normal form. 16/3612 useless extension candidates. Maximal degree in co-relation 6948. Up to 2747 conditions per place. [2023-08-04 03:31:17,581 INFO L140 encePairwiseOnDemand]: 178/182 looper letters, 29 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2023-08-04 03:31:17,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 60 transitions, 216 flow [2023-08-04 03:31:17,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 03:31:17,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 03:31:17,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 559 transitions. [2023-08-04 03:31:17,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6142857142857143 [2023-08-04 03:31:17,586 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 559 transitions. [2023-08-04 03:31:17,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 559 transitions. [2023-08-04 03:31:17,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:31:17,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 559 transitions. [2023-08-04 03:31:17,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 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-04 03:31:17,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-04 03:31:17,591 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-04 03:31:17,591 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 130 flow. Second operand 5 states and 559 transitions. [2023-08-04 03:31:17,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 60 transitions, 216 flow [2023-08-04 03:31:17,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 60 transitions, 213 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 03:31:17,593 INFO L231 Difference]: Finished difference. Result has 64 places, 50 transitions, 144 flow [2023-08-04 03:31:17,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=144, PETRI_PLACES=64, PETRI_TRANSITIONS=50} [2023-08-04 03:31:17,594 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places. [2023-08-04 03:31:17,594 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 50 transitions, 144 flow [2023-08-04 03:31:17,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.6) internal successors, (533), 5 states have internal predecessors, (533), 0 states have call successors, (0), 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-04 03:31:17,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:31:17,595 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:31:17,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-04 03:31:17,800 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-04 03:31:17,800 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 03:31:17,801 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:31:17,801 INFO L85 PathProgramCache]: Analyzing trace with hash 458820900, now seen corresponding path program 1 times [2023-08-04 03:31:17,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:31:17,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361724828] [2023-08-04 03:31:17,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:31:17,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:31:17,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:31:17,865 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 03:31:17,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:31:17,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361724828] [2023-08-04 03:31:17,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361724828] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:31:17,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563890248] [2023-08-04 03:31:17,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:31:17,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:31:17,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:31:17,870 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-04 03:31:17,872 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-04 03:31:17,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:31:17,931 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 03:31:17,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:31:17,946 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 03:31:17,946 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:31:17,969 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 03:31:17,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563890248] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:31:17,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:31:17,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 03:31:17,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828334787] [2023-08-04 03:31:17,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:31:17,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 03:31:17,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:31:17,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 03:31:17,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:31:17,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 182 [2023-08-04 03:31:17,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 50 transitions, 144 flow. Second operand has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 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-04 03:31:17,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:31:17,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 182 [2023-08-04 03:31:17,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:31:18,283 INFO L124 PetriNetUnfolderBase]: 1650/3137 cut-off events. [2023-08-04 03:31:18,283 INFO L125 PetriNetUnfolderBase]: For 271/271 co-relation queries the response was YES. [2023-08-04 03:31:18,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5895 conditions, 3137 events. 1650/3137 cut-off events. For 271/271 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 23001 event pairs, 639 based on Foata normal form. 4/3003 useless extension candidates. Maximal degree in co-relation 4261. Up to 2305 conditions per place. [2023-08-04 03:31:18,305 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 29 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2023-08-04 03:31:18,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 59 transitions, 222 flow [2023-08-04 03:31:18,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 03:31:18,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 03:31:18,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 453 transitions. [2023-08-04 03:31:18,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6222527472527473 [2023-08-04 03:31:18,307 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 453 transitions. [2023-08-04 03:31:18,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 453 transitions. [2023-08-04 03:31:18,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:31:18,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 453 transitions. [2023-08-04 03:31:18,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 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-04 03:31:18,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 182.0) internal successors, (910), 5 states have internal predecessors, (910), 0 states have call successors, (0), 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-04 03:31:18,311 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 182.0) internal successors, (910), 5 states have internal predecessors, (910), 0 states have call successors, (0), 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-04 03:31:18,311 INFO L175 Difference]: Start difference. First operand has 64 places, 50 transitions, 144 flow. Second operand 4 states and 453 transitions. [2023-08-04 03:31:18,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 59 transitions, 222 flow [2023-08-04 03:31:18,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 59 transitions, 217 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-04 03:31:18,315 INFO L231 Difference]: Finished difference. Result has 65 places, 49 transitions, 137 flow [2023-08-04 03:31:18,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=65, PETRI_TRANSITIONS=49} [2023-08-04 03:31:18,316 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 7 predicate places. [2023-08-04 03:31:18,317 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 49 transitions, 137 flow [2023-08-04 03:31:18,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 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-04 03:31:18,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:31:18,317 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:31:18,331 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-04 03:31:18,525 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-04 03:31:18,525 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 03:31:18,526 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:31:18,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1409430162, now seen corresponding path program 1 times [2023-08-04 03:31:18,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:31:18,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305089079] [2023-08-04 03:31:18,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:31:18,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:31:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:31:18,612 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 03:31:18,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:31:18,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305089079] [2023-08-04 03:31:18,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305089079] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:31:18,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111314811] [2023-08-04 03:31:18,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:31:18,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:31:18,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:31:18,615 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-04 03:31:18,619 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-04 03:31:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:31:18,685 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 03:31:18,686 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:31:18,703 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 03:31:18,704 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 03:31:18,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111314811] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:31:18,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 03:31:18,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-04 03:31:18,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117195594] [2023-08-04 03:31:18,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:31:18,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 03:31:18,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:31:18,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 03:31:18,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:31:18,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 182 [2023-08-04 03:31:18,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 49 transitions, 137 flow. Second operand has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 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-04 03:31:18,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:31:18,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 182 [2023-08-04 03:31:18,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:31:18,940 INFO L124 PetriNetUnfolderBase]: 882/1823 cut-off events. [2023-08-04 03:31:18,941 INFO L125 PetriNetUnfolderBase]: For 332/332 co-relation queries the response was YES. [2023-08-04 03:31:18,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3497 conditions, 1823 events. 882/1823 cut-off events. For 332/332 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12537 event pairs, 282 based on Foata normal form. 256/2024 useless extension candidates. Maximal degree in co-relation 2490. Up to 1040 conditions per place. [2023-08-04 03:31:18,947 INFO L140 encePairwiseOnDemand]: 180/182 looper letters, 0 selfloop transitions, 0 changer transitions 63/63 dead transitions. [2023-08-04 03:31:18,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 63 transitions, 237 flow [2023-08-04 03:31:18,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 03:31:18,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 03:31:18,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 461 transitions. [2023-08-04 03:31:18,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6332417582417582 [2023-08-04 03:31:18,949 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 461 transitions. [2023-08-04 03:31:18,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 461 transitions. [2023-08-04 03:31:18,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:31:18,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 461 transitions. [2023-08-04 03:31:18,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 115.25) internal successors, (461), 4 states have internal predecessors, (461), 0 states have call successors, (0), 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-04 03:31:18,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 182.0) internal successors, (910), 5 states have internal predecessors, (910), 0 states have call successors, (0), 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-04 03:31:18,953 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 182.0) internal successors, (910), 5 states have internal predecessors, (910), 0 states have call successors, (0), 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-04 03:31:18,953 INFO L175 Difference]: Start difference. First operand has 65 places, 49 transitions, 137 flow. Second operand 4 states and 461 transitions. [2023-08-04 03:31:18,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 63 transitions, 237 flow [2023-08-04 03:31:18,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 63 transitions, 230 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-04 03:31:18,955 INFO L231 Difference]: Finished difference. Result has 63 places, 0 transitions, 0 flow [2023-08-04 03:31:18,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=63, PETRI_TRANSITIONS=0} [2023-08-04 03:31:18,956 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 5 predicate places. [2023-08-04 03:31:18,956 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 0 transitions, 0 flow [2023-08-04 03:31:18,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 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-04 03:31:18,956 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 03:31:18,957 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 03:31:18,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-04 03:31:19,162 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-04 03:31:19,162 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-08-04 03:31:19,163 INFO L307 ceAbstractionStarter]: Result for error location InUseError was SAFE,SAFE (1/2) [2023-08-04 03:31:19,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 136 transitions, 320 flow [2023-08-04 03:31:19,223 INFO L124 PetriNetUnfolderBase]: 117/829 cut-off events. [2023-08-04 03:31:19,223 INFO L125 PetriNetUnfolderBase]: For 72/79 co-relation queries the response was YES. [2023-08-04 03:31:19,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 829 events. 117/829 cut-off events. For 72/79 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4563 event pairs, 2 based on Foata normal form. 0/709 useless extension candidates. Maximal degree in co-relation 484. Up to 32 conditions per place. [2023-08-04 03:31:19,226 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 136 transitions, 320 flow [2023-08-04 03:31:19,228 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 126 transitions, 292 flow [2023-08-04 03:31:19,228 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 03:31:19,228 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 126 transitions, 292 flow [2023-08-04 03:31:19,228 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 126 transitions, 292 flow [2023-08-04 03:31:19,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 126 transitions, 292 flow [2023-08-04 03:31:19,273 INFO L124 PetriNetUnfolderBase]: 117/697 cut-off events. [2023-08-04 03:31:19,274 INFO L125 PetriNetUnfolderBase]: For 68/72 co-relation queries the response was YES. [2023-08-04 03:31:19,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 786 conditions, 697 events. 117/697 cut-off events. For 68/72 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3598 event pairs, 2 based on Foata normal form. 0/593 useless extension candidates. Maximal degree in co-relation 414. Up to 32 conditions per place. [2023-08-04 03:31:19,286 INFO L119 LiptonReduction]: Number of co-enabled transitions 5896 [2023-08-04 03:31:20,780 INFO L134 LiptonReduction]: Checked pairs total: 35873 [2023-08-04 03:31:20,780 INFO L136 LiptonReduction]: Total number of compositions: 70 [2023-08-04 03:31:20,781 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 03:31:20,782 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;@4c5f8e85, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 03:31:20,782 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 03:31:20,784 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 03:31:20,784 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-08-04 03:31:20,784 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:31:20,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:31:20,784 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 03:31:20,784 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:31:20,785 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:31:20,785 INFO L85 PathProgramCache]: Analyzing trace with hash 662165623, now seen corresponding path program 1 times [2023-08-04 03:31:20,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:31:20,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894577673] [2023-08-04 03:31:20,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:31:20,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:31:20,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:31:20,819 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-04 03:31:20,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:31:20,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894577673] [2023-08-04 03:31:20,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894577673] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:31:20,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:31:20,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 03:31:20,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415010734] [2023-08-04 03:31:20,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:31:20,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:31:20,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:31:20,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:31:20,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 03:31:20,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 206 [2023-08-04 03:31:20,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 65 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 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-04 03:31:20,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:31:20,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 206 [2023-08-04 03:31:20,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:31:22,719 INFO L124 PetriNetUnfolderBase]: 12819/21833 cut-off events. [2023-08-04 03:31:22,719 INFO L125 PetriNetUnfolderBase]: For 1996/1996 co-relation queries the response was YES. [2023-08-04 03:31:22,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41117 conditions, 21833 events. 12819/21833 cut-off events. For 1996/1996 co-relation queries the response was YES. Maximal size of possible extension queue 1046. Compared 189335 event pairs, 8831 based on Foata normal form. 0/19274 useless extension candidates. Maximal degree in co-relation 10793. Up to 17979 conditions per place. [2023-08-04 03:31:22,911 INFO L140 encePairwiseOnDemand]: 203/206 looper letters, 40 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-08-04 03:31:22,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 70 transitions, 264 flow [2023-08-04 03:31:22,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:31:22,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:31:22,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2023-08-04 03:31:22,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5841423948220065 [2023-08-04 03:31:22,914 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2023-08-04 03:31:22,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2023-08-04 03:31:22,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:31:22,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2023-08-04 03:31:22,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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-04 03:31:22,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 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-04 03:31:22,918 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 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-04 03:31:22,918 INFO L175 Difference]: Start difference. First operand has 66 places, 65 transitions, 170 flow. Second operand 3 states and 361 transitions. [2023-08-04 03:31:22,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 70 transitions, 264 flow [2023-08-04 03:31:22,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 70 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 03:31:22,934 INFO L231 Difference]: Finished difference. Result has 67 places, 66 transitions, 176 flow [2023-08-04 03:31:22,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=67, PETRI_TRANSITIONS=66} [2023-08-04 03:31:22,935 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 1 predicate places. [2023-08-04 03:31:22,935 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 66 transitions, 176 flow [2023-08-04 03:31:22,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 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-04 03:31:22,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:31:22,936 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:31:22,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 03:31:22,936 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:31:22,936 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:31:22,937 INFO L85 PathProgramCache]: Analyzing trace with hash -488169920, now seen corresponding path program 1 times [2023-08-04 03:31:22,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:31:22,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734130953] [2023-08-04 03:31:22,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:31:22,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:31:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:31:22,965 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-04 03:31:22,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:31:22,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734130953] [2023-08-04 03:31:22,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734130953] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:31:22,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091052035] [2023-08-04 03:31:22,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:31:22,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:31:22,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:31:22,967 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-04 03:31:22,970 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-04 03:31:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:31:23,020 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 03:31:23,020 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:31:23,029 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-04 03:31:23,029 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 03:31:23,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091052035] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:31:23,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 03:31:23,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 03:31:23,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720222703] [2023-08-04 03:31:23,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:31:23,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:31:23,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:31:23,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:31:23,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:31:23,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 206 [2023-08-04 03:31:23,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 66 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 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-04 03:31:23,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:31:23,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 206 [2023-08-04 03:31:23,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:31:24,589 INFO L124 PetriNetUnfolderBase]: 12799/21423 cut-off events. [2023-08-04 03:31:24,590 INFO L125 PetriNetUnfolderBase]: For 1302/1302 co-relation queries the response was YES. [2023-08-04 03:31:24,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40650 conditions, 21423 events. 12799/21423 cut-off events. For 1302/1302 co-relation queries the response was YES. Maximal size of possible extension queue 1041. Compared 183132 event pairs, 11827 based on Foata normal form. 0/19052 useless extension candidates. Maximal degree in co-relation 31447. Up to 17683 conditions per place. [2023-08-04 03:31:24,698 INFO L140 encePairwiseOnDemand]: 203/206 looper letters, 47 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2023-08-04 03:31:24,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 77 transitions, 296 flow [2023-08-04 03:31:24,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:31:24,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:31:24,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2023-08-04 03:31:24,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5938511326860841 [2023-08-04 03:31:24,700 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2023-08-04 03:31:24,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2023-08-04 03:31:24,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:31:24,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2023-08-04 03:31:24,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 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-04 03:31:24,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 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-04 03:31:24,703 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 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-04 03:31:24,703 INFO L175 Difference]: Start difference. First operand has 67 places, 66 transitions, 176 flow. Second operand 3 states and 367 transitions. [2023-08-04 03:31:24,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 77 transitions, 296 flow [2023-08-04 03:31:24,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 77 transitions, 294 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 03:31:24,706 INFO L231 Difference]: Finished difference. Result has 69 places, 67 transitions, 186 flow [2023-08-04 03:31:24,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=69, PETRI_TRANSITIONS=67} [2023-08-04 03:31:24,706 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 3 predicate places. [2023-08-04 03:31:24,706 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 67 transitions, 186 flow [2023-08-04 03:31:24,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 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-04 03:31:24,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:31:24,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:31:24,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-04 03:31:24,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:31:24,912 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:31:24,913 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:31:24,913 INFO L85 PathProgramCache]: Analyzing trace with hash 908404695, now seen corresponding path program 1 times [2023-08-04 03:31:24,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:31:24,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139072455] [2023-08-04 03:31:24,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:31:24,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:31:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:31:24,942 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-04 03:31:24,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:31:24,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139072455] [2023-08-04 03:31:24,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139072455] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:31:24,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342479182] [2023-08-04 03:31:24,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:31:24,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:31:24,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:31:24,945 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-04 03:31:24,947 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-04 03:31:24,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:31:25,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 03:31:25,001 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:31:25,009 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-04 03:31:25,009 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 03:31:25,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342479182] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:31:25,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 03:31:25,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 03:31:25,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941327843] [2023-08-04 03:31:25,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:31:25,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:31:25,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:31:25,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:31:25,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:31:25,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 206 [2023-08-04 03:31:25,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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-04 03:31:25,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:31:25,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 206 [2023-08-04 03:31:25,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:31:26,342 INFO L124 PetriNetUnfolderBase]: 10373/17217 cut-off events. [2023-08-04 03:31:26,342 INFO L125 PetriNetUnfolderBase]: For 1774/1774 co-relation queries the response was YES. [2023-08-04 03:31:26,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34115 conditions, 17217 events. 10373/17217 cut-off events. For 1774/1774 co-relation queries the response was YES. Maximal size of possible extension queue 801. Compared 142308 event pairs, 6997 based on Foata normal form. 0/15774 useless extension candidates. Maximal degree in co-relation 18071. Up to 10869 conditions per place. [2023-08-04 03:31:26,433 INFO L140 encePairwiseOnDemand]: 203/206 looper letters, 55 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2023-08-04 03:31:26,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 85 transitions, 346 flow [2023-08-04 03:31:26,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:31:26,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:31:26,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2023-08-04 03:31:26,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6051779935275081 [2023-08-04 03:31:26,435 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 374 transitions. [2023-08-04 03:31:26,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 374 transitions. [2023-08-04 03:31:26,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:31:26,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 374 transitions. [2023-08-04 03:31:26,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 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-04 03:31:26,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 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-04 03:31:26,438 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 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-04 03:31:26,438 INFO L175 Difference]: Start difference. First operand has 69 places, 67 transitions, 186 flow. Second operand 3 states and 374 transitions. [2023-08-04 03:31:26,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 85 transitions, 346 flow [2023-08-04 03:31:26,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 85 transitions, 344 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 03:31:26,442 INFO L231 Difference]: Finished difference. Result has 71 places, 68 transitions, 196 flow [2023-08-04 03:31:26,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=71, PETRI_TRANSITIONS=68} [2023-08-04 03:31:26,445 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 5 predicate places. [2023-08-04 03:31:26,445 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 68 transitions, 196 flow [2023-08-04 03:31:26,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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-04 03:31:26,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:31:26,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:31:26,455 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-04 03:31:26,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:31:26,651 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:31:26,651 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:31:26,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1705094392, now seen corresponding path program 1 times [2023-08-04 03:31:26,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:31:26,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151380655] [2023-08-04 03:31:26,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:31:26,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:31:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:31:26,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 03:31:26,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:31:26,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151380655] [2023-08-04 03:31:26,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151380655] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:31:26,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528340880] [2023-08-04 03:31:26,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:31:26,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:31:26,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:31:26,735 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-04 03:31:26,737 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-04 03:31:26,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:31:26,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 03:31:26,802 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:31:26,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 03:31:26,814 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 03:31:26,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528340880] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:31:26,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 03:31:26,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-08-04 03:31:26,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070823447] [2023-08-04 03:31:26,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:31:26,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:31:26,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:31:26,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:31:26,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:31:26,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 206 [2023-08-04 03:31:26,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 196 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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-04 03:31:26,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:31:26,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 206 [2023-08-04 03:31:26,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:31:27,968 INFO L124 PetriNetUnfolderBase]: 10060/16986 cut-off events. [2023-08-04 03:31:27,968 INFO L125 PetriNetUnfolderBase]: For 3897/3897 co-relation queries the response was YES. [2023-08-04 03:31:27,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35101 conditions, 16986 events. 10060/16986 cut-off events. For 3897/3897 co-relation queries the response was YES. Maximal size of possible extension queue 740. Compared 141603 event pairs, 8135 based on Foata normal form. 0/16356 useless extension candidates. Maximal degree in co-relation 18456. Up to 11963 conditions per place. [2023-08-04 03:31:28,049 INFO L140 encePairwiseOnDemand]: 203/206 looper letters, 56 selfloop transitions, 2 changer transitions 0/86 dead transitions. [2023-08-04 03:31:28,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 86 transitions, 358 flow [2023-08-04 03:31:28,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:31:28,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:31:28,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2023-08-04 03:31:28,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6051779935275081 [2023-08-04 03:31:28,051 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 374 transitions. [2023-08-04 03:31:28,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 374 transitions. [2023-08-04 03:31:28,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:31:28,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 374 transitions. [2023-08-04 03:31:28,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 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-04 03:31:28,053 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 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-04 03:31:28,053 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 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-04 03:31:28,053 INFO L175 Difference]: Start difference. First operand has 71 places, 68 transitions, 196 flow. Second operand 3 states and 374 transitions. [2023-08-04 03:31:28,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 86 transitions, 358 flow [2023-08-04 03:31:28,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 86 transitions, 356 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 03:31:28,066 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 206 flow [2023-08-04 03:31:28,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2023-08-04 03:31:28,067 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 7 predicate places. [2023-08-04 03:31:28,067 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 206 flow [2023-08-04 03:31:28,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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-04 03:31:28,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:31:28,068 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:31:28,076 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-04 03:31:28,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:31:28,273 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:31:28,274 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:31:28,274 INFO L85 PathProgramCache]: Analyzing trace with hash -870435823, now seen corresponding path program 1 times [2023-08-04 03:31:28,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:31:28,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364566587] [2023-08-04 03:31:28,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:31:28,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:31:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:31:28,343 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 03:31:28,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:31:28,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364566587] [2023-08-04 03:31:28,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364566587] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:31:28,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993461942] [2023-08-04 03:31:28,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:31:28,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:31:28,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:31:28,345 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-04 03:31:28,348 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-04 03:31:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:31:28,425 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 03:31:28,428 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:31:28,446 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 03:31:28,447 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:31:28,469 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 03:31:28,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993461942] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:31:28,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:31:28,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 03:31:28,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400719617] [2023-08-04 03:31:28,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:31:28,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 03:31:28,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:31:28,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 03:31:28,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:31:28,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 206 [2023-08-04 03:31:28,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 206 flow. Second operand has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 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-04 03:31:28,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:31:28,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 206 [2023-08-04 03:31:28,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:31:29,609 INFO L124 PetriNetUnfolderBase]: 9164/15172 cut-off events. [2023-08-04 03:31:29,610 INFO L125 PetriNetUnfolderBase]: For 2735/2735 co-relation queries the response was YES. [2023-08-04 03:31:29,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31941 conditions, 15172 events. 9164/15172 cut-off events. For 2735/2735 co-relation queries the response was YES. Maximal size of possible extension queue 688. Compared 121464 event pairs, 4266 based on Foata normal form. 4/14754 useless extension candidates. Maximal degree in co-relation 23430. Up to 13133 conditions per place. [2023-08-04 03:31:29,678 INFO L140 encePairwiseOnDemand]: 202/206 looper letters, 48 selfloop transitions, 3 changer transitions 1/80 dead transitions. [2023-08-04 03:31:29,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 80 transitions, 332 flow [2023-08-04 03:31:29,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 03:31:29,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 03:31:29,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 470 transitions. [2023-08-04 03:31:29,682 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5703883495145631 [2023-08-04 03:31:29,682 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 470 transitions. [2023-08-04 03:31:29,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 470 transitions. [2023-08-04 03:31:29,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:31:29,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 470 transitions. [2023-08-04 03:31:29,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 0 states have call successors, (0), 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-04 03:31:29,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 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-04 03:31:29,686 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 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-04 03:31:29,686 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 206 flow. Second operand 4 states and 470 transitions. [2023-08-04 03:31:29,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 80 transitions, 332 flow [2023-08-04 03:31:29,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 80 transitions, 330 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 03:31:29,777 INFO L231 Difference]: Finished difference. Result has 77 places, 69 transitions, 218 flow [2023-08-04 03:31:29,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=218, PETRI_PLACES=77, PETRI_TRANSITIONS=69} [2023-08-04 03:31:29,779 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 11 predicate places. [2023-08-04 03:31:29,779 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 69 transitions, 218 flow [2023-08-04 03:31:29,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 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-04 03:31:29,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:31:29,779 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:31:29,787 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-04 03:31:29,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:31:29,985 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:31:29,985 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:31:29,985 INFO L85 PathProgramCache]: Analyzing trace with hash 66950988, now seen corresponding path program 1 times [2023-08-04 03:31:29,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:31:29,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848992820] [2023-08-04 03:31:29,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:31:29,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:31:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:31:30,049 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-04 03:31:30,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:31:30,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848992820] [2023-08-04 03:31:30,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848992820] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:31:30,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096207282] [2023-08-04 03:31:30,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:31:30,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:31:30,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:31:30,051 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-04 03:31:30,054 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-04 03:31:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:31:30,135 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 03:31:30,136 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:31:30,149 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-04 03:31:30,149 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:31:30,167 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-04 03:31:30,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096207282] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:31:30,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:31:30,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 03:31:30,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784272340] [2023-08-04 03:31:30,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:31:30,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 03:31:30,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:31:30,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 03:31:30,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:31:30,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 206 [2023-08-04 03:31:30,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 69 transitions, 218 flow. Second operand has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 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-04 03:31:30,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:31:30,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 206 [2023-08-04 03:31:30,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:31:31,121 INFO L124 PetriNetUnfolderBase]: 8732/13938 cut-off events. [2023-08-04 03:31:31,122 INFO L125 PetriNetUnfolderBase]: For 1877/1877 co-relation queries the response was YES. [2023-08-04 03:31:31,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29806 conditions, 13938 events. 8732/13938 cut-off events. For 1877/1877 co-relation queries the response was YES. Maximal size of possible extension queue 585. Compared 106497 event pairs, 3064 based on Foata normal form. 64/13767 useless extension candidates. Maximal degree in co-relation 23262. Up to 10085 conditions per place. [2023-08-04 03:31:31,179 INFO L140 encePairwiseOnDemand]: 202/206 looper letters, 60 selfloop transitions, 3 changer transitions 1/92 dead transitions. [2023-08-04 03:31:31,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 92 transitions, 392 flow [2023-08-04 03:31:31,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 03:31:31,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 03:31:31,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 482 transitions. [2023-08-04 03:31:31,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5849514563106796 [2023-08-04 03:31:31,182 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 482 transitions. [2023-08-04 03:31:31,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 482 transitions. [2023-08-04 03:31:31,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:31:31,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 482 transitions. [2023-08-04 03:31:31,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 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-04 03:31:31,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 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-04 03:31:31,186 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 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-04 03:31:31,186 INFO L175 Difference]: Start difference. First operand has 77 places, 69 transitions, 218 flow. Second operand 4 states and 482 transitions. [2023-08-04 03:31:31,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 92 transitions, 392 flow [2023-08-04 03:31:31,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 92 transitions, 383 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 03:31:31,250 INFO L231 Difference]: Finished difference. Result has 79 places, 69 transitions, 223 flow [2023-08-04 03:31:31,250 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=223, PETRI_PLACES=79, PETRI_TRANSITIONS=69} [2023-08-04 03:31:31,251 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 13 predicate places. [2023-08-04 03:31:31,251 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 69 transitions, 223 flow [2023-08-04 03:31:31,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 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-04 03:31:31,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:31:31,252 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, 1] [2023-08-04 03:31:31,260 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-04 03:31:31,458 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,SelfDestructingSolverStorable11 [2023-08-04 03:31:31,458 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:31:31,458 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:31:31,458 INFO L85 PathProgramCache]: Analyzing trace with hash 254228722, now seen corresponding path program 1 times [2023-08-04 03:31:31,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:31:31,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459198049] [2023-08-04 03:31:31,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:31:31,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:31:31,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:31:31,516 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-04 03:31:31,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:31:31,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459198049] [2023-08-04 03:31:31,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459198049] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:31:31,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223982817] [2023-08-04 03:31:31,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:31:31,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:31:31,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:31:31,519 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-04 03:31:31,521 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-04 03:31:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:31:31,595 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 03:31:31,596 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:31:31,609 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-04 03:31:31,609 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:31:31,626 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-04 03:31:31,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223982817] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:31:31,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:31:31,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 03:31:31,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310269076] [2023-08-04 03:31:31,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:31:31,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 03:31:31,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:31:31,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 03:31:31,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:31:31,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 206 [2023-08-04 03:31:31,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 69 transitions, 223 flow. Second operand has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 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-04 03:31:31,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:31:31,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 206 [2023-08-04 03:31:31,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:31:32,337 INFO L124 PetriNetUnfolderBase]: 6080/9960 cut-off events. [2023-08-04 03:31:32,337 INFO L125 PetriNetUnfolderBase]: For 4205/4205 co-relation queries the response was YES. [2023-08-04 03:31:32,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21820 conditions, 9960 events. 6080/9960 cut-off events. For 4205/4205 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 73866 event pairs, 2353 based on Foata normal form. 256/9881 useless extension candidates. Maximal degree in co-relation 20099. Up to 3564 conditions per place. [2023-08-04 03:31:32,384 INFO L140 encePairwiseOnDemand]: 202/206 looper letters, 67 selfloop transitions, 4 changer transitions 0/99 dead transitions. [2023-08-04 03:31:32,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 99 transitions, 434 flow [2023-08-04 03:31:32,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 03:31:32,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 03:31:32,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2023-08-04 03:31:32,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5934466019417476 [2023-08-04 03:31:32,386 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 489 transitions. [2023-08-04 03:31:32,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 489 transitions. [2023-08-04 03:31:32,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:31:32,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 489 transitions. [2023-08-04 03:31:32,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 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-04 03:31:32,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 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-04 03:31:32,390 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 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-04 03:31:32,390 INFO L175 Difference]: Start difference. First operand has 79 places, 69 transitions, 223 flow. Second operand 4 states and 489 transitions. [2023-08-04 03:31:32,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 99 transitions, 434 flow [2023-08-04 03:31:32,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 99 transitions, 424 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 03:31:32,412 INFO L231 Difference]: Finished difference. Result has 81 places, 70 transitions, 234 flow [2023-08-04 03:31:32,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=234, PETRI_PLACES=81, PETRI_TRANSITIONS=70} [2023-08-04 03:31:32,413 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 15 predicate places. [2023-08-04 03:31:32,413 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 70 transitions, 234 flow [2023-08-04 03:31:32,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 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-04 03:31:32,414 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:31:32,414 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:31:32,420 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-04 03:31:32,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-04 03:31:32,615 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:31:32,616 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:31:32,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1887220277, now seen corresponding path program 1 times [2023-08-04 03:31:32,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:31:32,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813463788] [2023-08-04 03:31:32,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:31:32,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:31:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:31:32,705 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 03:31:32,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:31:32,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813463788] [2023-08-04 03:31:32,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813463788] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:31:32,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850761673] [2023-08-04 03:31:32,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:31:32,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:31:32,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:31:32,708 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-04 03:31:32,719 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-04 03:31:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:31:32,803 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 03:31:32,813 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:31:32,826 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 03:31:32,826 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:31:32,839 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 03:31:32,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850761673] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:31:32,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:31:32,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 03:31:32,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015423730] [2023-08-04 03:31:32,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:31:32,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 03:31:32,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:31:32,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 03:31:32,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:31:32,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 206 [2023-08-04 03:31:32,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 70 transitions, 234 flow. Second operand has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 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-04 03:31:32,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:31:32,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 206 [2023-08-04 03:31:32,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:31:33,602 INFO L124 PetriNetUnfolderBase]: 6068/10165 cut-off events. [2023-08-04 03:31:33,602 INFO L125 PetriNetUnfolderBase]: For 6106/6106 co-relation queries the response was YES. [2023-08-04 03:31:33,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23160 conditions, 10165 events. 6068/10165 cut-off events. For 6106/6106 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 77178 event pairs, 5681 based on Foata normal form. 17/9811 useless extension candidates. Maximal degree in co-relation 21410. Up to 8085 conditions per place. [2023-08-04 03:31:33,670 INFO L140 encePairwiseOnDemand]: 202/206 looper letters, 67 selfloop transitions, 3 changer transitions 2/100 dead transitions. [2023-08-04 03:31:33,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 100 transitions, 446 flow [2023-08-04 03:31:33,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 03:31:33,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 03:31:33,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2023-08-04 03:31:33,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5934466019417476 [2023-08-04 03:31:33,672 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 489 transitions. [2023-08-04 03:31:33,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 489 transitions. [2023-08-04 03:31:33,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:31:33,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 489 transitions. [2023-08-04 03:31:33,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 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-04 03:31:33,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 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-04 03:31:33,675 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 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-04 03:31:33,675 INFO L175 Difference]: Start difference. First operand has 81 places, 70 transitions, 234 flow. Second operand 4 states and 489 transitions. [2023-08-04 03:31:33,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 100 transitions, 446 flow [2023-08-04 03:31:33,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 100 transitions, 442 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 03:31:33,712 INFO L231 Difference]: Finished difference. Result has 85 places, 69 transitions, 238 flow [2023-08-04 03:31:33,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=238, PETRI_PLACES=85, PETRI_TRANSITIONS=69} [2023-08-04 03:31:33,712 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 19 predicate places. [2023-08-04 03:31:33,713 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 69 transitions, 238 flow [2023-08-04 03:31:33,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 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-04 03:31:33,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:31:33,713 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:31:33,721 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-04 03:31:33,918 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,SelfDestructingSolverStorable13 [2023-08-04 03:31:33,918 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:31:33,919 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:31:33,919 INFO L85 PathProgramCache]: Analyzing trace with hash -477695676, now seen corresponding path program 1 times [2023-08-04 03:31:33,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:31:33,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966466542] [2023-08-04 03:31:33,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:31:33,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:31:33,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 03:31:33,971 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 03:31:34,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 03:31:34,043 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 03:31:34,043 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 03:31:34,044 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-08-04 03:31:34,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-04 03:31:34,044 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:31:34,044 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE (2/2) [2023-08-04 03:31:34,046 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 03:31:34,047 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 03:31:34,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 03:31:34 BasicIcfg [2023-08-04 03:31:34,140 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 03:31:34,140 INFO L158 Benchmark]: Toolchain (without parser) took 22179.91ms. Allocated memory was 559.9MB in the beginning and 6.3GB in the end (delta: 5.7GB). Free memory was 510.3MB in the beginning and 4.6GB in the end (delta: -4.1GB). Peak memory consumption was 1.6GB. Max. memory is 16.0GB. [2023-08-04 03:31:34,140 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 375.4MB. Free memory was 326.2MB in the beginning and 326.0MB in the end (delta: 140.0kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 03:31:34,141 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.01ms. Allocated memory is still 559.9MB. Free memory was 510.3MB in the beginning and 498.8MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-08-04 03:31:34,141 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.49ms. Allocated memory is still 559.9MB. Free memory was 498.8MB in the beginning and 497.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 03:31:34,141 INFO L158 Benchmark]: Boogie Preprocessor took 20.44ms. Allocated memory is still 559.9MB. Free memory was 497.0MB in the beginning and 495.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 03:31:34,142 INFO L158 Benchmark]: RCFGBuilder took 472.81ms. Allocated memory is still 559.9MB. Free memory was 495.6MB in the beginning and 478.5MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2023-08-04 03:31:34,142 INFO L158 Benchmark]: TraceAbstraction took 21356.56ms. Allocated memory was 559.9MB in the beginning and 6.3GB in the end (delta: 5.7GB). Free memory was 477.8MB in the beginning and 4.6GB in the end (delta: -4.1GB). Peak memory consumption was 1.5GB. Max. memory is 16.0GB. [2023-08-04 03:31:34,143 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 375.4MB. Free memory was 326.2MB in the beginning and 326.0MB in the end (delta: 140.0kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 276.01ms. Allocated memory is still 559.9MB. Free memory was 510.3MB in the beginning and 498.8MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 47.49ms. Allocated memory is still 559.9MB. Free memory was 498.8MB in the beginning and 497.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 20.44ms. Allocated memory is still 559.9MB. Free memory was 497.0MB in the beginning and 495.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 472.81ms. Allocated memory is still 559.9MB. Free memory was 495.6MB in the beginning and 478.5MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 21356.56ms. Allocated memory was 559.9MB in the beginning and 6.3GB in the end (delta: 5.7GB). Free memory was 477.8MB in the beginning and 4.6GB in the end (delta: -4.1GB). Peak memory consumption was 1.5GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 72 PlacesBefore, 32 PlacesAfterwards, 68 TransitionsBefore, 27 TransitionsAfterwards, 990 CoEnabledTransitionPairs, 6 FixpointIterations, 20 TrivialSequentialCompositions, 18 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 44 TotalNumberOfCompositions, 4452 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1880, independent: 1656, independent conditional: 0, independent unconditional: 1656, dependent: 224, dependent conditional: 0, dependent unconditional: 224, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 447, independent: 432, independent conditional: 0, independent unconditional: 432, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1880, independent: 1224, independent conditional: 0, independent unconditional: 1224, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 447, unknown conditional: 0, unknown unconditional: 447] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 79, Positive conditional cache size: 0, Positive unconditional cache size: 79, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 100 PlacesBefore, 58 PlacesAfterwards, 92 TransitionsBefore, 49 TransitionsAfterwards, 3036 CoEnabledTransitionPairs, 5 FixpointIterations, 20 TrivialSequentialCompositions, 20 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 46 TotalNumberOfCompositions, 16726 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3810, independent: 3426, independent conditional: 0, independent unconditional: 3426, dependent: 384, dependent conditional: 0, dependent unconditional: 384, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1092, independent: 1054, independent conditional: 0, independent unconditional: 1054, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3810, independent: 2372, independent conditional: 0, independent unconditional: 2372, dependent: 346, dependent conditional: 0, dependent unconditional: 346, unknown: 1092, unknown conditional: 0, unknown unconditional: 1092] , Statistics on independence cache: Total cache size (in pairs): 274, Positive cache size: 242, Positive conditional cache size: 0, Positive unconditional cache size: 242, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 122 PlacesBefore, 66 PlacesAfterwards, 126 TransitionsBefore, 65 TransitionsAfterwards, 5896 CoEnabledTransitionPairs, 6 FixpointIterations, 20 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 5 ChoiceCompositions, 70 TotalNumberOfCompositions, 35873 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11458, independent: 10966, independent conditional: 0, independent unconditional: 10966, dependent: 492, dependent conditional: 0, dependent unconditional: 492, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2412, independent: 2369, independent conditional: 0, independent unconditional: 2369, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11458, independent: 8597, independent conditional: 0, independent unconditional: 8597, dependent: 449, dependent conditional: 0, dependent unconditional: 449, unknown: 2412, unknown conditional: 0, unknown unconditional: 2412] , Statistics on independence cache: Total cache size (in pairs): 579, Positive cache size: 545, Positive conditional cache size: 0, Positive unconditional cache size: 545, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 116]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] 0 _Bool e1, e2; [L39] 0 int n1, n2, tmp1, tmp2, i, i1, i2; [L107] 0 pthread_t t1[2], t2[2]; [L110] 0 int asdf=0; VAL [asdf=0, e1=0, e2=0, i=0, i=0, i=0, n1=0, n2=0, t1={5:0}, t2={3:0}, tmp1=0, tmp2=0] [L110] COND TRUE 0 asdf<2 [L110] FCALL, FORK 0 pthread_create(&t1[asdf], 0, thread1, 0) VAL [asdf=0, e1=0, e2=0, i=0, i=0, i=0, n1=0, n2=0, pthread_create(&t1[asdf], 0, thread1, 0)=-4, t1={5:0}, t2={3:0}, tmp1=0, tmp2=0] [L44] 1 e1 = 1 VAL [e1=1, e2=0, i=0, i=0, i=0, n1=0, n2=0, tmp1=0, tmp2=0] [L47] 1 tmp1 = n2 VAL [e1=1, e2=0, i=0, i=0, i=0, n1=0, n2=0, tmp1=0, tmp2=0] [L50] 1 n1 = tmp1 + 1 VAL [e1=1, e2=0, i=0, i=0, i=0, n1=1, n2=0, tmp1=0, tmp2=0] [L53] 1 e1 = 0 VAL [e1=0, e2=0, i=0, i=0, i=0, n1=1, n2=0, tmp1=0, tmp2=0] [L56] CALL 1 assume_abort_if_not(!e2) [L35] COND FALSE 1 !(!cond) [L56] RET 1 assume_abort_if_not(!e2) [L110] 0 asdf++ VAL [asdf=1, e1=0, e2=0, i=0, i=0, i=0, n1=1, n2=0, t1={5:0}, t2={3:0}, tmp1=0, tmp2=0] [L110] COND TRUE 0 asdf<2 [L110] FCALL, FORK 0 pthread_create(&t1[asdf], 0, thread1, 0) VAL [asdf=1, e1=0, e2=0, i=0, i=0, i=0, n1=1, n2=0, pthread_create(&t1[asdf], 0, thread1, 0)=-3, t1={5:0}, t2={3:0}, tmp1=0, tmp2=0] [L44] 2 e1 = 1 VAL [e1=1, e2=0, i=0, i=0, i=0, n1=1, n2=0, tmp1=0, tmp2=0] [L47] 2 tmp1 = n2 VAL [e1=1, e2=0, i=0, i=0, i=0, n1=1, n2=0, tmp1=0, tmp2=0] [L50] 2 n1 = tmp1 + 1 VAL [e1=1, e2=0, i=0, i=0, i=0, n1=1, n2=0, tmp1=0, tmp2=0] [L53] 2 e1 = 0 VAL [e1=0, e2=0, i=0, i=0, i=0, n1=1, n2=0, tmp1=0, tmp2=0] [L56] CALL 2 assume_abort_if_not(!e2) [L35] COND FALSE 2 !(!cond) [L56] RET 2 assume_abort_if_not(!e2) [L110] 0 asdf++ VAL [asdf=2, e1=0, e2=0, i=0, i=0, i=0, n1=1, n2=0, t1={5:0}, t2={3:0}, tmp1=0, tmp2=0] [L59] CALL 1 assume_abort_if_not(n2 == 0 || n2 >= n1) [L35] COND FALSE 1 !(!cond) [L59] RET 1 assume_abort_if_not(n2 == 0 || n2 >= n1) [L62] 1 i1 = i VAL [e1=0, e2=0, i=0, i=0, i=0, n1=1, n2=0, tmp1=0, tmp2=0] [L65] 1 i = i1 + 1 VAL [e1=0, e2=0, i=0, i=0, i=1, n1=1, n2=0, tmp1=0, tmp2=0] [L68] 1 n1 = 0 [L71] 1 return 0; [L110] COND FALSE 0 !(asdf<2) [L111] 0 int asdf=0; VAL [asdf=0, asdf=2, e1=0, e2=0, i=0, i=0, i=1, n1=0, n2=0, t1={5:0}, t2={3:0}, tmp1=0, tmp2=0] [L111] COND TRUE 0 asdf<2 [L111] FCALL, FORK 0 pthread_create(&t2[asdf], 0, thread2, 0) VAL [asdf=0, asdf=2, e1=0, e2=0, i=0, i=0, i=1, n1=0, n2=0, pthread_create(&t2[asdf], 0, thread2, 0)=-2, t1={5:0}, t2={3:0}, tmp1=0, tmp2=0] [L76] 3 e2 = 1 VAL [e1=0, e2=1, i=0, i=0, i=1, n1=0, n2=0, tmp1=0, tmp2=0] [L79] 3 tmp2 = n1 VAL [e1=0, e2=1, i=0, i=0, i=1, n1=0, n2=0, tmp1=0, tmp2=0] [L82] 3 n2 = tmp2 + 1 VAL [e1=0, e2=1, i=0, i=0, i=1, n1=0, n2=1, tmp1=0, tmp2=0] [L85] 3 e2 = 0 VAL [e1=0, e2=0, i=0, i=0, i=1, n1=0, n2=1, tmp1=0, tmp2=0] [L88] CALL 3 assume_abort_if_not(!e1) [L35] COND FALSE 3 !(!cond) [L88] RET 3 assume_abort_if_not(!e1) [L59] CALL 2 assume_abort_if_not(n2 == 0 || n2 >= n1) [L35] COND FALSE 2 !(!cond) [L59] RET 2 assume_abort_if_not(n2 == 0 || n2 >= n1) [L62] 2 i1 = i VAL [\result={0:0}, e1=0, e2=0, i=0, i=1, i=1, n1=0, n2=1, tmp1=0, tmp2=0] [L65] 2 i = i1 + 1 VAL [\result={0:0}, e1=0, e2=0, i=0, i=1, i=2, n1=0, n2=1, tmp1=0, tmp2=0] [L68] 2 n1 = 0 [L71] 2 return 0; [L111] 0 asdf++ VAL [asdf=1, asdf=2, e1=0, e2=0, i=0, i=1, i=2, n1=0, n2=1, t1={5:0}, t2={3:0}, tmp1=0, tmp2=0] [L111] COND TRUE 0 asdf<2 [L111] FCALL, FORK 0 pthread_create(&t2[asdf], 0, thread2, 0) VAL [asdf=1, asdf=2, e1=0, e2=0, i=0, i=1, i=2, n1=0, n2=1, pthread_create(&t2[asdf], 0, thread2, 0)=-1, t1={5:0}, t2={3:0}, tmp1=0, tmp2=0] [L76] 4 e2 = 1 VAL [e1=0, e2=1, i=0, i=1, i=2, n1=0, n2=1, tmp1=0, tmp2=0] [L79] 4 tmp2 = n1 VAL [e1=0, e2=1, i=0, i=1, i=2, n1=0, n2=1, tmp1=0, tmp2=0] [L82] 4 n2 = tmp2 + 1 VAL [e1=0, e2=1, i=0, i=1, i=2, n1=0, n2=1, tmp1=0, tmp2=0] [L85] 4 e2 = 0 VAL [e1=0, e2=0, i=0, i=1, i=2, n1=0, n2=1, tmp1=0, tmp2=0] [L88] CALL 4 assume_abort_if_not(!e1) [L35] COND FALSE 4 !(!cond) [L88] RET 4 assume_abort_if_not(!e1) [L111] 0 asdf++ VAL [asdf=2, asdf=2, e1=0, e2=0, i=0, i=1, i=2, n1=0, n2=1, t1={5:0}, t2={3:0}, tmp1=0, tmp2=0] [L91] CALL 3 assume_abort_if_not(n1 == 0 || n1 > n2) [L35] COND FALSE 3 !(!cond) [L91] RET 3 assume_abort_if_not(n1 == 0 || n1 > n2) [L94] 3 i2 = i VAL [e1=0, e2=0, i=1, i=2, i=2, n1=0, n2=1, tmp1=0, tmp2=0] [L97] 3 i = i2 + 1 VAL [e1=0, e2=0, i=1, i=2, i=3, n1=0, n2=1, tmp1=0, tmp2=0] [L100] 3 n2 = 0 [L103] 3 return 0; [L111] COND FALSE 0 !(asdf<2) [L112] 0 int asdf=0; VAL [asdf=0, asdf=2, asdf=2, e1=0, e2=0, i=1, i=2, i=3, n1=0, n2=0, t1={5:0}, t2={3:0}, tmp1=0, tmp2=0] [L112] COND TRUE 0 asdf<2 [L112] 0 t1[asdf] VAL [asdf=0, asdf=2, asdf=2, e1=0, e2=0, i=1, i=2, i=3, n1=0, n2=0, t1={5:0}, t1[asdf]=-4, t2={3:0}, tmp1=0, tmp2=0] [L91] CALL 4 assume_abort_if_not(n1 == 0 || n1 > n2) [L35] COND FALSE 4 !(!cond) [L91] RET 4 assume_abort_if_not(n1 == 0 || n1 > n2) [L94] 4 i2 = i VAL [\result={0:0}, e1=0, e2=0, i=1, i=3, i=3, n1=0, n2=0, tmp1=0, tmp2=0] [L97] 4 i = i2 + 1 VAL [\result={0:0}, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, tmp1=0, tmp2=0] [L100] 4 n2 = 0 [L103] 4 return 0; [L112] FCALL, JOIN 1 pthread_join(t1[asdf], 0) VAL [asdf=0, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={5:0}, t1[asdf]=-4, t2={3:0}, tmp1=0, tmp2=0] [L112] 0 asdf++ VAL [asdf=1, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={5:0}, t2={3:0}, tmp1=0, tmp2=0] [L112] COND TRUE 0 asdf<2 [L112] 0 t1[asdf] VAL [asdf=1, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={5:0}, t1[asdf]=-3, t2={3:0}, tmp1=0, tmp2=0] [L112] FCALL, JOIN 2 pthread_join(t1[asdf], 0) VAL [asdf=1, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={5:0}, t1[asdf]=-3, t2={3:0}, tmp1=0, tmp2=0] [L112] 0 asdf++ VAL [asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={5:0}, t2={3:0}, tmp1=0, tmp2=0] [L112] COND FALSE 0 !(asdf<2) [L113] 0 int asdf=0; VAL [asdf=0, asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={5:0}, t2={3:0}, tmp1=0, tmp2=0] [L113] COND TRUE 0 asdf<2 [L113] 0 t2[asdf] VAL [asdf=0, asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={5:0}, t2={3:0}, t2[asdf]=-2, tmp1=0, tmp2=0] [L113] FCALL, JOIN 3 pthread_join(t2[asdf], 0) VAL [asdf=0, asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={5:0}, t2={3:0}, t2[asdf]=-2, tmp1=0, tmp2=0] [L113] 0 asdf++ VAL [asdf=1, asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={5:0}, t2={3:0}, tmp1=0, tmp2=0] [L113] COND TRUE 0 asdf<2 [L113] 0 t2[asdf] VAL [asdf=1, asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={5:0}, t2={3:0}, t2[asdf]=-1, tmp1=0, tmp2=0] [L113] FCALL, JOIN 4 pthread_join(t2[asdf], 0) VAL [asdf=1, asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={5:0}, t2={3:0}, t2[asdf]=-1, tmp1=0, tmp2=0] [L113] 0 asdf++ VAL [asdf=2, asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={5:0}, t2={3:0}, tmp1=0, tmp2=0] [L113] COND FALSE 0 !(asdf<2) [L115] CALL 0 assume_abort_if_not(i != 2) [L35] COND FALSE 0 !(!cond) [L115] RET 0 assume_abort_if_not(i != 2) [L116] 0 reach_error() VAL [asdf=2, asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={5:0}, t2={3:0}, tmp1=0, tmp2=0] - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 5 procedures, 124 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.1s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 0 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=1, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 2 thread instances CFG has 7 procedures, 148 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.2s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 134 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 102 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 269 IncrementalHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 1 mSDtfsCounter, 269 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=2, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 91 NumberOfCodeBlocks, 91 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 188 SizeOfPredicates, 0 NumberOfNonLiveVariables, 349 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 50/61 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 148 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.9s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 299 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 221 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 919 IncrementalHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 9 mSDtfsCounter, 919 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 440 GetRequests, 410 SyntacticMatches, 8 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=238occurred in iteration=8, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 552 NumberOfCodeBlocks, 552 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 649 ConstructedInterpolants, 0 QuantifiedInterpolants, 847 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1158 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 19 InterpolantComputations, 4 PerfectInterpolantSequences, 132/147 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-04 03:31:34,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...